vix.ing · top · new · best · stats · spec

A Scale-free Network with Boolean Dynamics as a Function of Connectivity

2004/10/19 by A. Castro e Silva, Silva, A. Castro e, J. Kamphorst Leal da Silva +3
Biochemistry, Genetics and Molecular Biology · Mathematics · Physics and Astronomy · #Complex Network Analysis Techniques #Disordered Systems and Neural Networks (cond-mat.dis-nn) #FOS: Physical sciences #Graph theory and applications #Protein Structure and Dynamics #Statistical Mechanics (cond-mat.stat-mech) #cond-mat.dis-nn #cond-mat.stat-mech

paper · pdf · doi:10.48550/arxiv.cond-mat/0410469

8 pages, 7 Postscript; to appear in Phys. Rev. E

arxiv created 2004/10/19 · openalex publication_date 2004/10/19 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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 γ.

Related