Related papers: Decay of Correlations for the Hardcore Model on th…
We study gradient models for spins taking values in the integers (or an integer lattice), which interact via a general potential depending only on the differences of the spin values at neighboring sites, located on a regular tree with d + 1…
This article considers a class of disordered mean-field combinatorial optimization problems. We focus on the Gibbs measure, where the inverse temperature does not vary with the size of the graph and the edge weights are sampled from a…
We introduce a Markov Chain Monte Carlo algorithm which samples from the space of spanning trees of complete graphs using local rewiring operations only. The probability distribution of graphs of this kind is shown to depend on the…
Random spatial networks-that is, graphs whose connectivity is governed by geometric proximity-have emerged as fundamental models for systems constrained by an underlying spatial structure. A prototypical example is the random geometric…
This paper studies the problem of recovering the hidden vertex correspondence between two edge-correlated random graphs. We focus on the Gaussian model where the two graphs are complete graphs with correlated Gaussian weights and the…
Random geometric graphs result from taking $n$ uniformly distributed points in the unit cube, $[0,1]^d$, and connecting two points if their Euclidean distance is at most $r$, for some prescribed $r$. We show that monotone properties for…
This paper considers limit theorems associated with subgraph counts in the age-dependent random connection model. First, we identify regimes where the count of sub-trees converges weakly to a stable random variable under suitable…
We study the mixing time of random graphs in the $d$-dimensional toric unit cube $[0,1]^d$ generated by the geographical threshold graph (GTG) model, a generalization of random geometric graphs (RGG). In a GTG, nodes are distributed in a…
In this paper we show that the random degree constrained process (a time-evolving random graph model with degree constraints) has a local weak limit, provided that the underlying host graphs are high degree almost regular. We, moreover,…
In this article, we derive Stein's method for approximating a spatial random graph by a generalised random geometric graph, which has vertices given by a finite Gibbs point process and edges based on a general connection function. Our main…
When two graphs have a correlated Bernoulli distribution, we prove that the alignment strength of their natural bijection strongly converges to a novel measure of graph correlation $\rho_T$ that neatly combines intergraph with intragraph…
I provide numerical evidence for the robustness of the Griffiths phase (GP) reported previously in dynamical threshold model simulations on a large human brain network with N=836733 connected nodes. The model, with equalized network…
How can the `affinity' or `strength' of ties of a random graph be characterized and compactly represented? How can concepts like Fourier and inverse-Fourier like transform be developed for graph data? To do so, we introduce a new…
Consider a bipartite random geometric graph on the union of two independent homogeneous Poisson point processes in $d$-space, with distance parameter $r$ and intensities $\lambda,\mu$. We show for $d \geq 2$ that if $\lambda$ is…
The Gibbs measures of a spin system on $Z^d$ with unbounded pair interactions $J_{xy} \sigma (x) \sigma (y)$ are studied. Here $\langle x, y \rangle \in E $, i.e. $x$ and $y$ are neighbors in $Z^d$. The intensities $J_{xy}$ and the spins…
We study the large-volume behavior of the spherical model for $d$-dimensional local spins, in the presence of $d$-dimensional random fields, for $d\geq 2$. We compare two models, one with volume-scaled random fields, and another one with…
We study a model of random $\mathcal{R}$-enriched trees that is based on weights on the $\mathcal{R}$-structures and allows for a unified treatment of a large family of random discrete structures. We establish distributional limits…
Averaged spin-spin correlation function squared $\overline{<\sigma(0)\sigma(R)>^{2}}$ is calculated for the ferromagnetic random bond Potts model. The technique being used is the renormalization group plus conformal field theory. The…
We study the problem of approximately counting matchings in hypergraphs of bounded maximum degree and maximum size of hyperedges. With an activity parameter $\lambda$, each matching $M$ is assigned a weight $\lambda^{|M|}$. The counting…
We study random digraphs on sequences of expanders with bounded average degree {which converge locally in probability}. We prove that the threshold for the existence of a giant strongly connected component, as well as the asymptotic…