Asymptotic behavior and distributional limits of preferential attachment graphs
This paper investigates the weak limit of the a random graph that is constructed via the Barabási-Albert model. The authors consider a variation of the Barabási-Albert model which does not create loops. They consider three versions of it which they call the independent model, the conditional model and the sequential model, respectively. In each one of the models, each incoming vertex throws \(m\) edges to the existing graph and the way these are attached to the existing vertices defines the above models. In the independent model, each one of the \(m\) neighbours is chosen independently with probability proportional to the degree of the chosen vertex. The conditional model is a variation of the independent model where, when the \(m\) neighbours are chosen, no multiple edges are created. Finally, the sequential model is a interpolation between the preferential attachment and the uniform choice of neighbours: each one of the \(m\) edges chooses a neighbour either uniformly, with probability \(\alpha\), among the existing vertices or, with probability \(1-\alpha\), a vertex is chosen with probability proportional to its degree. The first result of the paper gives a ``static version of the distribution of the resulting random graph which they call the Pólya urn representation. Subsequently, they show that this sequence converges to a certain limiting random graph which the authors call the Pólya-point graph. The convergence here is in the Benjamini-Schramm sense, which is related to the isomorpshism type of the neighbourhood of a randomly chosen vertex. The authors also use a lemma that is due to Lovasz to deduce also the convergence of small subgraph frequencies, which they determine.
- Joint degree distributions of preferential attachment random graphs
- Degree asymptotics with rates for preferential attachment random graphs
- Degree distribution nearby the origin of a preferential attachment graph
- Fluctuations in a general preferential attachment model via Stein's method
- Growth of preferential attachment random graphs via continuous-time branching processes
- Asymptotic Enumeration of Spanning Trees
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
- Counting graph homomorphisms
- Emergence of Scaling in Random Networks
- scientific article; zbMATH DE number 1195774 (Why is no real title available?)
- Kronecker graphs: an approach to modeling networks
- Left and right convergence of graphs with bounded degree
- Limits of dense graph sequences
- On limits of finite graphs
- On the spread of viruses on the Internet
- Probability. Theory and examples.
- Random trees and general branching processes
- Recurrence of distributional limits of finite planar graphs
- Relaxing the uniformity and independence assumptions using the concept of fractal dimension
- Robustness and Vulnerability of Scale-Free Random Graphs
- Sparse graphs: metrics and random models
- Statistical mechanics of complex networks
- The diameter of a scale-free random graph
- Pólya urns with immigration at random times
- Degree asymptotics with rates for preferential attachment random graphs
- Non-convergence of proportions of types in a preferential attachment graph with three co-existing types
- The contact process on random hyperbolic graphs: metastability and critical exponents
- Geometry of weighted recursive and affine preferential attachment trees
- Pagerank asymptotics on directed preferential attachment networks
- Distance evolutions in growing preferential attachment graphs
- Correlated randomly growing graphs
- On the continuous-time limit of the Barabási-Albert random graph
- Local weak convergence for PageRank
- On nodes of small degrees and degree profile in preferential dynamic attachment circuits
- Fragility of nonconvergence in preferential attachment graphs with three types
- Studies on generalized Yule models
- Spatial preferential attachment networks: power laws and clustering coefficients
- Controllability, matching ratio and graph convergence
- Exponential extinction time of the contact process on finite graphs
- On symmetry of uniform and preferential attachment graphs
- Random graphs associated to some discrete and continuous time preferential attachment models
- Isomorphism and embedding problems for infinite limits of scale-free graphs
- Limit of a nonpreferential attachment multitype network model
- Metastability: a brief introduction through three examples
- Metastability for the contact process on the preferential attachment graph
- Multigraph limit of the dense configuration model and the preferential attachment graph
- From trees to graphs: collapsing continuous-time branching processes
- Sparse graphs using exchangeable random measures
- Preferential attachment graphs with co-existing types of different fitnesses
- Scaling limits and influence of the seed graph in preferential attachment trees
- Asymmetry and structural information in preferential attachment graphs
- Random intersection graphs with communities
- Action convergence of operators and graphs
- A finite memory interacting Pólya contagion network and its approximating dynamical systems
- Giant descendant trees, matchings, and independent sets in age-biased attachment graphs
- Subgraphs in preferential attachment models
- Fluctuations in a general preferential attachment model via Stein's method
- On the dense preferential attachment graph models and their graphon induced counterpart
- Joint degree distributions of preferential attachment random graphs
- Coexistence in preferential attachment networks
- On a memory game and preferential attachment graphs
- On local weak limit and subgraph counts for sparse random graphs
- On Bollobás‐Riordan random pairing model of preferential attachment graph
- MATRIX-MFO tandem workshop: Stochastic reinforcement processes and graphs. Abstracts from the MATRIX-MFO tandem workshop held March 5--10, 2023
- Locality of random digraphs on expanders
- Attribute network models, stochastic approximation and network sampling
- Open problems in stochastic reinforcement models
- Local limit of the random degree constrained process
- Multivariate regular variation of preferential attachment models
- Power-law hypothesis for PageRank on undirected graphs
- Degree counts in random simplicial complexes of the preferential attachment type
- The topological behavior of preferential attachment graphs
- Competing types in preferential attachment graphs with community structure
- Local weak limits for collapsed branching processes with random out-degrees
- Local weak limit of preferential attachment random trees with additive fitness
- Hydrodynamic limits of non-Markovian interacting particle systems on sparse graphs
- Dynamic random graphs with vertex removal
- The friendship paradox for sparse random graphs
- Percolation on preferential attachment models
- On symmetry of uniform and preferential attachment graphs
- Contact processes on random graphs with power law degree distributions have critical value 0
This page was built for publication: Asymptotic behavior and distributional limits of preferential attachment graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2438744)
