Related papers: Local limits of spatial Gibbs random graphs

This work will appear as a chapter in a forthcoming volume titled "Topics in Probabilistic Graph Theory". A theory of scaling limits for random graphs has been developed in recent years. This theory gives access to the large-scale geometric…

In the classical preferential attachment model, links form instantly to newly arriving nodes and do not change over time. We propose a hierarchical random graph model in a spatial setting, where such a time-variability arises from an…

Consider the setting of \emph{randomly weighted graphs}, namely, graphs whose edge weights are chosen independently according to probability distributions with finite support over the non-negative reals. Under this setting, properties of…

We study the limiting behavior of interacting particle systems indexed by large sparse graphs, which evolve either according to a discrete time Markov chain or a diffusion, in which particles interact directly only with their nearest…

We present a new method for learning Soft Random Geometric Graphs (SRGGs), drawn in probabilistic metric spaces, with the connection function of the graph defined as the marginal posterior probability of an edge random variable, given the…

Consider a `dense' Erd\H{o}s--R\'enyi random graph model $G=G_{n,M}$ with $n$ vertices and $M$ edges, where we assume the edge density $M/\binom{n}{2}$ is bounded away from 0 and 1. Fix $k=k(n)$ with $k/n$ bounded away from 0 and~1, and let…

We couple projective limits of probability measures to direct limits of their symmetry groups. We show that the direct limit group is the group of symmetries of the projective limit probability measure. If projective systems of probability…

We study the effect of the choice of embedding geometry on the entropy of random geometric graph ensembles with soft connection functions. First we show that when the connection range is small, the entropy is dependent only on the dimension…

In this paper, we give the relationship between spectral radius and local structures of graphs and hypergraphs. Our work shows that certain local subgraphs (subhypergraphs) must occur when the spectral radius ratio is large. We also give…

A temporal random geometric graph is a random geometric graph in which all edges are endowed with a uniformly random time-stamp, representing the time of interaction between vertices. In such graphs, paths with increasing time stamps…

We present a new notion of limits of weighted directed graphs of growing size based on convergence of their random quotients. These limits are specified in terms of random exchangeable measures on the unit square. We call our limits…

Hybrid Gibbs samplers represent a prominent class of approximated Gibbs algorithms that utilize Markov chains to approximate conditional distributions, with the Metropolis-within-Gibbs algorithm standing out as a well-known example. Despite…

Gibbs sampling on factor graphs is a widely used inference technique, which often produces good empirical results. Theoretical guarantees for its performance are weak: even for tree structured graphs, the mixing time of Gibbs may be…

This study extends a prior investigation of limit shapes for partitions of integers, which was based on analysis of sums of geometric random variables. Here we compute limit shapes for grand canonical Gibbs ensembles of partitions of sets,…

We consider a countable system of interacting (possibly non-Markovian) stochastic differential equations driven by independent Brownian motions and indexed by the vertices of a locally finite graph $G = (V,E)$. The drift of the process at…

Exponential family Random Graph Models (ERGMs) can be viewed as expressing a probability distribution on graphs arising from the action of competing social forces that make ties more or less likely, depending on the state of the rest of the…

Local sets, a graph structure invariant under local complementation, have been originally introduced in the context of quantum computing for the study of quantum entanglement within the so-called graph state formalism. A local set in a…

Let $G=(V,E)$ be a finite graph. For $v\in V$ we denote by $G_v$ the subgraph of $G$ that is induced by $v$'s neighbor set. We say that $G$ is $(a,b)$-regular for $a>b>0$ integers, if $G$ is $a$-regular and $G_v$ is $b$-regular for every…

We present a method for balancing between the Local and Global Structures (LGS) in graph embedding, via a tunable parameter. Some embedding methods aim to capture global structures, while others attempt to preserve local neighborhoods. Few…

Spatiotemporal graph neural networks have shown to be effective in time series forecasting applications, achieving better performance than standard univariate predictors in several settings. These architectures take advantage of a graph…