Related papers: A note on random orthogonal polynomials on a compa…
We consider the moment space $\mathcal{M}_n$ corresponding to $p \times p$ real or complex matrix measures defined on the interval $[0,1]$. The asymptotic properties of the first $k$ components of a uniformly distributed vector $(S_{1,n},…
There has been significant interest in studying the asymptotics of certain generalised moments, called the moments of moments, of characteristic polynomials of random Haar-distributed unitary and symplectic matrices, as the matrix size $N$…
We determine the asymptotics for the variance of the number of zeros of random linear combinations of orthogonal polynomials of degree $\leq n$ in subintervals $\left [ a,b\right ] $ of the support of the underlying orthogonality measure…
Starting from Montgomery's conjecture, there has been a substantial interest on the connections of random matrix theory and the theory of L-functions. In particular, moments of characteristic polynomials of random matrices have been…
We utilize Cauchy's argument principle in combination with the Jacobian of a holomorphic function in several complex variables and the first moment of a ratio of two correlated complex normal random variables to prove explicit formulas for…
We study asymptotic distribution of zeros of random holomorphic sections of high powers of positive line bundles defined over projective homogenous manifolds. We work with a wide class of distributions that includes real and complex…
For a measure on a subset of the complex plane we consider $L^p$-optimal weighted polynomials, namely, monic polynomials of degree $n$ with a varying weight of the form $w^n = {\rm e}^{-n V}$ which minimize the $L^p$-norms, $1 \leq p \leq…
We study global distribution of zeros for a wide range of ensembles of random polynomials. Two main directions are related to almost sure limits of the zero counting measures, and to quantitative results on the expected number of zeros in…
We establish formulae for the moments of the moments of the characteristic polynomials of random orthogonal and symplectic matrices in terms of certain lattice point count problems. This allows us to establish asymptotic formulae when the…
We study the roots of a random polynomial over the field of p-adic numbers. For a random monic polynomial with coefficients in $\mathbb{Z}_p$, we obtain an asymptotic formula for the factorial moments of the number of roots of this…
Using asymptotics of Toeplitz+Hankel determinants, we establish formulae for the asymptotics of the moments of the moments of the characteristic polynomials of random orthogonal and symplectic matrices, as the matrix-size tends to infinity.…
The uniform probability measure on a convex polytope induces piecewise polynomial densities on its projections. For a fixed combinatorial type of simplicial polytopes, the moments of these measures are rational functions in the vertex…
We consider random orthonormal polynomials $$ F_{n}(x)=\sum_{i=0}^{n}\xi_{i}p_{i}(x), $$ where $\xi_{0}$, \dots, $\xi_{n}$ are independent random variables with zero mean, unit variance and uniformly bounded $(2+\ep)$ moments, and…
We study moments of the logarithmic derivative of characteristic polynomials of orthogonal and symplectic random matrices. In particular, we compute the asymptotics for large matrix size, $N$, of these moments evaluated at points which are…
We study moments of characteristic polynomials of truncated Haar distributed matrices from the three classical compact groups O(N), U(N) and Sp(2N). For finite matrix size we calculate the moments in terms of hypergeometric functions of…
Multiple orthogonal polynomials are a generalization of orthogonal polynomials in which the orthogonality is distributed among a number of orthogonality weights. They appear in random matrix theory in the form of special determinantal point…
We consider asymptotics of ratios of random characteristic polynomials associated with orthogonal polynomial ensembles. Under some natural conditions on the measure in the definition of the orthogonal polynomial ensemble we establish a…
Let P_{n,m} denote the graph taken uniformly at random from the set of all planar graphs on {1,2,..., n} with exactly m(n) edges. We use counting arguments to investigate the probability that P_{n,m} will contain given components and…
It is known that random monic integral polynomials of bounded degree $d$ and integral coefficients distributed uniformly and independently in $[-H,H]$ are irreducible over $\mathbb{Z}$ with probability tending to $1$ as $H\to \infty$. In…
We study asymptotic behavior of the moments $M_k(\lambda)$ of the sum $X_1+\dots+X_{N_\lambda}$, where $N_\lambda$ follows the Poisson probability distribution with mean value $\lambda$ and $\{X_j\}$ is a family of i.i.d. random variables…