Distances and large deviations in the spatial preferential attachment model
From MaRDI portal
Publication:2295022
DOI10.3150/19-BEJ1121zbMath1466.60209arXiv1809.09956OpenAlexW3003913822MaRDI QIDQ2295022
Christian Hirsch, Christian Mönch
Publication date: 12 February 2020
Published in: Bernoulli (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1809.09956
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Large deviations (60F10) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55)
Related Items (6)
Graph distances in scale-free percolation: the logarithmic case ⋮ Recurrence versus transience for weight-dependent random connection models ⋮ Chemical distance in geometric random graphs with long edges and scale-free degree distribution ⋮ Recurrence and transience of symmetric random walks with long-range jumps ⋮ The age-dependent random connection model ⋮ Distance evolutions in growing preferential attachment graphs
Cites Work
- Unnamed Item
- Large deviations of empirical neighborhood distribution in sparse random graphs
- Random networks with sublinear preferential attachment: degree evolutions
- Large deviations and the maximum entropy principle for marked point random fields
- Exponential approximations in completely regular topological spaces and extensions of Sanov's theorem
- Surface order large deviations for high-density percolation
- Large deviations for the degree structure in preferential attachment schemes
- Robustness of scale-free spatial networks
- The age-dependent random connection model
- Spatial preferential attachment networks: power laws and clustering coefficients
- A Spatial Preferential Attachment Model with Local Clustering
- Random Networks for Communication
This page was built for publication: Distances and large deviations in the spatial preferential attachment model