Large deviations for the degree structure in preferential attachment schemes
From MaRDI portal
Publication:1948702
DOI10.1214/12-AAP854zbMath1273.60031arXiv1105.6047MaRDI QIDQ1948702
Sunder Sethuraman, Jihyeok Choi
Publication date: 24 April 2013
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1105.6047
law of large numbers; random graphs; condensation; large deviations; degree distribution; power law; time-dependent; Preferential attachment
Related Items
A scaling limit for the degree distribution in sublinear preferential attachment schemes, Rare event asymptotics for exploration processes for random graphs, Distances and large deviations in the spatial preferential attachment model
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multigraph limit of the dense configuration model and the preferential attachment graph
- Limits of randomly grown graph sequences
- The cover time of the preferential attachment graph
- Growth of preferential attachment random graphs via continuous-time branching processes
- Random networks with sublinear preferential attachment: degree evolutions
- Generalizations of Polya's urn problem
- The diameter of a scale-free random graph
- On certain connectivity properties of the internet topology
- The degree sequence of a scale-free random graph process
- Typical Distances in Ultrasmall Random Networks
- Statistical mechanics of complex networks
- Emergence of Scaling in Random Networks
- Scale-Free Networks: A Decade and Beyond
- ON A CLASS OF SKEW DISTRIBUTION FUNCTIONS
- Width of a scale-free tree
- Scale-Free Networks
- Large-Deviation Approximations for General Occupancy Models
- Large deviations for the leaves in some random trees
- The Structure and Function of Complex Networks
- On random trees
- Finiteness and fluctuations in growing networks
- A Brief History of Generative Models for Power Law and Lognormal Distributions
- The Maximum Degree of the Barabási–Albert Random Tree
- A general model of web graphs
- Connectivity Transitions in Networks with Super-Linear Preferential Attachment
- The Influence of Search Engines on Preferential Attachment
- Rank-Based Attachment Leads to Power Law Graphs
- Random trees and general branching processes
- Networks