A scaling limit for the degree distribution in sublinear preferential attachment schemes
From MaRDI portal
Publication:5740272
DOI10.1002/rsa.20615zbMath1385.60013arXiv1402.4088OpenAlexW1893559067MaRDI QIDQ5740272
Sunder Sethuraman, Shankar C. Venkataramani, Jihyeok Choi
Publication date: 25 July 2016
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1402.4088
uniquenesssemigrouplaw of large numbersdynamical systemrandom graphsdegree distributionpreferential attachmentfluid limitsublinear weights
Random graphs (graph-theoretic aspects) (05C80) Strong limit theorems (60F15) Combinatorial probability (60C05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Asymptotic behavior of a metapopulation model
- Kolmogorov's differential equations and positive semigroups on first moment sequence spaces
- Growth of preferential attachment random graphs via continuous-time branching processes
- A survey of random processes with reinforcement
- Differential equation approximations for Markov chains
- Random networks with sublinear preferential attachment: degree evolutions
- Erdős-Renyi random graphs \(+\) forest fires \(=\) self-organized criticality
- Differential equations for random processes and random graphs
- Large deviations for the degree structure in preferential attachment schemes
- Degree asymptotics with rates for preferential attachment random graphs
- On a preferential attachment and generalized Pólya's urn model
- The degree sequence of a scale-free random graph process
- Power Laws in Preferential Attachment Graphs and Stein's Method for the Negative Binomial Distribution
- Statistical mechanics of complex networks
- Scale-Free Networks: A Decade and Beyond
- ON A CLASS OF SKEW DISTRIBUTION FUNCTIONS
- Scale-Free Networks
- The Structure and Function of Complex Networks
- A Brief History of Generative Models for Power Law and Lognormal Distributions
- AN OVERVIEW OF SOME STOCHASTIC STABILITY METHODS(<Special Issue>Network Design, Control and Optimization)
- Connectivity Transitions in Networks with Super-Linear Preferential Attachment
- Random trees and general branching processes
- Preferential Attachment Random Graphs with General Weight Function
- Networks