A Scale-free Network with Boolean Dynamics as a Function of Connectivity
| dc.creator | Silva, A. Castro e | |
| dc.creator | da Silva, J. Kamphorst Leal | |
| dc.creator | Mendes, J. F. F. | |
| dc.date | 2004-10-19 | |
| dc.date.accessioned | 2026-07-07T03:01:34Z | |
| dc.date.available | 2026-07-07T03:01:34Z | |
| dc.description | In this work we analyze scale-free networks with different power law spectra $N(k) \sim k^{-γ}$ under a boolean dynamic, where the boolean rule that each node obeys is a function of its connectivity $k$. This is done by using only two logical functions (AND and XOR) which are controlled by a parameter $q$. Using damage spreading technique we show that the Hamming distance and the number of 1's exhibit power law behavior as a function of $q$. The exponents appearing in the power laws depend on the value of $γ$. | |
| dc.description | 8 pages, 7 Postscript; to appear in Phys. Rev. E | |
| dc.identifier | https://arxiv.org/abs/cond-mat/0410469 | |
| dc.identifier | http://arxiv.org/abs/cond-mat/0410469 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/25093 | |
| dc.subject | Statistical Mechanics | |
| dc.subject | Disordered Systems and Neural Networks | |
| dc.title | A Scale-free Network with Boolean Dynamics as a Function of Connectivity | |
| dc.type | text |