Asymptotic behavior and distributional limits of preferential attachment graphs
From MaRDI portal
Publication:2438744
DOI10.1214/12-AOP755zbMath1296.60010arXiv1401.2792MaRDI QIDQ2438744
Noam Berger, Amin Saberi, Christian Borgs, Jennifer T. Chayes
Publication date: 6 March 2014
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.2792
Random graphs (graph-theoretic aspects) (05C80) Special processes (60K99) Combinatorial probability (60C05)
Related Items
Exponential extinction time of the contact process on finite graphs, Correlated randomly growing graphs, From trees to graphs: collapsing continuous-time branching processes, 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, Local weak convergence for PageRank, 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, Controllability, matching ratio and graph convergence, Locality of random digraphs on expanders, On nodes of small degrees and degree profile in preferential dynamic attachment circuits, Sparse Graphs Using Exchangeable Random Measures, Coexistence in Preferential Attachment Networks, Preferential attachment graphs with co-existing types of different fitnesses, Pólya urns with immigration at random times, Metastability: A Brief Introduction Through Three Examples, Fragility of nonconvergence in preferential attachment graphs with three types, Scaling limits and influence of the seed graph in preferential attachment trees, Non-convergence of proportions of types in a preferential attachment graph with three co-existing types, Contact processes on random graphs with power law degree distributions have critical value 0, Subgraphs in preferential attachment models, The contact process on random hyperbolic graphs: metastability and critical exponents, Geometry of weighted recursive and affine preferential attachment trees, Metastability for the contact process on the preferential attachment graph, On the dense preferential attachment graph models and their graphon induced counterpart, Joint degree distributions of preferential attachment random graphs, Studies on generalized Yule models, Pagerank asymptotics on directed preferential attachment networks, Spatial preferential attachment networks: power laws and clustering coefficients, Random intersection graphs with communities, Distance evolutions in growing preferential attachment graphs, On local weak limit and subgraph counts for sparse random graphs, Action convergence of operators and graphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
- Limits of dense graph sequences
- On limits of finite graphs
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Relaxing the uniformity and independence assumptions using the concept of fractal dimension
- Recurrence of distributional limits of finite planar graphs
- The diameter of a scale-free random graph
- Statistical mechanics of complex networks
- Emergence of Scaling in Random Networks
- Robustness and Vulnerability of Scale-Free Random Graphs
- Left and right convergence of graphs with bounded degree
- Sparse graphs: Metrics and random models
- Random trees and general branching processes
- Asymptotic Enumeration of Spanning Trees
- Probability