Quasistatic Scale-free Networks

Abstract

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 $<k_m(\alpha ,N)>$ 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$.

4 pages, 5 figures

Cited by in corpus (6)

• Statistical mechanics of topological phase transitions in networks
• Scale free networks from a Hamiltonian dynamics
• Generation of scale-free networks using a simple preferential rewiring dynamics
• Ecology of active and passive players and their impact on information selection
• Tristable and multiple bistable activity in complex random binary networks of two-state units
• Diffusion limited friendship network: A model for six degrees of separation