Gibbs Random Graphs
Pablo A. Ferrari, Eugene A. Pechersky, Valentin V. Sisko, Anatoly, A. Yambartsev

TL;DR
This paper investigates percolation phenomena in Gibbs random graphs formed on locally finite point sets in R^d, analyzing how open edges percolate under different spatial configurations and interaction rules.
Contribution
It introduces a Gibbs measure framework for sub-graphs on point sets and studies their percolation properties in both random and fixed configurations.
Findings
Percolation occurs under certain conditions for Poisson samples.
Exponential decay of connectivity influences percolation thresholds.
Results extend understanding of phase transitions in spatial Gibbs graphs.
Abstract
Consider a discrete locally finite subset of and the complete graph , with vertices and edges . We consider Gibbs measures on the set of sub-graphs with vertices and edges . The Gibbs interaction acts between open edges having a vertex in common. We study percolation properties of the Gibbs distribution of the graph ensemble. The main results concern percolation properties of the open edges in two cases: (a) when the is a sample from homogeneous Poisson process and (b) for a fixed with exponential decay of connectivity.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Complex Network Analysis Techniques · Markov Chains and Monte Carlo Methods
