English
Related papers

Related papers: Maximum of the characteristic polynomial for a ran…

200 papers

We argue that the freezing transition scenario, previously explored in the statistical mechanics of 1/f-noise random energy models, also determines the value distribution of the maximum of the modulus of the characteristic polynomials of…

Mathematical Physics · Physics 2013-05-30 Yan V. Fyodorov , Ghaith A Hiary , Jonathan P. Keating

Let $U_N$ denote a Haar Unitary matrix of dimension N, and consider the field \[ {\bf U}(z) = \log |\det(1-zU_N)| \] for z in the unit disk. Then, \[ \frac{\max_{|z|=1} {\bf U}(z) -\log N + \frac{3}{4} \log\log N} {\log\log N} \to 0 \] in…

Probability · Mathematics 2019-07-11 Elliot Paquette , Ofer Zeitouni

We study the characteristic polynomial of Haar distributed random unitary matrices. We show that after a suitable normalization, as one increases the size of the matrix, powers of the absolute value of the characteristic polynomial as well…

Probability · Mathematics 2015-10-05 Christian Webb

Consider a square random matrix with independent and identically distributed entries of mean zero and unit variance. We show that as the dimension tends to infinity, the spectral radius is equivalent to the square root of the dimension in…

Probability · Mathematics 2022-04-20 Charles Bordenave , Djalil Chafaï , David García-Zelada

In this paper, using techniques developed in our earlier works on the theory of mod-Gaussian convergence, we prove precise moderate and large deviation results for the logarithm of the characteristic polynomial of a random unitary matrix.…

Probability · Mathematics 2022-02-18 Pierre-Loïc Méliot , Ashkan Nikeghbali

An exchangeable random matrix is a random matrix with distribution invariant under any permutation of the entries. For such random matrices, we show, as the dimension tends to infinity, that the empirical spectral distribution tends to the…

Probability · Mathematics 2016-03-25 Radosław Adamczak , Djalil Chafaï , Paweł Wolff

We give the distribution of $M_n$, the maximum of a sequence of $n$ observations from a moving average of order 1. Solutions are first given in terms of repeated integrals and then for the case where the underlying independent random…

Methodology · Statistics 2009-04-06 Christopher S. Withers , Saralees Nadarajah

The maximum drop size of a permutation $\pi$ of $[n]=\{1,2,\ldots, n\}$ is defined to be the maximum value of $i-\pi(i)$. Chung, Claesson, Dukes and Graham obtained polynomials $P_k(x)$ that can be used to determine the number of…

Combinatorics · Mathematics 2013-06-25 Joanna N. Chen , William Y. C. Chen

We study the maximum of the random assignment process on rectangular matrices. We derive first-order asymptotics for the expected maximum, prove a law of large numbers under mild tail assumptions, and obtain exponential upper bounds for the…

Probability · Mathematics 2025-09-23 Timofey Moskalenko

In this short note, we study the derivatives of all orders for the random field $$ X_T(h) = \sum_{p \leq T} \frac{\text{Re}(U_p \, p^{-i h})}{p^{1/2}}, \quad h\in [0,1], $$ where $(U_p, \, p ~\text{primes})$ is an i.i.d. sequence of uniform…

Probability · Mathematics 2019-11-07 Louis-Pierre Arguin , Frédéric Ouimet , Christian Webb

This work examines various statistical distributions in connection with random Vandermonde matrices and their extension to $d$--dimensional phase distributions. Upper and lower bound asymptotics for the maximum singular value are found to…

Probability · Mathematics 2012-11-19 Gabriel H. Tucci , Philip A. Whiting

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

This article presents some interesting and novel results concerning the average modulus of random polynomials on the unit circle and the unit disc, with coefficients distributed as standard normal variates. The paper also introduces new…

Complex Variables · Mathematics 2026-05-19 Sajad A. Sheikh , Mohd. Ibrahim Mir

Let $U\in U(N)$ be a random unitary matrix of size $N$, distributed with respect to the Haar measure on $U(N)$. Let $P(z)=P_U(z)$ be the characteristic polynomial of $U$. We prove that for $z$ close to the unit circle, $ \frac{P'}{P}(z) $…

Number Theory · Mathematics 2024-10-29 Fan Ge

Let $M_n$ denote a random symmetric $n \times n$ matrix whose upper diagonal entries are independent and identically distributed Bernoulli random variables (which take values $1$ and $-1$ with probability $1/2$ each). It is widely…

Probability · Mathematics 2019-09-10 Asaf Ferber , Vishesh Jain

We extend Friedman's theorem to show that, for any fixed $r>1$, a random $2r$--regular Schreier graph associated with the action of $r$ uniformly random permutations of $[n]$ on $k_{n}$--tuples of distinct elements in $[n]$ has a…

Representation Theory · Mathematics 2025-10-27 Ewan Cassidy

We show that the average characteristic polynomial P_n(z) = E [\det(zI-M)] of the random Hermitian matrix ensemble Z_n^{-1} \exp(-Tr(V(M)-AM))dM is characterized by multiple orthogonality conditions that depend on the eigenvalues of the…

Mathematical Physics · Physics 2011-03-28 P. M. Bleher , A. B. J. Kuijlaars

Let $ \nu $ be a probability distribution over the linear semi-group $ \mathrm{End}(E) $ for $ E $ a finite dimensional vector space over a locally compact field. We assume that $ \nu $ is proximal, strongly irreducible and that $…

Probability · Mathematics 2025-02-14 Axel Péneau

We consider the set $\mathcal{M}_n(\mathbb{Z}; H)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain upper and lower bounds on the number of distinct irreducible characteristic polynomials which correspond to…

Number Theory · Mathematics 2025-02-18 László Mérai , Igor E. Shparlinski

Let $ X_1, \ldots, X_n $ be independent random variables taking values in the alphabet $ \{0, 1, \ldots, r\} $, and $ S_n = \sum_{i = 1}^n X_i $. The Shepp--Olkin theorem states that, in the binary case ($ r = 1 $), the Shannon entropy of $…

Information Theory · Computer Science 2022-05-10 Mladen Kovačević