|
Descripción
|
|
|---|---|
| In proximity graphs to every pair of nodes it is assigned a certain vicinity, and the pair is connected if its vicinity is empty. In the automata studied here each node is characterized by a binary state and their updating is made according to a rule involving the neighborhood of each node. The effect of different types and degrees of memory of the past states embedded in nodes is assessed when considering a particularly active rule, namely the parity rule. | |
|
Internacional
|
Si |
|
Nombre congreso
|
Complex Networks: Structure, Applications and Related Topics (Net-Works 2011) |
|
Tipo de participación
|
960 |
|
Lugar del congreso
|
El Escorial (España) |
|
Revisores
|
Si |
|
ISBN o ISSN
|
2174-6036 |
|
DOI
|
|
|
Fecha inicio congreso
|
26/10/2011 |
|
Fecha fin congreso
|
28/10/2011 |
|
Desde la página
|
119 |
|
Hasta la página
|
123 |
|
Título de las actas
|
Proceedings of the International Conference "Complex Networks: Structure, Applications and Related Topics (Net-Works 2011)" |