Related papers: Novel scaling limits for critical inhomogeneous ra…

We analyze the finite size scaling of the $q$-state clock model in the $q \rightarrow \infty$ limit. The behaviors of the specific heat, Binder-Landau and U4 cumulants agree with the Borgs-Koteck\'y ans\"atz for first order phase…

We introduce a renormalized 1PI vertex part scalar field theory setting in momentum space to computing the critical exponents $\nu$ and $\eta$, at least at two-loop order, for a layered parallel plate geometry separated by a distance L,…

The 2-dimensional Hamming graph H(2,n) consists of the $n^2$ vertices $(i,j)$, $1\leq i,j\leq n$, two vertices being adjacent when they share a common coordinate. We examine random subgraphs of H(2,n) in percolation with edge probability…

We prove scaling limit results for the finite-volume version of the inventory accumulation model of Sheffield (2011), which encodes a random planar map decorated by a collection of loops sampled from the critical Fortuin-Kasteleyn (FK)…

We study the structure of a uniformly randomly chosen partial order of width 2 on n elements. We show that under the appropriate scaling, the number of incomparable elements converges to the height of a one dimensional Brownian excursion at…

We establish some scaling limits for a model of planar aggregation. The model is described by the composition of a sequence of independent and identically distributed random conformal maps, each corresponding to the addition of one…

An analytic perturbation theory is suggested in order to find finite-size corrections to the scaling power laws. In the frame of this theory it is shown that the first order finite-size correction to the scaling power laws has following…

We study analytically and numerically the corrections to scaling in turbulence which arise due to the finite ratio of the outer scale $L$ of turbulence to the viscous scale $\eta$, i.e., they are due to finite size effects as anisotropic…

We show that for all $d\in \{3,\ldots,n-1\}$ the size of the largest component of a random $d$-regular graph on $n$ vertices around the percolation threshold $p=1/(d-1)$ is $\Theta(n^{2/3})$, with high probability. This extends known…

In this paper we introduce a network model which evolves in time, and study its largest connected component. We consider a process of graphs $(G_t:t\in [0,1])$, where initially we start with a critical Erd\H{o}s-R\'enyi graph ER(n, 1/n),…

We consider the Gaussian free field $\varphi$ on $\mathbb{Z}^2$ at large spatial scales $N$ and give sharp bounds on the probability $\theta(a,N)$ that the radius of a finite cluster in the excursion set $\{\varphi \geq a\}$ on the…

The largest connected component in duplication-divergence growing graphs with symmetric coupled divergence is studied. Finite-size scaling reveals a phase transition occurring at a divergence rate $\delta_c$. The $\delta_c$ found stands…

We study nonconcentration of hitting times for simple random walk on finite graphs. We prove that, for every connected graph with $n$ vertices, \[ \operatorname{Var}_x(\tau_y)+\mathbb E_x\tau_y \ge \frac{(\mathbb E_x\tau_y)^2}{1+\log n}, \]…

It has been recently discovered that some random processes may satisfy limit theorems even though they exhibit intermittency, namely an unusual growth of moments. In this paper we provide a deeper understanding of these intricate limiting…

Let $\mathcal{C}_1$ be the largest component of the Erd\H{o}s--R\'{e}nyi random graph $\mathcal{G}(n,p)$. The mixing time of random walk on $\mathcal {C}_1$ in the strictly supercritical regime, $p=c/n$ with fixed $c>1$, was shown to have…

In this paper, we consider the random plane forest uniformly drawn from all possible plane forests with a given degree sequence. Under suitable conditions on the degree sequences, we consider the limit of a sequence of such forests with the…

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…

We show that the Brownian continuum random tree is the Gromov-Hausdorff-Prohorov scaling limit of the uniform spanning tree on high-dimensional graphs including the $d$-dimensional torus $\mathbb{Z}_n^d$ with $d>4$, the hypercube…

We study the random simple connected cubic planar graph $\mathsf{C}_n$ with an even number $n$ of vertices. We show that the Brownian map arises as Gromov--Hausdorff--Prokhorov scaling limit of $\mathsf{C}_n$ as $n \in 2 \ndN$ tends to…

We consider the near-critical Erd\H{o}s-R\'{e}nyi random graph $G(n,p)$ and provide a new probabilistic proof of the fact that, when $p$ is of the form $p=p(n)=1/n+\lambda/n^{4/3}$ and $A$ is large,…