English
Related papers

Related papers: Invariance principles for random bipartite planar …

200 papers

We introduce and study a new random surface which we call the hyperbolic Brownian plane and which is the near-critical scaling limit of the hyperbolic triangulations constructed in arXiv:1401.3297. The law of the hyperbolic Brownian plane…

Probability · Mathematics 2018-06-28 Thomas Budzinski

We propose a simple geometrical construction of topological invariants of 3-strand Brownian braids viewed as world lines of 3 particles performing independent Brownian motions in the complex plane z. Our construction is based on the…

High Energy Physics - Theory · Physics 2009-11-10 Sergei Nechaev , Raphael Voituriez

We study statistical properties of the truncated flat spot map $f_t(x)$. In particular, we investigate whether for large $n$, the deviations $\sum_{i=0}^{n-1} \left(f_t^i(x_0)-\frac 12\right)$ upon rescaling satisfy a $Q$-Gaussian…

Dynamical Systems · Mathematics 2021-07-21 J. J. P. Veerman , P. J. Oberly , L. S. Fox

We study the graph structure of large random dissections of polygons sampled according to Boltzmann weights, which encompasses the case of uniform dissections or uniform $p$-angulations. As their number of vertices $n$ goes to infinity, we…

Probability · Mathematics 2014-02-13 Nicolas Curien , Bénédicte Haas , Igor Kortchemski

We provide a new construction of the Brownian disks, which have been defined by Bettinelli and Miermont as scaling limits of quadrangulations with a boundary when the boundary size tends to infinity. Our method is very similar to the…

Probability · Mathematics 2017-10-23 Jean-François Le Gall

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…

Mathematical Physics · Physics 2025-07-17 Bertrand Duplantier , Emmanuel Guitter

We establish via a probabilistic approach the quenched invariance principle for a class of long range random walks in independent (but not necessarily identically distributed) balanced random environments, with the transition probability…

Probability · Mathematics 2020-10-27 Xin Chen , Zhen-Qing Chen , Takashi Kumagai , Jian Wang

We study the simple random walk on the Uniform Infinite Half-Plane Map, which is the local limit of critical Boltzmann planar maps with a large and simple boundary. We prove that the simple random walk is recurrent, and that the resistance…

Probability · Mathematics 2019-12-19 Thomas Budzinski , Thomas Lehéricy

We obtain an elementary invariance principle for multi-dimensional Brownian sheet where the underlying random fields are not necessarily independent or stationary. Possible applications include unit-root tests for spatial as well as panel…

Probability · Mathematics 2019-10-08 Michael C. Tseng

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…

Probability · Mathematics 2022-03-15 Benedikt Stufler

We consider a random walk on Z^d in an i.i.d. balanced random environment, that is a random walk for which the probability to jump from x to nearest neighbor x+e is the same as to nearest neighbor x-e. Assuming that the environment is…

Probability · Mathematics 2012-07-05 Noam Berger , Jean-Dominique Deuschel

We give alternate constructions of (i) the scaling limit of the uniform connected graphs with given fixed surplus, and (ii) the continuum random unicellular map (CRUM) of a given genus that start with a suitably tilted Brownian continuum…

Probability · Mathematics 2021-11-17 Grégory Miermont , Sanchayan Sen

We discuss duality properties of critical Boltzmann planar maps such that the degree of a typical face is in the domain of attraction of a stable distribution with parameter $\alpha\in(1,2]$. We consider the critical Bernoulli bond…

Probability · Mathematics 2018-02-07 Nicolas Curien , Loïc Richier

We prove a quenched almost sure invariance principle for certain classes of random distance expanding dynamical systems which do not necessarily exhibit uniform decay of correlations.

Dynamical Systems · Mathematics 2020-09-14 Davor Dragicevic , Yeor Hafouta

We consider random geometric graphs on the plane characterized by a non-uniform density of vertices. In particular, we introduce a graph model where $n$ vertices are independently distributed in the unit disc with positions, in polar…

Disordered Systems and Neural Networks · Physics 2022-04-06 C. T. Martinez-Martinez , J. A. Mendez-Bermudez , Francisco A. Rodrigues , Ernesto Estrada

We study the uniform random graph $\mathsf{C}_n$ with $n$ vertices drawn from a subcritical class of connected graphs. Our main result is that the rescaled graph $\mathsf{C}_n / \sqrt{n}$ converges to the Brownian Continuum Random Tree…

Probability · Mathematics 2014-11-17 Konstantinos Panagiotou , Benedikt Stufler , Kerstin Weller

Spectral methods that are based on eigenvectors and eigenvalues of discrete graph Laplacians, such as Diffusion Maps and Laplacian Eigenmaps are often used for manifold learning and non-linear dimensionality reduction. It was previously…

Numerical Analysis · Mathematics 2015-06-02 Amit Singer , Hau-tieng Wu

In this article, we obtain a super-exponential rate of convergence in total variation between the traces of the first $m$ powers of an $n\times n$ random unitary matrices and a $2m$-dimensional Gaussian random variable. This generalizes…

Probability · Mathematics 2020-02-06 Kurt Johansson , Gaultier Lambert

We consider Riemann mappings from bounded Lipschitz domains in the plane to a triangle. We show that in this case the Riemann mapping has a linear variational principle: it is the minimizer of the Dirichlet energy over an appropriate affine…

Computational Geometry · Computer Science 2018-02-13 Nadav Dym , Yaron Lipman , Raz Slutsky

A tanglegram consists of two rooted binary trees and a perfect matching between their leaves, and a planar tanglegram is one that admits a layout with no crossings. We show that the problem of generating planar tanglegrams uniformly at…

Combinatorics · Mathematics 2023-04-13 Alexander E. Black , Kevin Liu , Alex Mcdonough , Garrett Nelson , Michael C. Wigal , Mei Yin , Youngho Yoo