pith. sign in

arxiv: cond-mat/0110111 · v1 · submitted 2001-10-05 · ❄️ cond-mat.stat-mech · cond-mat.dis-nn

Cluster Growth in a Growing Tree Network

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

We analyze a simple model for growing tree networks and find that although it never percolates, there is an anomalously large cluster at finite size. We study the growth of both the maximal cluster and the cluster containing the original vertex and find that they obey power laws. This property is also observed through simulations in a non-linear model with loops and a true percolating phase.

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.