Quasistatic Scale-free Networks

Details Quasistatic Scale-free Networks Quasistatic Scale-free Networks

2002-07-19

arxiv.org/abs/cond-mat/0207476v3

Phys. Rev. E 67, 012101 (2003)

Physics

Condensed Matter

Statistical Mechanics

4 pages, 5 figures

Scientific paper

10.1103/PhysRevE.67.012101

A network is formed using the $N$ sites of an one-dimensional lattice in the shape of a ring as nodes and each node with the initial degree $k_{in}=2$. $N$ links are then introduced to this network, each link starts from a distinct node, the other end being connected to any other node with degree $k$ randomly selected with an attachment probability proportional to $k^{\alpha}$. Tuning the control parameter $\alpha$ we observe a transition where the average degree of the largest node $$ changes its variation from $N^0$ to $N$ at a specific transition point of $\alpha_c$. The network is scale-free i.e., the nodal degree distribution has a power law decay for $\alpha \ge \alpha_c$.

Affiliated with

Also associated with

No associations

Rating

Quasistatic Scale-free Networks 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 Quasistatic Scale-free Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quasistatic Scale-free Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-397105