Distances and large deviations in the spatial preferential attachment model

DOI10.3150/19-BEJ1121MaRDI QIDQ2295022zbMATH OpenOpenAlexFDO

Authors 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, https://projecteuclid.org/euclid.bj/1580461568

zbMATH Keywords

distanceslarge deviation principlePoisson point processpreferential attachment

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Large deviations (60F10) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Abstract: We investigate two asymptotic properties of a spatial preferential-attachment model introduced by E. Jacob and P. M"orters (2013). First, in a regime of strong linear reinforcement, we show that typical distances are at most of doubly-logarithmic order. Second, we derive a large deviation principle for the empirical neighbourhood structure and express the rate function as solution to an entropy minimisation problem in the space of stationary marked point processes.

Recommendations

• Some Typical Properties of the Spatial Preferred Attachment Model
• Some typical properties of the spatial preferred attachment model
• A spatial preferential attachment model with local clustering
• Weighted distances in scale-free preferential attachment models
• Typical distances in ultrasmall random networks

Cites work

• A spatial preferential attachment model with local clustering
• Exponential approximations in completely regular topological spaces and extensions of Sanov's theorem
• scientific article; zbMATH DE number 1158743 (Why is no real title available?)
• Large deviations and the maximum entropy principle for marked point random fields
• Large deviations for the degree structure in preferential attachment schemes
• Large deviations of empirical neighborhood distribution in sparse random graphs
• Random Networks for Communication
• Random networks with sublinear preferential attachment: degree evolutions
• Robustness of scale-free spatial networks
• Spatial preferential attachment networks: power laws and clustering coefficients
• Surface order large deviations for high-density percolation
• The age-dependent random connection model

Cited in

(13)

• Distance evolutions in growing preferential attachment graphs
• Recurrence versus transience for weight-dependent random connection models
• The age-dependent random connection model
• Chemical distance in geometric random graphs with long edges and scale-free degree distribution
• Some Typical Properties of the Spatial Preferred Attachment Model
• Asymmetric Distribution of Nodes in the Spatial Preferred Attachment Model
• Tail Bounds for the Stable Marriage of Poisson and Lebesgue
• Geometric preferential attachment in non-uniform metric spaces
• Local clustering coefficient of spatial preferential attachment model
• Graph distances in scale-free percolation: the logarithmic case
• Recurrence and transience of symmetric random walks with long-range jumps
• Relative density of the random \(R\)-factor proximity catch digraph for testing spatial patterns of segregation and association
• Diameters in preferential attachment models

This page was built for publication: Distances and large deviations in the spatial preferential attachment model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2295022)