Observatorio de I+D+i UPM

Memorias de investigación
Communications at congresses:
Automata with memory on proximity graphs
Year:2011
Research Areas
  • Physics chemical and mathematical
Information
Abstract
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.
International
Si
Congress
Complex Networks: Structure, Applications and Related Topics (Net-Works 2011)
960
Place
El Escorial (España)
Reviewers
Si
ISBN/ISSN
2174-6036
Start Date
26/10/2011
End Date
28/10/2011
From page
119
To page
123
Proceedings of the International Conference "Complex Networks: Structure, Applications and Related Topics (Net-Works 2011)"
Participants
  • Autor: Ramon Alonso Sanz (UPM)
Research Group, Departaments and Institutes related
  • Creador: Grupo de Investigación: Grupo de Sistemas Complejos
  • Departamento: Estadística y Métodos de Gestión en Agricultura
S2i 2019 Observatorio de investigación @ UPM con la colaboración del Consejo Social UPM
Cofinanciación del MINECO en el marco del Programa INNCIDE 2011 (OTR-2011-0236)
Cofinanciación del MINECO en el marco del Programa INNPACTO (IPT-020000-2010-22)