Local limits of spatial Gibbs random graphs
From MaRDI portal
Large deviations (60F10) Extreme value theory; extremal stochastic processes (60G70) Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Density (toughness, etc.) (05C42) Dynamics of disordered systems (random Ising systems, etc.) in time-dependent statistical mechanics (82C44)
Abstract: We study the spatial Gibbs random graphs introduced in [MV16] from the point of view of local convergence. These are random graphs embedded in an ambient space consisting of a line segment, defined through a probability measure that favors graphs of small (graph-theoretic) diameter but penalizes the presence of edges whose extremities are distant in the geometry of the ambient space. In [MV16] these graphs were shown to exhibit threshold behavior with respect to the various parameters that define them; this behavior was related to the formation of hierarchical structures of edges organized so as to produce a small diameter. Here we prove that, for certain values of the underlying parameters, the spatial Gibbs graphs may or may not converge locally, in a manner that is compatible with the aforementioned hierarchical structures.
Recommendations
Cites work
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
- Large deviations for sums of partly dependent random variables
- Recurrence of distributional limits of finite planar graphs
- Unimodular random trees
Cited in
(5)
This page was built for publication: Local limits of spatial Gibbs random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5208900)
