Spatial preferential attachment networks: power laws and clustering coefficients
DOI10.1214/14-AAP1006zbMath1310.05185arXiv1210.3830OpenAlexW1970878284MaRDI QIDQ2341627
Publication date: 27 April 2015
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.3830
degree distributionpower lawclustering coefficientpreferential attachmentBarabási-Albert modelscale-free networkgeometric random graphdynamical random graphedge length distribution
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Stochastic network models in operations research (90B15) Combinatorial probability (60C05)
Related Items (31)
Cites Work
- Geometric preferential attachment in non-uniform metric spaces
- Random networks with sublinear preferential attachment: degree evolutions
- Weak laws of large numbers in geometric probability
- Geometric graph properties of the spatial preferred attachment model
- Random networks with sublinear preferential attachment: the giant component
- Random networks with concave preferential attachment rule
- Asymptotic behavior and distributional limits of preferential attachment graphs
- Some Typical Properties of the Spatial Preferred Attachment Model
- Sparse random graphs with clustering
- Statistical mechanics of complex networks
- A Spatial Web Graph Model with Local Influence Regions
- Emergence of Scaling in Random Networks
- Degree sequences of geometric preferential attachment graphs
- Random Geometric Graphs
- Robustness and Vulnerability of Scale-Free Random Graphs
- Random trees and general branching processes
- A Geometric Preferential Attachment Model of Networks II
- A Geometric Preferential Attachment Model of Networks
This page was built for publication: Spatial preferential attachment networks: power laws and clustering coefficients