English
Related papers

Related papers: Scaling limits of random planar maps with large fa…

200 papers

The escape rate of a stochastic dynamical system can be found as an expansion in powers of the noise strength. In previous work the coefficients of such an expansion for a one-dimensional map were fitted to a general form containing a few…

Chaotic Dynamics · Physics 2015-05-13 C. P. Dettmann , T. B. Howard

We derive theorems which outline explicit mechanisms by which anomalous scaling for the probability density function of the sum of many correlated random variables asymptotically prevails. The results characterize general anomalous scaling…

Statistical Mechanics · Physics 2015-05-14 Attilio L. Stella , Fulvio Baldovin

We consider extended slow-fast systems of N interacting diffusions. The typical behavior of the empirical density is described by a nonlinear McKean-Vlasov equation depending on , the scaling parameter separating the time scale of the slow…

Analysis of PDEs · Mathematics 2021-08-09 Julien Barré , Cedric Bernardin , Raphaël Chétrite , Yash Chopra , Mauro Mariani

In several scale free graph models the asymptotic degree distribution and the characteristic exponent change when only a smaller set of vertices is considered. Looking at the common properties of these models, we present sufficient…

Probability · Mathematics 2010-07-27 Agnes Backhausz , Tamas F. Mori

We prove limit theorems for random walks with $n$ steps in the $d$-dimensional Euclidean space as both $n$ and $d$ tend to infinity. One of our results states that the path of such a random walk, viewed as a compact subset of the…

Probability · Mathematics 2023-05-23 Zakhar Kabluchko , Alexander Marynych

Let P_{n,m} denote the graph taken uniformly at random from the set of all planar graphs on {1,2,..., n} with exactly m(n) edges. We use counting arguments to investigate the probability that P_{n,m} will contain given components and…

Combinatorics · Mathematics 2011-01-27 Chris Dowden

This paper studies the asymptotic behavior of several central objects in Dunkl theory as the dimension of the underlying space grows large. Our starting point is the observation that a recent result from the random matrix theory literature…

Probability · Mathematics 2023-05-24 Jiaoyang Huang , Colin McSwiggen

We introduce a systematic approach to express generating functions for the enumeration of maps on surfaces of high genus in terms of a single generating function relevant to planar surfaces. Central to this work is the comparison of two…

Mathematical Physics · Physics 2023-02-07 Nicholas Ercolani , Joceline Lega , Brandon Tippings

Given a sequence of complex square matrices, $a_n$, consider the sequence of their partial products, defined by $p_n=p_{n-1}a_{n}$. What can be said about the asymptotics as $n\to\infty$ of the sequence $f(p_n)$, where $f$ is a continuous…

Complex Variables · Mathematics 2009-01-12 Douglas Bowman , James Mc Laughlin

We consider high-dimensional estimation problems where the number of parameters diverges with the sample size. General conditions are established for consistency, uniqueness, and asymptotic normality in both unpenalized and penalized…

Statistics Theory · Mathematics 2025-04-08 Jana Gauss , Thomas Nagler

We construct a point set in the Euclidean plane that elucidates the relationship between the fine-scale statistics of the fractional parts of $\sqrt n$ and directional statistics for a shifted lattice. We show that the randomly rotated, and…

Number Theory · Mathematics 2024-12-17 Jens Marklof

We consider the fragmentation at nodes of the L\'{e}vy continuous random tree introduced in a previous paper. In this framework we compute the asymptotic for the number of small fragments at time $\theta$. This limit is increasing in…

Probability · Mathematics 2007-05-23 Romain Abraham , Jean-François Delmas

Consider the geometric graph on $n$ independent uniform random points in a connected compact region $A$ of ${\bf R}^d, d \geq 2$, with $C^2$ boundary, or in the unit square, with distance parameter $r_n$. Let $K_n$ be the number of…

Probability · Mathematics 2026-04-09 Mathew D. Penrose , Xiaochuan Yang

This paper is devoted to the analysis of the finite-dimensional distributions and asymptotic behavior of extremal Markov processes connected to the Kendall convolution. In particular, based on its stochastic representation, we provide…

Probability · Mathematics 2019-10-10 Marek Arendarczyk , Barbara Jasiulis-Gołdyn , Edward Omey

In this paper, we study the asymptotic behavior of the number of rarely visited edges (i.e., edges that visited only once) of a simple symmetric random walk on $\mathbb{Z}$. Let $\alpha(n)$ be the number of rarely visited edges up to time…

Probability · Mathematics 2026-01-21 Ze-Chun Hu , Xue Peng , Renming Song , Yuan Tan

Consider a queueing system fed by traffic from $N$ independent and identically distributed marked point processes. We establish several novel sample path large deviations results in the scaled uniform topology for such a system with a small…

Probability · Mathematics 2019-12-11 James R. Cruise , Fraser Daly , Bemsibom Toh

In previous papers by A. Kameyama and by J. Kigami distances on fractals have been discussed having two different but similar properties. One property is that the maps defining the fractal are Lipschitz of prescribed constants less than 1,…

Metric Geometry · Mathematics 2017-10-18 Roberto Peirone

A connection is made between the random turns model of vicious walkers and random permutations indexed by their increasing subsequences. Consequently the scaled distribution of the maximum displacements in a particular asymmeteric version…

Combinatorics · Mathematics 2007-05-23 P. J. Forrester

The local eigenvalue statistics of large random matrices near a hard edge transitioning into a soft edge are described by the Bessel process associated with a large parameter $\alpha$. For this point process, we obtain 1) exponential moment…

Probability · Mathematics 2021-04-26 Christophe Charlier , Jonatan Lenells

We establish a new asymptotic formula for the number of polynomials of degree $n$ with $k$ prime factors over a finite field $\mathbb{F}_q$. The error term tends to $0$ uniformly in $n$ and in $q$, and $k$ can grow beyond $\log n$.…

Number Theory · Mathematics 2023-05-04 Dor Elboim , Ofir Gorodetsky