pith. sign in

arxiv: cond-mat/0408161 · v1 · submitted 2004-08-09 · ❄️ cond-mat.dis-nn

Universal Properties of Growing Networks

classification ❄️ cond-mat.dis-nn
keywords transitionclustergrowingnetworksphasesizeuniversalaccording
0
0 comments X
read the original abstract

Networks growing according to the rule that every new node has a probability p_k of being attached to k preexisting nodes, have a universal phase diagram and exhibit power law decays of the distribution of cluster sizes in the non-percolating phase. The percolation transition is continuous but of infinite order and the size of the giant component is infinitely differentiable at the transition (though of course non-analytic). At the transition the average cluster size (of the finite components) is discontinuous.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.