English
Related papers

Related papers: Gaussian approximation for rooted edges in a rando…

200 papers

Fix $\alpha>0$, then by Fej\'er's theorem $ (\alpha(\log n)^{A}\,\mathrm{mod}\,1)_{n\geq1}$ is uniformly distributed if and only if $A>1$. We sharpen this by showing that all correlation functions, and hence the gap distribution, are…

Number Theory · Mathematics 2025-03-26 Christopher Lutsko , Niclas Technau

We establish the first quantitative Berry-Esseen bounds for edge eigenvector statistics in random regular graphs. For any $d$-regular graph on $N$ vertices with fixed $d \geq 3$ and deterministic unit vector $\mathbf{q} \perp \mathbf{e}$,…

Probability · Mathematics 2025-07-18 Leonhard Nagel

We prove a $pre$-$asymptotic$ bound on the total variation distance between the uniform distribution over two types of undirected graphs with $n$ nodes. One distribution places a prescribed number of $k_T$ triangles and $k_S$ edges not…

Probability · Mathematics 2015-09-30 Stephen DeSalvo , M. Puck Rombach

Erd\H{o}s and Palka initiated the study of the maximal size of induced trees in random graphs in 1983. They proved that for every fixed $0<p<1$ the size of a largest induced tree in $G_{n,p}$ is concentrated around $2\log_q (np)$ with high…

Combinatorics · Mathematics 2020-04-07 Nemanja Draganić

We consider a family of centered Gaussian fields on the d-dimensional unit box, whose covariance decreases logarithmically in the distance between points. We prove tightness of the recentered maximum of the Gaussian fields and provide…

Probability · Mathematics 2013-11-11 Javier Acosta

Let $d\geq 3$ be fixed and $G$ be a large random $d$-regular graph on $n$ vertices. We show that if $n$ is large enough then the entry distribution of every almost eigenvector $v$ of $G$ (with entry sum 0 and normalized to have length…

Probability · Mathematics 2016-07-19 Agnes Backhausz , Balazs Szegedy

In this article, we fill a gap in the literature regarding quantitative functional central limit theorems (qfCLT) for Hawkes processes by providing an upper bound for the convergence of a nearly unstable Hawkes process toward a…

Probability · Mathematics 2025-06-16 Laure Coutin , Benjamin Massat , Anthony Réveillac

We continue the study of the maximum of the scale-inhomogeneous discrete Gaussian free field in dimension two. In this paper, we consider the regime of weak correlations and prove the convergence in law of the centred maximum to a randomly…

Probability · Mathematics 2020-10-05 Maximilian Fels , Lisa Hartung

The point process of vertices of an iteration infinitely divisible or more specifically of an iteration stable random tessellation in the Euclidean plane is considered. We explicitly determine its covariance measure and its pair-correlation…

Probability · Mathematics 2011-04-05 Tomasz Schreiber , Christoph Thaele

We consider the discrete Gaussian Free Field in a square box in $\mathbb Z^2$ of side length $N$ with zero boundary conditions and study the joint law of its properly-centered extreme values ($h$) and their scaled spatial positions ($x$) in…

Probability · Mathematics 2016-06-24 Marek Biskup , Oren Louidor

Local convergence of bounded degree graphs was introduced by Benjamini and Schramm. This result was extended further by Lyons to bounded average degree graphs. In this paper we study the convergence of random tree sequences with given…

Probability · Mathematics 2014-08-07 Attila Deák

We provide a general result for bounding the difference between point probabilities of integer supported distributions and the translated Poisson distribution, a convenient alternative to the discretized normal. We illustrate our theorem in…

Probability · Mathematics 2017-12-05 A. D. Barbour , Adrian Röllin , Nathan Ross

In this article, we give explicit bounds on the Wasserstein and the Kolmogorov distances between random variables lying in the first chaos of the Poisson space and the standard Normal distribution, using the results proved by Last, Peccati…

Probability · Mathematics 2026-01-14 Mahmoud Khabou , Giovanni Luca Torrisi

When modeling a directed social network, one choice is to use the traditional preferential attachment model, which generates power-law tail distributions. In a traditional directed preferential attachment, every new edge is added…

Probability · Mathematics 2020-08-18 Tiandong Wang , Sidney I. Resnick

Let $[\mathcal{P}]$ be the points of a Poisson process on $\mathbb{R}^d$ and $F$ a probability distribution with support on the non-negative integers. Models are formulated for generating translation invariant random graphs with vertex set…

Probability · Mathematics 2015-09-24 Maria Deijfen

We consider Gaussian Laplace eigenfunctions on the two-dimensional flat torus (arithmetic random waves), and provide explicit Berry-Esseen bounds in the 1-Wasserstein distance for the normal and non-normal high-energy approximation of the…

Probability · Mathematics 2017-02-14 Giovanni Peccati , Maurizia Rossi

In this paper, we study robust estimators of the memory parameter d of a (possibly) non stationary Gaussian time series with generalized spectral density f. This generalized spectral density is characterized by the memory parameter d and by…

Statistics Theory · Mathematics 2010-11-24 Olaf Kouamo , Céline Lévy-Leduc , Eric Moulines

For each $\alpha \in (0, 1)$, we construct a bounded monotone deterministic sequence $(c_k)_{k \geq 0}$ of real numbers so that the number of real roots of the random polynomial $f_n(z) = \sum_{k=0}^n c_k \varepsilon_k z^k$ is $n^{\alpha +…

Probability · Mathematics 2024-04-08 Marcus Michelen , Sean O'Rourke

In this paper, we study the online nearest neighbor random tree in dimension $d\in \mathbb N$ (called $d$-NN tree for short) defined as follows. We fix the torus $\mathbb T^d_n$ of dimension $d$ and area $n$ and equip it with the metric…

Probability · Mathematics 2023-08-28 Lyuben Lichev , Dieter Mitsche

Given a Galton-Watson process conditioned to have total progeny equal to $n$, we study the asymptotic probability that this conditioned Galton-Watson process has distance to the border bigger or equal than $k$, as the number of nodes $n…

Probability · Mathematics 2025-03-05 Víctor J. Maciá