Related papers: On breadth-first constructions of scaling limits o…
We construct graphs (trees of bounded degree) on which the contact process has critical rate (which will be the same for both global and local survival) equal to any prescribed value between zero and $\lambda_c(\mathbb{Z})$, the critical…
We prove a scaling limit theorem for the simple random walk on critical lattice trees in $\mathbb{Z}^d$, for $d\geq 8$. The scaling limit is the Brownian motion on the Integrated Super-Brownian Excursion (BISE) which is the same one that we…
We study a spatial network model with exponentially distributed link-lengths on an underlying grid of points, undergoing a structural crossover from a random, Erd\H{o}s--R\'enyi graph to a $2D$ lattice at the characteristic interaction…
In this paper we derive results concerning the connected components and the diameter of random graphs with an arbitrary i.i.d. degree sequence. We study these properties primarily, but not exclusively, when the tail of the degree…
We consider random graphs on the set of $N^2$ vertices placed on the discrete $2$-dimensional torus. The edges between pairs of vertices are independent, and their probabilities decay with the distance $\rho$ between these vertices as…
We consider a uniform spanning tree in a $\delta$-square grid approximation of a planar domain $\Omega$. For given integer $n\ge 2$, we condition the tree on the following $n$-arm event: we pick $n$ branches, emanating from $n$ points…
We prove non-universality results for first-passage percolation on the configuration model with i.i.d. degrees having infinite variance. We focus on the weight of the optimal path between two uniform vertices. Depending on the properties of…
We study the systole of a random surface, where by a random surface we mean a surface constructed by randomly gluing together an even number of triangles. We study two types of metrics on these surfaces, the first one coming from using…
Connections between continuous and discrete worlds tend to be elusive. One example is curvature. Even though there exist numerous nonequivalent definitions of graph curvature, none is known to converge in any limit to any traditional…
We study topological properties of random closed curves on an orientable surface $S$ of negative Euler characteristic. Letting $\gamma_{n}$ denote the conjugacy class of the $n^{th}$ step of a simple random walk on the Cayley graph driven…
Consider d uniformly random permutation matrices on n labels. Consider the sum of these matrices along with their transposes. The total can be interpreted as the adjacency matrix of a random regular graph of degree 2d on n vertices. We…
Around 2008, Schramm conjectured that the critical probabilities for Bernoulli bond percolation satisfy the following continuity property: If $(G_n)_{n\geq 1}$ is a sequence of transitive graphs converging locally to a transitive graph $G$…
We study Turing bifurcations on one-dimensional random ring networks where the probability of a connection between two nodes depends on the distance between the two nodes. Our approach uses the theory of graphons to approximate the graph…
We introduce and study the random non-compact metric space called the Brownian plane, which is obtained as the scaling limit of the uniform infinite planar quadrangulation. Alternatively, the Brownian plane is identified as the…
We consider random quantum circuits (RQC) on arbitrary connected graphs whose edges determine the allowed $2$-qudit interactions. Prior work has established that such $n$-qudit circuits with local dimension $q$ on 1D, complete, and…
We show that a uniform quadrangulation, its largest 2-connected block, and its largest simple block jointly converge to the same Brownian map in distribution for the Gromov-Hausdorff-Prokhorov topology. We start by deriving a local limit…
We find precise asymptotic estimates for the number of planar maps and graphs with a condition on the minimum degree, and properties of random graphs from these classes. In particular we show that the size of the largest tree attached to…
In this paper, we provide a framework of estimates for describing 2D scaling limits by Schramm's SLE curves. In particular, we show that a weak estimate on the probability of an annulus crossing implies that a random curve arising from a…
We study a general procedure that builds random $\mathbb R$-trees by gluing recursively a new branch on a uniform point of the pre-existing tree. The aim of this paper is to see how the asymptotic behavior of the sequence of lengths of…
We base ourselves on the construction of the two-dimensional random interlacements [12] to define the one-dimensional version of the process. For this constructions we consider simple random walks conditioned on never hitting the origin,…