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

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

2004-10-19

arxiv.org/abs/cond-mat/0410469v1

Physics

Condensed Matter

Statistical Mechanics

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

Scientific paper

In this work we analyze scale-free networks with different power law spectra $N(k) \sim k^{-\gamma}$ 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 $\gamma$.

Affiliated with

Also associated with

No associations

Rating

A Scale-free Network with Boolean Dynamics as a Function of Connectivity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Scale-free Network with Boolean Dynamics as a Function of Connectivity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Scale-free Network with Boolean Dynamics as a Function of Connectivity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-512437