Related papers: Random cubic planar graphs converge to the Brownia…
Consider the minimum spanning tree (MST) of the complete graph with n vertices, when edges are assigned independent random weights. Endow this tree with the graph distance renormalized by n^{1/3} and with the uniform measure on its…
We prove that minimal graphs (other than planes) are parabolic in the sense that any bounded harmonic function is determined by its boundary values. The proof relies on using the coupling introduced in the author's earlier paper "A…
We develop a general universality technique for establishing metric scaling limits of critical random discrete structures exhibiting mean-field behavior that requires four ingredients: (i) from the barely subcritical regime to the critical…
In his PhD Thesis, E.R. Scheinerman conjectured that planar graphs are intersection graphs of line segments in the plane. This conjecture was proved with two different approaches by J. Chalopin and the author, and by the author, L.…
We introduce a system of coalescing random paths with radialbehavior in a subsetof the plane. We call it theDiscrete Radial Poissonian Web. We show that underdiffusive scaling this family converges in distribution toa mapping of a…
Finite connected cubic symmetric graphs of girth 6 have been classified by K. Kutnar and D. Maru\v{s}i\v{c}, in particular, each of these graphs has an abelian automorphism group with two orbits on the vertex set. In this paper all cubic…
We prove that a uniform rooted plane map with n edges converges in distribution after a suitable normalization to the Brownian map for the Gromov-Hausdorff topology. A recent bijection due to Ambj{\o}rn and Budd allows to derive this result…
Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not incident with the outer face) have degrees larger than three. The planar…
How much cutting is needed to simplify the topology of a surface? We provide bounds for several instances of this question, for the minimum length of topologically non-trivial closed curves, pants decompositions, and cut graphs with a given…
For the directed landscape, the putative universal space-time scaling limit object in the (1+1) dimensional Kardar-Parisi-Zhang (KPZ) universality class, consider the geodesic tree -- the tree formed by the coalescing semi-infinite…
This work addresses a modification of the random geometric graph (RGG) model by considering a set of points uniformly and independently distributed on the surface of a $(d-1)$-sphere with radius $r$ in a $d-$dimensional Euclidean space,…
In this paper we present a new and flexible method to show that, in one dimension, various self-repellent random walks converge to self-repellent Brownian motion in the limit of weak interaction after appropriate space-time scaling. Our…
We study the chromatic number of typical triangle-free graphs with $\Theta \left( n^{3/2} (\log n)^{1/2} \right)$ edges and establish the width of the scaling window for the transitions from $\chi = 3$ to $\chi = 4$ and from $\chi = 4$ to…
We are interested in the asymptotics of random trees built by linear preferential attachment, also known in the literature as Barab\'asi-Albert trees or plane-oriented recursive trees. We first prove a conjecture of Bubeck, Mossel \& R\'acz…
We study random subgraphs of an arbitrary finite connected transitive graph $\mathbb G$ obtained by independently deleting edges with probability $1-p$. Let $V$ be the number of vertices in $\mathbb G$, and let $\Omega$ be their degree. We…
We prove a scaling limit result for random walk on certain random planar maps with its natural time parametrization. In particular, we show that for $\gamma \in (0,2)$, the random walk on the mated-CRT map with parameter $\gamma$ converges…
Let $\mathbb{S}_g$ be the orientable surface of genus $g$. We show that the number of vertex-labelled cubic multigraphs embeddable on $\mathbb{S}_g$ with $2n$ vertices is asymptotically $c_g n^{5(g-1)/2-1}\gamma^{2n}(2n)!$, where $\gamma$…
In this paper we construct an object which we call the full Brownian web (FBW) and prove that the collection of all space-time trajectories of a class of one-dimensional stochastic flows converges weakly, under diffusive rescaling, to the…
In this paper, we establish a quenched invariance principle for the random walk on a certain class of infinite, aperiodic, oriented random planar graphs called "T-graphs" [Kenyon-Sheffield04]. These graphs appear, together with the…
The conformal dimension of a metric space $(X, d)$ is equal to the infimum of the Hausdorff dimensions among all metric spaces quasisymmetric to $(X, d)$. It is an important quasisymmetric invariant which lies non-strictly between the…