Spatial Gibbs random graphs
From MaRDI portal
Abstract: Many real-world networks of interest are embedded in physical space. We present a new random graph model aiming to reflect the interplay between the geometries of the graph and of the underlying space. The model favors configurations with small average graph distance between vertices, but adding an edge comes at a cost measured according to the geometry of the ambient physical space. In most cases, we identify the order of magnitude of the average graph distance as a function of the parameters of the model. As the proofs reveal, hierarchical structures naturally emerge from our simple modeling assumptions. Moreover, a critical regime exhibits an infinite number of discontinuous phase transitions.
Recommendations
Cites work
- scientific article; zbMATH DE number 2119680 (Why is no real title available?)
- A Geometric Preferential Attachment Model of Networks
- A spatial web graph model with local influence regions
- Connected spatial networks over random points and a route-length statistic
- Degree sequences of geometric preferential attachment graphs
- Discontinuity of the percolation density in one dimensional \(1/| x- y| ^ 2\) percolation models
- Emergence of Scaling in Random Networks
- Emergence of hierarchy in cost-driven growth of spatial networks
- Estimating and understanding exponential random graph models
- Geometric graph properties of the spatial preferred attachment model
- Graph diameter in long-range percolation
- Large deviations for weighted sums of stretched exponential random variables
- Lyapunov exponents of random walks in small random potential: the lower bound
- ON A CLASS OF SKEW DISTRIBUTION FUNCTIONS
- On the scaling of the chemical distance in long-range percolation models
- One dimensional \(1/| j-i| ^ s\) percolation models: The existence of a transition for s\(\leq 2\)
- Random graphs and complex networks. Volume 1
- Robustness of scale-free spatial networks
- Scale-free percolation
- Short-length routes in low-cost networks via Poisson line patterns
- Some Typical Properties of the Spatial Preferred Attachment Model
- Some further notes on a class of skew distribution functions
- Spatial preferential attachment networks: power laws and clustering coefficients
- Symmetric graph properties have independent edges
- The diameter of long-range percolation clusters on finite cycles
- Uniqueness of the infinite cluster and continuity of connectivity functions for short and long range percolation
- Uniqueness of the infinite component in a random graph with applications to percolation and spin glasses
Cited in
(10)- The age-dependent random connection model
- Random geometric graph: some recent developments and perspectives
- Modeling spatial networks by contact graphs of disk packings
- A spatial small-world graph arising from activity-based reinforcement
- Graphical construction of spatial Gibbs random graphs
- The contact process on random hyperbolic graphs: metastability and critical exponents
- Uniform linear embeddings of spatial random graphs
- Extrapolation and sampling for processes on spatial graphs
- Space as a low-temperature regime of graphs
- Local limits of spatial Gibbs random graphs
This page was built for publication: Spatial Gibbs random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1650089)
