Related papers: Limit law for root separation in random polynomial…

Let $p_n$ be a random, degree $n$ polynomial whose roots are chosen independently according to the probability measure $\mu$ on the complex plane. For a deterministic point $\xi$ lying outside the support of $\mu$, we show that almost…

Let $p_n(x)$ be a polynomial of degree $n$ having $n$ distinct, real roots distributed according to a nice probability distribution $u(0,x)dx$ on $\mathbb{R}$. One natural problem is to understand the density $u(t,x)$ of the roots of the…

The probability that a zero of a random real polynomial of increasing degree is real tends to zero. However, passing from polynomials to Laurent polynomials yields a surprising result: the probability that a root is real tends not to zero,…

In this paper we investigate the following related problems: (A) the separation of $p$-adic roots of integer polynomials of a fixed degree and bounded height; and (B) counting integer polynomials of a fixed degree and bounded height with…

We study the fundamental question of how likely it is that two randomly chosen trees are isomorphic to each other for different models of random trees. We show that the probability decays exponentially for rooted labeled trees as well as…

In this paper, we study the number of real roots of random trigonometric polynomials with iid coefficients. When the coefficients have zero mean, unit variance and some finite high moments, we show that the variance of the number of real…

Let $p\_n$ be the probability for a planar Poisson-Voronoi cell to have exactly $n$ sides. We construct the asymptotic expansion of $\log p\_n$ up to terms that vanish as $n\to\infty$. We show that {\it two independent biased random walks}…

Consider a set of $n$ vertices, where each vertex has a location in $\mathbb{R}^d$ that is sampled uniformly from the unit cube in $\mathbb{R}^d$, and a weight associated to it. Construct a random graph by placing edges independently for…

In this article, we consider the following family of random trigonometric polynomials $p_n(t,Y)=\sum_{k=1}^n Y_{k,1} \cos(kt)+Y_{k,2}\sin(kt)$ for a given sequence of i.i.d. random variables $\{Y_{k,1},Y_{k,2}\}_{k\ge 1}$ which are centered…

In this paper, we study the distribution of the minimal distance (in the Hamming metric) of a random linear code of dimension $k$ in $\mathbb{F}_q^n$. We provide quantitative estimates showing that the distribution function of the minimal…

We investigate the probability that a random polynomial with independent, mean-zero and finite variance coefficients has no real zeros. Specifically, we consider a random polynomial of degree $2n$ with coefficients given by an i.i.d.…

We prove a Poisson limit theorem in the total variation distance of functionals of a general Poisson point process using the Malliavin-Stein method. Our estimates only involve first and second order difference operators and are closely…

In this paper, we study the asymptotic macroscopic behavior of the root sets of iterated, randomized derivatives of polynomials. The randomization depend on a parameter of inverse temperature $\beta \in (0, \infty]$, the case $\beta =…

In this paper we study bounds for the total variation distance between two second degree polynomials in normal random variables provided that they essentially depend on at least three variables.

Let $T_n$ be a random recursive tree with $n$ nodes. List vertices of $T_n$ in decreasing order of degree as $v^1,\ldots,v^n$, and write $d^i$ and $h^i$ for the degree of $v^i$ and the distance of $v^i$ from the root, respectively. We prove…

We study the asymptotic distributions of the number of crossings and the number of simple chords in a random chord diagram. Using size-bias coupling and Stein's method, we obtain bounds on the Kolmogorov distance between the distribution of…

We introduce a sequence $P_{2n}$ of monic reciprocal polynomials with integer coefficients having the central coefficients fixed. We prove that the ratio between number of nonunimodular roots of $P_{2n}$ and its degree $d$ has a limit when…

An integer partition of $n$ is a decreasing sequence of positive integers that add up to $[n]$. Back in $1979$ Macdonald posed a question about the limit value of the probability that two partitions chosen uniformly at random, and…

The question about the behavior of gaps between zeros of polynomials under differentiation is classical and goes back to Marcel Riesz. In this paper, we analyze a nonlocal nonlinear partial differential equation formally derived by Stefan…

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…