English
Related papers

Related papers: Maximum of the characteristic polynomial of random…

200 papers

A recent conjecture of Caputo, Carlen, Lieb, and Loss, and, independently, of the author, states that the maximum of the permanent of a matrix whose rows are unit vectors in l_p is attained either for the identity matrix I or for a constant…

Combinatorics · Mathematics 2007-05-23 Alex Samorodnitsky

We study the maximal displacement of branching random walks in a class of time inhomogeneous environments. Specifically, binary branching random walks with Gaussian increments will be considered, where the variances of the increments change…

Probability · Mathematics 2011-12-07 Ofer Zeitouni , Ming Fang

Consider directed polymers in a random environment on the complete graph of size $N$. This model can be formulated as a product of i.i.d. $N\times N$ random matrices and its large time asymptotics is captured by Lyapunov exponents and the…

Probability · Mathematics 2018-01-22 Francis Comets , Gregorio R. Moreno Flores , Alejandro F. Ramirez

We study the maximum norm behavior of $L^2$-normalized random Fourier cosine series with a prescribed large wave number. Precise bounds of this type are an important technical tool in estimates for spinodal decomposition, the celebrated…

Probability · Mathematics 2020-05-29 Dirk Blömker , Philipp Wacker , Thomas Wanner

Conditional on the extended Riemann hypothesis, we show that with high probability, the characteristic polynomial of a random symmetric $\{\pm 1\}$-matrix is irreducible. This addresses a question raised by Eberhard in recent work. The main…

Probability · Mathematics 2021-06-09 Asaf Ferber , Vishesh Jain , Ashwin Sah , Mehtaab Sawhney

We argue that proven exponential upper bounds on runtimes, an established area in classic algorithms, are interesting also in heuristic search and we prove several such results. We show that any of the algorithms randomized local search,…

Neural and Evolutionary Computing · Computer Science 2021-10-12 Benjamin Doerr

If the edges of the complete graph $K_n$ are totally ordered, a simple path whose edges are in ascending order is called increasing. The worst-case length of the longest increasing path has remained an open problem for several decades, with…

Combinatorics · Mathematics 2014-03-06 Mikhail Lavrov , Po-Shen Loh

We provide an elementary proof for a theorem due to Petz and R\'effy which states that for a random $n\times n$ unitary matrix with distribution given by the Haar measure on the unitary group U(n), the upper left (or any other) $k\times k$…

Probability · Mathematics 2007-12-04 Christian Mastrodonato , Roderich Tumulka

We determine the leading order of the maximum of the random potential associated to a two-dimensional Coulomb gas for general $\beta$ and general confinement potential, extending the recent result of Lambert-Lebl\'e-Zeitouni. In the case…

Probability · Mathematics 2024-03-04 Luke Peilen

Let $M$ be a random matrix chosen according to Haar measure from the unitary group $\mathrm{U}(n,\mathbb{C})$. Diaconis and Shahshahani proved that the traces of $M,M^2,\ldots,M^k$ converge in distribution to independent normal variables as…

Group Theory · Mathematics 2024-10-15 Ofir Gorodetsky , Brad Rodgers

We investigate the maximal size of an increasing subset among points randomly sampled from certain probability densities. Kerov and Vershik's celebrated result states that the largest increasing subset among $N$ uniformly random points on…

Probability · Mathematics 2024-12-19 Victor Dubach

The Mahler measure of a polynomial is a measure of complexity formed by taking the modulus of the leading coefficient times the modulus of the product of its roots outside the unit circle. The roots of a real degree $N$ polynomial chosen…

Mathematical Physics · Physics 2015-07-01 Christopher D. Sinclair , Maxim L. Yattselev

We compute the leading asymptotics as $N\to\infty$ of the maximum of the field $Q_N(q)= \log\det|q- A_N|$, $q\in \mathbb{C}$, for any unitarily invariant Hermitian random matrix $A_N$ associated to a non-critical real-analytic potential.…

Probability · Mathematics 2021-04-13 Gaultier Lambert , Elliot Paquette

We study n by n symmetric random matrices H, possibly discrete, with iid above-diagonal entries. We show that H is singular with probability at most exp(-n^c), and the spectral norm of the inverse of H is O(sqrt{n}). Furthermore, the…

Probability · Mathematics 2014-03-05 Roman Vershynin

Let $M_n$ be the maximum of $n$ zero-mean gaussian variables $X_1,..,X_n$ with covariance matrix of minimum eigenvalue $\lambda$ and maximum eigenvalue $\Lambda$. Then, for $n \ge 70$, $$\Pr\{M_n \ge \lambda \left (2 \log n - 2.5 - \log(2…

Statistics Theory · Mathematics 2013-12-05 J. A. Hartigan

Let $A$ be an $n\times n$ random matrix whose entries are i.i.d. with mean $0$ and variance $1$. We present a deterministic polynomial time algorithm which, with probability at least $1-2\exp(-\Omega(\epsilon n))$ in the choice of $A$,…

Probability · Mathematics 2020-12-02 Vishesh Jain , Ashwin Sah , Mehtaab Sawhney

We consider a Wigner-type ensemble, i.e. large hermitian $N\times N$ random matrices $H=H^*$ with centered independent entries and with a general matrix of variances $S_{xy}=\mathbb E|H_{xy}|^2$. The norm of $H$ is asymptotically given by…

Probability · Mathematics 2018-02-15 László Erdős , Peter Mühlbacher

This paper deals with symmetric random matrices whose upper diagonal entries are obtained from a linear random field with heavy tailed noise. It is shown that the maximum eigenvalue and the spectral radius of such a random matrix with…

Probability · Mathematics 2014-06-12 Arijit Chakrabarty , Rajat Subhra Hazra , Parthanil Roy

Let $U^N = (U_1^N,\dots, U^N_p)$ be a d-tuple of $N\times N$ independent Haar unitary matrices and $Z^{NM}$ be any family of deterministic matrices in $\mathbb{M}_N(\mathbb{C})\otimes \mathbb{M}_M(\mathbb{C})$. Let $P$ be a self-adjoint…

Probability · Mathematics 2021-10-01 Félix Parraud

Denoting by $P_N(A,\theta)=\det(I-Ae^{-i\theta})$ the characteristic polynomial on the unit circle in the complex plane of an $N\times N$ random unitary matrix $A$, we calculate the $k$th moment, defined with respect to an average over…

Mathematical Physics · Physics 2019-07-24 E. C. Bailey , J. P. Keating