2000 character limit reached
Gibbs Random Graphs (1002.0610v2)
Published 2 Feb 2010 in math.PR, math-ph, and math.MP
Abstract: Consider a discrete locally finite subset $\Gamma$ of $Rd$ and the complete graph $(\Gamma,E)$, with vertices $\Gamma$ and edges $E$. We consider Gibbs measures on the set of sub-graphs with vertices $\Gamma$ and edges $E'\subset E$. 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 $\Gamma$ is a sample from homogeneous Poisson process and (b) for a fixed $\Gamma$ with exponential decay of connectivity.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.