arXiv · cond-mat/0410469
A Scale-free Network with Boolean Dynamics as a Function of Connectivity
Abstract
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 $γ$.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
A. Castro e Silva, J. Kamphorst Leal da Silva, J. F. F. Mendes. 2004-10-19. A Scale-free Network with Boolean Dynamics as a Function of Connectivity. https://arxiv.org/abs/cond-mat/0410469
Cite the original work for its findings. Save a collection to share your selection of sources.