Related papers: A phase transition in block-weighted random maps

We introduce a model of tree-rooted planar maps weighted by their number of $2$-connected blocks. We study its enumerative properties and prove that it undergoes a phase transition. We give the distribution of the size of the largest…

We study random subgraphs of the $n$-cube $\{0,1\}^n$, where nearest-neighbor edges are occupied with probability $p$. Let $p_c(n)$ be the value of $p$ for which the expected cluster size of a fixed vertex attains the value $\lambda…

In [Fleurat, Salvy 2024], we introduced a model of block-weighted random maps that undergoes a phase transition as the density of separating elements changes. The purpose of this note is to demonstrate that the methodology we developed can…

We study non-compact scaling limits of uniform random planar quadrangulations with a boundary when their size tends to infinity. Depending on the asymptotic behavior of the boundary size and the choice of the scaling factor, we observe…

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 consider models of block-weighted random planar maps in which possibly decorated maps are decomposed canonically into blocks, each block receiving the weight $u$. These maps present a transition at some critical value $u=u_{cr}$ above…

We investigate random connected graphs from a block-stable class whose distribution is weighted based on the number of $2$-connected components, or blocks. This includes the class of planar graphs. For this, we develop a notion of a…

We consider the simple random walk on a random d-regular graph with n vertices, and investigate percolative properties of the set of vertices not visited by the walk until time un, where u > 0 is a fixed positive parameter. It was shown in…

We study the scaling limits of looptrees associated with Bienaym\'e--Galton--Watson (BGW) trees, that are obtained by replacing every vertex of the tree by a "cycle" whose size is its degree. First, we consider BGW trees whose offspring…

We prove that uniform random quadrangulations of the sphere with $n$ faces, endowed with the usual graph distance and renormalized by $n^{-1/4}$, converge as $n\to\infty$ in distribution for the Gromov-Hausdorff topology to a limiting…

We study the trajectory of a simple random walk on a d-regular graph with d>2 and locally tree-like structure as the number n of vertices grows. Examples of such graphs include random d-regular graphs and large girth expanders. For these…

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…

Let $M_n$ be a simple triangulation of the sphere $S^2$, drawn uniformly at random from all such triangulations with n vertices. Endow $M_n$ with the uniform probability measure on its vertices. After rescaling graph distance on $V(M_n)$ by…

We explore the phase diagram of the O($n$) loop model on the square lattice in the $(x,n)$ plane, where $x$ is the weight of a lattice edge covered by a loop. These results are based on transfer-matrix calculations and finite-size scaling.…

We study a configuration model on bipartite planar maps in which, given $n$ even integers, one samples a planar map with $n$ faces uniformly at random with these face degrees. We prove that when suitably rescaled, such maps always admit…

In this paper, the scaling limit of random connected cubic planar graphs (respectively multigraphs) is shown to be the Brownian sphere. The proof consists in essentially two main steps. First, thanks to the known decomposition of cubic…

Random planar maps are considered in the physics literature as the discrete counterpart of random surfaces. It is conjectured that properly rescaled random planar maps, when conditioned to have a large number of faces, should converge to a…

We study the position distribution $P(\vec{R},N)$ of a run-and-tumble particle (RTP) in arbitrary dimension $d$, after $N$ runs. We assume that the constant speed $v>0$ of the particle during each running phase is independently drawn from a…

We present a finite-size scaling analysis of the entanglement in a two-dimensional arrays of quantum dots modeled by the Hubbard Hamiltonian on a triangular lattice. Using multistage block renormalization group approach, we have found that…

We discuss the order statistics of the particle positions of a gas of $N$ identical independent particles performing Brownian motion in one dimension in a potential that asymptotically behaves like $V(x) \sim x^\gamma$ for…