Preferencial growth: exact solution of the time dependent distributions

Abstract

We consider a preferential growth model where particles are added one by one to the system consisting of clusters of particles. A new particle can either form a new cluster (with probability q) or join an already existing cluster with a probability proportional to the size thereof. We calculate exactly the probability $\Pm_i(k,t)$ that the size of the i-th cluster at time t is k. We analyze the asymptotics, the scaling properties of the size distribution and of the mean size as well as the relation of our system to recent network models.

8 pages, 4 figures

Cited by in corpus (20)

• Statistical mechanics of complex networks
• Evolution of networks
• Measuring preferential attachment for evolving networks
• Percolation on complex networks: Theory and application
• Anomalous percolating properties of growing networks
• Finiteness and Fluctuations in Growing Networks
• Evolving networks with disadvantaged long-range connections
• Scale Free Networks from Self-Organisation
• Exactly solvable scale-free network model
• Phase transition and information cascade in a voting model
• Unidirectional Random Growth with Resetting
• Approach of complexity in nature: Entropic nonuniqueness
• Wikipedia edition dynamics
• Dynamical Stationarity as a Result of Sustained Random Growth
• Stratification in the Preferential Attachment Network
• Preferential growth: Solution and application to modeling stock market
• Finite-time fluctuations in the degree statistics of growing networks
• Equilibrium distributions in entropy driven balanced processes
• Degree-distribution Stability of Growing Networks
• Coherence in complex networks of oscillators