Random networks with sublinear preferential attachment: degree evolutions
From MaRDI portal
Abstract: We define a dynamic model of random networks, where new vertices are connected to old ones with a probability proportional to a sublinear function of their degree. We first give a strong limit law for the empirical degree distribution, and then have a closer look at the temporal evolution of the degrees of individual vertices, which we describe in terms of large and moderate deviation principles. Using these results, we expose an interesting phase transition: in cases of strong preference of large degrees, eventually a single vertex emerges forever as vertex of maximal degree, whereas in cases of weak preference, the vertex of maximal degree is changing infinitely often. Loosely speaking, the transition between the two phases occurs in the case when a new edge is attached to an existing vertex with a probability proportional to the root of its current degree.
Recommendations
- On the degree evolution of a fixed vertex in some growing networks
- Sublinear preferential attachment combined with a growing number of choices
- Random networks with sublinear preferential attachment: the giant component
- A scaling limit for the degree distribution in sublinear preferential attachment schemes
- Random networks with concave preferential attachment rule
Cited in
(46)- Further properties of a random graph with duplications and deletions
- Random networks with sublinear preferential attachment: the giant component
- Weights and degrees in a random graph model based on 3-interactions
- Distance evolutions in growing preferential attachment graphs
- Growth of common friends in a preferential attachment model
- On dynamic random graphs with degree homogenization via anti-preferential attachment probabilities
- A preferential attachment model with random initial degrees
- Degree evolution in a general growing network
- Spatial networks and percolation. Abstracts from the workshop held January 17--23, 2021 (hybrid meeting)
- Robust analysis of preferential attachment models with fitness
- Core size and densification in preferential attachment networks
- A preferential attachment process approaching the Rado graph
- A phase transition for preferential attachment models with additive fitness
- Degree centrality and root finding in growing random networks
- Near critical preferential attachment networks have small giant components
- Competing growth processes with random growth rates and random birth times
- Degree distributions in recursive trees with fitnesses
- Asymptotic degree distribution in preferential attachment graph models with multiple type edges
- Distances and large deviations in the spatial preferential attachment model
- Condensation phenomena in preferential attachment trees with neighbourhood influence
- The maximal degree in random recursive graphs with random weights
- On a preferential attachment and generalized Pólya's urn model
- A scaling limit for the degree distribution in sublinear preferential attachment schemes
- Steady and ranging sets in graph persistence
- On the degree evolution of a fixed vertex in some growing networks
- Preferred attachment in affiliation networks
- Twitter event networks and the superstar model
- Persistence of hubs in growing random networks
- Typical distances in ultrasmall random networks
- MATRIX-MFO tandem workshop: Stochastic reinforcement processes and graphs. Abstracts from the MATRIX-MFO tandem workshop held March 5--10, 2023
- Random graphs and their subgraphs
- Sublinear but never superlinear preferential attachment by local network growth
- Directed hybrid random networks mixing preferential attachment with uniform attachment mechanisms
- Root finding algorithms and persistence of Jordan centrality in growing random trees
- On nodes of small degrees and degree profile in preferential dynamic attachment circuits
- Spatial preferential attachment networks: power laws and clustering coefficients
- Random networks with preferential growth and vertex death
- Large deviations for the degree structure in preferential attachment schemes
- Sublinear preferential attachment combined with a growing number of choices
- Fluctuations in a general preferential attachment model via Stein's method
- On terminal nodes and the degree profile of preferential dynamic attachment circuits
- Not all interventions are equal for the height of the second peak
- Connectivity Transitions in Networks with Super-Linear Preferential Attachment
- Local weak convergence for PageRank
- Large deviations for the leaves in some random trees
- Co-evolving dynamic networks
This page was built for publication: Random networks with sublinear preferential attachment: degree evolutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1039099)
