English
Related papers

Related papers: Uniform bounds for exponential moment of maximum o…

200 papers

In this paper, we are interested in the moments of the characteristic polynomial $Z_n(x)$ of the $n\times n$ permutation matrices with respect to the uniform measure. We use a combinatorial argument to write down the generating function of…

Probability · Mathematics 2010-07-14 Dirk Zeindler

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

We consider a Gaussian random matrix with correlated entries that have a power law decay of order $d>2$ and prove universality for the extreme eigenvalues. A local law is proved using the self-consistent equation combined with a…

Probability · Mathematics 2018-01-24 Arka Adhikari , Ziliang Che

For each natural number $n$ we determine, both asymptotically and exactly, the maximum number of edges an induced subgraph of order $n$ of the $d$-dimension a grid graph ${\ints}^d$ can have. The asymptotic bound is obtained by using a…

Combinatorics · Mathematics 2013-02-27 Geir Agnarsson , Kshitij Lauria

We prove that the distribution of eigenvectors of generalized Wigner matrices is universal both in the bulk and at the edge. This includes a probabilistic version of local quantum unique ergodicity and asymptotic normality of the…

Probability · Mathematics 2016-01-12 Paul Bourgade , Horng-Tzer Yau

An $\epsilon$-distance-uniform graph is one in which from every vertex, all but an $\epsilon$-fraction of the remaining vertices are at some fixed distance $d$, called the critical distance. We consider the maximum possible value of $d$ in…

Combinatorics · Mathematics 2017-08-18 Mikhail Lavrov , Po-Shen Loh , Arnau Messegué

We show that the maximizing point and the supremum of the standardized uniform empirical process converge in distribution. Here, the limit variable (Z, Y ) has independent components. Moreover, Z attains the values zero and one with equal…

Probability · Mathematics 2025-12-22 Dietmar Ferger

The celebrated upper bound theorem of McMullen determines the maximal number of extreme points of a polyhedron in terms of its dimension and the number of constraints which define it, showing that the maximum is attained by the polar of the…

Combinatorics · Mathematics 2010-11-04 Xavier Allamigeon , Stephane Gaubert , Ricardo D. Katz

Let $(u_n)_{n \geq 0}$ be a non-degenerate Lucas sequence, given by the relation $u_n=a_1 u_{n-1}+a_2 u_{n-2}$. Let $\ell_u(m)=lcm(m, z_u(m))$, for $(m,a_2)=1$, where $z_u(m)$ is the rank of appearance of $m$ in $u_n$. We prove that…

Number Theory · Mathematics 2019-01-08 Daniele Mastrostefano

We give several upper bounds for the uniform simultaneous Diophantine exponent $\widehat{\lambda}_n(\xi)$ of a transcendental number $\xi\in\mathbb{R}$. The most important one relates $\widehat{\lambda}_n(\xi)$ and the ordinary simultaneous…

Number Theory · Mathematics 2021-07-26 Dmitry Badziahin

We give an upper bound in O(d ^((n+1)/2)) for the number of critical points of a normal random polynomial with degree d and at most n variables. Using the large deviation principle for the spectral value of large random matrices we obtain…

Numerical Analysis · Mathematics 2010-07-12 Jean-Pierre Dedieu , Gregorio Malajovich

Let $n,k,t$ be positive integers. What is the maximum number of arcs in a digraph on $n$ vertices in which there are at most $t$ distinct walks of length $k$ with the same endpoints? In this paper, we prove that the maximum number is equal…

Combinatorics · Mathematics 2021-06-02 Zhenhua Lyu

Consider d uniformly random permutation matrices on n labels. Consider the sum of these matrices along with their transposes. The total can be interpreted as the adjacency matrix of a random regular graph of degree 2d on n vertices. We…

Probability · Mathematics 2019-09-25 Ioana Dumitriu , Tobias Johnson , Soumik Pal , Elliot Paquette

The Airy line ensemble is a random collection of continuous ordered paths that plays an important role within random matrix theory and the Kardar-Parisi-Zhang universality class. The aim of this paper is to prove a universality property of…

Probability · Mathematics 2026-03-04 Denis Denisov , Will FitzGerald , Vitali Wachtel

The critical exponent $E(\mathbf u)$ of an infinite sequence $\mathbf u$ over a finite alphabet expresses the maximal repetition of a factor in $\mathbf u$. By the famous Dejean's theorem, $E(\mathbf u) \geq 1+\frac1{d-1}$ for every $d$-ary…

Combinatorics · Mathematics 2022-08-02 Lubomíra Dvořáková , Daniela Opočenská , Edita Pelantová

We show that the maximum cardinality of an anti-chain composed of intersections of a given set of n points in the plane with half-planes is close to quadratic in n. We approach this problem by establishing the equivalence with the problem…

Metric Geometry · Mathematics 2015-02-18 Rom Pinchasi , Günter Rote

We derive an upper bound for the mean of the supremum of the empirical process indexed by a class of functions that are known to have variance bounded by a small constant $\delta$. The bound is expressed in the uniform entropy integral of…

Statistics Theory · Mathematics 2010-12-30 Aad van der Vaart , Jon A. Wellner

In this note we show that the singular probability of the adjacency matrix of a random $d$-regular graph on $n$ vertices, where $d$ is fixed and $n \to \infty$, is bounded by $n^{-1/3+o(1)}$. This improves a recent bound by Huang. Our…

Probability · Mathematics 2023-08-15 Hoi H. Nguyen , Amanda Pan

We consider symmetric Markov chains on $\Bbb Z^d$ where we do {\bf not} assume that the conductance between two points must be zero if the points are far apart. Under a uniform second moment condition on the conductances, we obtain upper…

Probability · Mathematics 2007-05-23 Richard F. Bass , Takashi Kumagai

Let $H_n$ be a graph on $n$ vertices and let $\ber{H_n}$ denote the complement of $H_n$. Suppose that $\Delta = \Delta(n)$ is the maximum degree of $\ber{H_n}$. We analyse three algorithms for sampling $d$-regular subgraphs ($d$-factors) of…

Combinatorics · Mathematics 2019-10-25 Pu Gao , Catherine Greenhill
‹ Prev 1 4 5 6 7 8 10 Next ›