A Scale-free Network with Boolean Dynamics as a Function of Connectivity
A. Castro e Silva, J. Kamphorst Leal da Silva, J. F. F. Mendes
Abstract
In this work we analyze scale-free networks with different power law spectra N(k) 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 γ.
Create a lesson
Related papers
Maximum entropy explanation for the ubiquity of power-law mechanical responses
Sverre Holm
Thermodynamic Bethe Ansatz for the Toda chain from inverse scattering transform
Alberto Brollo
Lattice spin systems coupled to a compact U(1) gauge field with negative gauge coupling favoring frustration
Claudio Bonati, Ettore Vicari
The Inverse Mean First-Passage Time Problem
Tommer D. Keidar, Shlomi Reuveni, Igor M. Sokolov
Restricted triangular ice beyond the solvable manifolds: chiral ice and the critical region of dominant chiral vertices
Josep Batle
Establishing Néel order in the square-lattice antiferromagnetic Heisenberg model: a bootstrap proof
Nisarg Chadha, Taige Wang, Pavel A. Nosov et al.