English
Related papers

Related papers: Quantitative Tracy-Widom laws for sparse random ma…

200 papers

We prove a central limit theorem for the components of the largest eigenvectors of the adjacency matrix of a finite-dimensional random dot product graph whose true latent positions are unknown. In particular, we follow the methodology…

Statistics Theory · Mathematics 2013-12-24 Avanti Athreya , Vince Lyzinski , David J. Marchette , Carey E. Priebe , Daniel L. Sussman , Minh Tang

We consider the Gaussian ensembles of random matrices and describe the normal modes of the eigenvalue spectrum, i.e., the correlated fluctuations of eigenvalues about their most probable values. The associated normal mode spectrum is…

Nuclear Theory · Physics 2009-10-31 A. Andersen , A. D. Jackson , H. J. Pedersen

This paper establishes a comparison theorem for the maximum eigenvalue of a sum of independent random symmetric matrices. The theorem states that the maximum eigenvalue of the matrix sum is dominated by the maximum eigenvalue of a Gaussian…

Probability · Mathematics 2026-03-17 Joel A. Tropp

In this paper we consider a dynamic version of the Erd\H{o}s-R\'{e}nyi random graph, in which edges independently appear and disappear in time, with the on- and off times being exponentially distributed. The focus lies on the evolution of…

Probability · Mathematics 2024-07-04 Rajat Subhra Hazra , Nikolai Kriukov , Michel Mandjes

We analyze eigenvalues fluctuations of the Laplacian of various networks under the random matrix theory framework. Analyses of random networks, scale-free networks and small-world networks show that nearest neighbor spacing distribution of…

Statistical Mechanics · Physics 2009-11-11 Sarika Jalan , Jayendra N. Bandyopadhyay

The asymptotic behaviour of a generalised P\'olya--Eggenberger urn is well--known to depend on the spectrum of its replacement matrix: If its dominant eigenvalue $r$ is simple and no other eigenvalue is `large' in the sense that its real…

Probability · Mathematics 2019-03-13 Noela Müller

We study the exploration of an Erd\"os-R\'enyi random graph by a respondent-driven sampling method, where discovered vertices reveal their neighbours. Some of them receive coupons to reveal in their turn their own neighbourhood. This leads…

Probability · Mathematics 2021-03-31 Anthony Cousien , Jean-Stéphane Dhersin , Viet Chi Tran , Thi Phuong Thuy Vo

We study the eigenvector mass distribution of an $N\times N$ Wigner matrix on a set of coordinates $I$ satisfying $| I | \ge c N$ for some constant $c >0$. For eigenvectors corresponding to eigenvalues at the spectral edge, we show that the…

Probability · Mathematics 2025-10-14 Lucas Benigni , Nixia Chen , Patrick Lopatto , Xiaoyu Xie

We study the fluctuation behavior of individual eigenvalues of kernel matrices arising from dense graphon-based random graphs. Under minimal integrability and boundedness assumptions on the graphon, we establish distributional limits for…

Probability · Mathematics 2026-03-03 Behzad Aalipur

This paper investigate the sparse multi-type Erd\H{o}s R\'enyi random graphs studied in S\"{o}derberg~\cite{soderberg2002general} and also Bollob\'as et al.~\cite{bollobas2007phase}. Although the corresponding central limit results are…

Probability · Mathematics 2025-12-17 Rui Yu , Wen Sun

Consider the random normal matrix ensemble associated with a potential on the plane which is sufficiently strong near infinity. It is known that, to a first approximation, the eigenvalues obey a certain equilibrium distribution, given by…

Complex Variables · Mathematics 2015-09-23 Yacin Ameur , Haakan Hedenmalm , Nikolai Makarov

We study random walks on Erd\"os-R\'enyi random graphs in which, every time the random walk returns to the starting point, first an edge probability is independently sampled according to a priori measure $\mu$, and then an Erd\"os-R\'enyi…

Probability · Mathematics 2025-02-06 Giulio Iacobelli , Guilherme Ost , Daniel Y. Takahashi

Let $N(L)$ be the number of eigenvalues, in an interval of length $L$, of a matrix chosen at random from the Gaussian Orthogonal, Unitary or Symplectic ensembles of ${\cal N}$ by ${\cal N}$ matrices, in the limit ${\cal…

chao-dyn · Physics 2009-10-22 Ovidiu Costin , Joel L. Lebowitz

We prove that for all values of the edge probability p(n) the largest eigenvalue of a random graph G(n,p) satisfies almost surely: \lambda_1(G)=(1+o(1))max{\sqrt{\Delta},np}, where \Delta is a maximal degree of G, and the o(1) term tends to…

Combinatorics · Mathematics 2007-05-23 Michael Krivelevich , Benny Sudakov

Consider the Erd\H{o}s-Renyi random graph on n vertices where each edge is present independently with probability c/n, with c>0 fixed. For large n, a typical random graph locally behaves like a Galton-Watson tree with Poisson offspring…

Probability · Mathematics 2016-04-08 Charles Bordenave , Pietro Caputo

The second largest eigenvalue of a transition matrix $P$ has connections with many properties of the underlying Markov chain, and especially its convergence rate towards the stationary distribution. In this paper, we give an asymptotic…

Probability · Mathematics 2018-07-27 Simon Coste

We consider the problem of approximating a $d \times d$ covariance matrix $M$ with a rank-$k$ matrix under $(\varepsilon,\delta)$-differential privacy. We present and analyze a complex variant of the Gaussian mechanism and show that the…

Data Structures and Algorithms · Computer Science 2023-06-30 Oren Mangoubi , Nisheeth K. Vishnoi

In this paper, we use the framework of mod-$\phi$ convergence to prove precise large or moderate deviations for quite general sequences of real valued random variables $(X_{n})_{n \in \mathbb{N}}$, which can be lattice or non-lattice…

Probability · Mathematics 2017-02-14 Valentin Féray , Pierre-Loïc Méliot , Ashkan Nikeghbali

This work is concerned with finite range bounds on the variance of individual eigenvalues of Wigner random matrices, in the bulk and at the edge of the spectrum, as well as for some intermediate eigenvalues. Relying on the GUE example,…

Probability · Mathematics 2012-07-06 Sandrine Dallaporta

We consider the random geometric graph on $n$ vertices drawn uniformly from a $d$--dimensional sphere. We focus on the sparse regime, when the expected degree is constant independent of $d$ and $n$. We show that, when $d$ is larger than $n$…

Probability · Mathematics 2021-10-22 Elliot Paquette , Andrew Vander Werf
‹ Prev 1 8 9 10 Next ›