Connectivity Transitions in Networks with Super-Linear Preferential Attachment
From MaRDI portal
Abstract: We analyze an evolving network model of Krapivsky and Redner in which new nodes arrive sequentially, each connecting to a previously existing node b with probability proportional to the p-th power of the in-degree of b. We restrict to the super-linear case p>1. When 1+1/k< p leq 1 + 1/(k-1) the structure of the final countable tree is determined. There is a finite tree T with distinguished v (which has a limiting distribution) on which is "glued" a specific infinite tree. v has an infinite number of children, an infinite number of which have k-1 children, and there are only a finite number of nodes (possibly only v) with k or more children. Our basic technique is to embed the discrete process in a continuous time process using exponential random variables, a technique that has previously been employed in the study of balls-in-bins processes with feedback.
Recommendations
- On the growth of a superlinear preferential attachment scheme
- Random networks with sublinear preferential attachment: degree evolutions
- Sublinear but never superlinear preferential attachment by local network growth
- The power of choice combined with preferential attachement
- Emergence of the giant component in preferential-attachment growing networks
Cited in
(33)- The dynamics of power laws: fitness and aging in preferential attachment trees
- Large deviations for the degree structure in preferential attachment schemes
- On a preferential attachment and generalized Pólya's urn model
- Persistence of hubs in growing random networks
- Condensation phenomena in preferential attachment trees with neighbourhood influence
- Influence of the seed in affine preferential attachment trees
- On the growth of a superlinear preferential attachment scheme
- The emergence of ``super-groups in dynamical networks
- Consistency of Hill estimators in a linear preferential attachment model
- A random growth model with any real or theoretical degree distribution
- Limit of a nonpreferential attachment multitype network model
- Random networks with preferential growth and vertex death
- Sublinear but never superlinear preferential attachment by local network growth
- First passage properties of a generalized Pólya urn
- Universality for distances in power-law random graphs
- Entropy and Hausdorff dimension in random growing trees
- A preferential attachment process approaching the Rado graph
- Random walks exhibiting anomalous diffusion: elephants, urns and the limits of normality
- Preferential attachment processes approaching the Rado multigraph
- Preferential attachment when stable
- Finite-time influence systems and the wisdom of crowd effect
- Random trees and general branching processes
- A scaling limit for the degree distribution in sublinear preferential attachment schemes
- Preferential attachment with choice
- MATRIX-MFO tandem workshop: Stochastic reinforcement processes and graphs. Abstracts from the MATRIX-MFO tandem workshop held March 5--10, 2023
- Degree distributions in recursive trees with fitnesses
- Degree evolution in a general growing network
- Structural results for the tree builder random walk
- Fixation of leadership in non-Markovian growth processes
- Twitter event networks and the superstar model
- Growth of preferential attachment random graphs via continuous-time branching processes
- Diameters in preferential attachment models
- Attraction time for strongly reinforced walks
This page was built for publication: Connectivity Transitions in Networks with Super-Linear Preferential Attachment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5291243)
