Graphical Construction of Spatial Gibbs Random Graphs

08/23/2019
by   Andressa Cerqueira, et al.
0

We present a Spatial Gibbs Random Graphs Model that incorporates the interplay between the statistics of the graph and the underlying space where the vertices are located. We propose a graphical construction of a model with vertices located in a finite subset of Z^2 that penalizes edges between distant vertices as well as other structures such as stars or triangles. We prove the existence and uniqueness of a measure defined on graphs with vertices in Z^2 as the limit along the measures over graphs with finite vertex set. Moreover, a perfect simulation algorithm is obtained in order to sample a subgraph from the measure defined on graphs with vertex set Z^2.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/12/2020

Sparse universal graphs for planarity

We show that for every integer n≥ 1 there exists a graph G_n with (1+o(1...
research
06/30/2020

Dichotomizing k-vertex-critical H-free graphs for H of order four

For k ≥ 3, we prove (i) there is a finite number of k-vertex-critical (P...
research
02/05/2022

Graphical parameters for classes of tumbling block graphs

The infinite tumbling block graph is a bipartite graph, where each verte...
research
04/28/2022

Sums of Distances on Graphs and Embeddings into Euclidean Space

Let G=(V,E) be a finite, connected graph. We consider a greedy selection...
research
11/24/2020

Dynamics of epidemic spreading on connected graphs

We propose a new model that describes the dynamics of epidemic spreading...
research
04/06/2020

DySky: Dynamic Skyline Queries on Uncertain Graphs

Given a graph, and a set of query vertices (subset of the vertices), the...
research
11/12/2019

Terrain Visibility Graphs and Cyclic Polytope Triangulations

We prove a bijection between the triangulations of the 3-dimensional cyc...

Please sign up or login with your details

Forgot password? Click here to reset