Related papers: Graph distances of continuum long-range percolatio…
We introduce a new correlated percolation model on the $d$-dimensional lattice $\mathbb{Z}^d$ called the random length worms model. Assume given a probability distribution on the set of positive integers (the length distribution) and $v \in…
Graph-limit theory focuses on the convergence of sequences of graphs when the number of nodes becomes arbitrarily large. This framework defines a continuous version of graphs allowing for the study of dynamical systems on very large graphs,…
We identify the upper large deviation probability for the number of edges in scale-free geometric random graph models as the space volume goes to infinity. Our result covers the models of scale-free percolation, the Boolean model with…
In this note we study the phase transition for percolation on quasi-transitive graphs with quasi-transitively inhomogeneous edge-retention probabilities. A quasi-transitive graph is an infinite graph with finitely many different "types" of…
A significant generalization of the Erd\"os-R\'enyi random graph model is an `inhomogeneous' random graph where the edge probabilities vary according to vertex types. We identify the threshold value for this random graph with a finite…
We consider instances of long-range percolation on $\mathbb Z^d$ and $\mathbb R^d$, where points at distance $r$ get connected by an edge with probability proportional to $r^{-s}$, for $s\in (d,2d)$, and study the asymptotic of the…
In this paper we introduce a new notion of convergence of sparse graphs which we call Large Deviations or LD-convergence and which is based on the theory of large deviations. The notion is introduced by "decorating" the nodes of the graph…
We describe the critical window for percolation in the universality class of sparse growing random graphs. In our models, vertices arrive sequentially and connect independently to each earlier vertex $v$ with probability proportional to a…
We compute the eigenvalue fluctuations of uniformly distributed random biregular bipartite graphs with fixed and growing degrees for a large class of analytic functions. As a key step in the proof, we obtain a total variation distance bound…
We investigate random interlacements on Z^d, d bigger or equal to 3. This model recently introduced in arXiv:0704.2560 corresponds to a Poisson cloud on the space of doubly infinite trajectories modulo time-shift tending to infinity at…
The percolated random geometric graph $G_n(\lambda, p)$ has vertex set given by a Poisson Point Process in the square $[0,\sqrt{n}]^2$, and every pair of vertices at distance at most 1 independently forms an edge with probability $p$. For a…
We provide sufficient conditions for a regular graph $G$ of growing degree $d$, guaranteeing a phase transition in its random subgraph $G_p$ similar to that of $G(n,p)$ when $p\cdot d\approx 1$. These conditions capture several well-studied…
We study fundamental characteristics for the connectivity of multi-hop D2D networks. Devices are randomly distributed on street systems and are able to communicate with each other whenever their separation is smaller than some connectivity…
Consider a discrete locally finite subset $\Gamma$ of $R^d$ 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…
In this paper we systematically study various properties of the distance graph in ${\Bbb F}_q^d$, the $d$-dimensional vector space over the finite field ${\Bbb F}_q$ with $q$ elements. In the process we compute the diameter of distance…
Consider a graph $G$ and an initial random configuration, where each node is black with probability $p$ and white otherwise, independently. In discrete-time rounds, each node becomes black if it has at least $r$ black neighbors and white…
By assigning a probability measure via the spectrum of the normalized Laplacian to each graph and using L^p Wasserstein distances between probability measures, we define the corresponding spectral distances d_p on the set of all graphs.…
We introduce a novel percolation model that generalizes the classical Random Connection Model (RCM) to a random simplicial complex, allowing for a more refined understanding of connectivity and emergence of large-scale structures in random…
We consider undirected graphs that arise as deterministic functions of stationary point processes such that each point has degree bounded by two. For a large class of point processes and edge-drawing rules, we show that the arising graph…
The `random intersection graph with communities' models networks with communities, assuming an underlying bipartite structure of groups and individuals. Each group has its own internal structure described by a (small) graph, while groups…