Related papers: Random polynomials: central limit theorems for the…
Concentration inequalities, which have proved very useful in a variety of fields, provide fairly tight bounds on large deviation probabilities while central limit theorem (CLT) describes the asymptotic distribution around the mean (at the…
We prove a Central Limit Theorem (CLT) in the non-commutative setting of random matrix products where the underlying process is driven by a subshift of finite type (SFT) with Markov measure. We use the martingale method introduced by Y.…
We show that with high probability the number of real zeroes of a random polynomial is bounded by the number of vertices on its Newton-Hadamard polygon times the cube of the logarithm of the polynomial degree. A similar estimate holds for…
If $p:\mathbb{C} \to \mathbb{C}$ is a non-constant polynomial, the Gauss--Lucas theorem asserts that its critical points are contained in the convex hull of its roots. We consider the case when $p$ is a random polynomial of degree $n$ with…
Recently, B. Yang and J. Yang derived a family of rational solutions to the Sasa-Satsuma equation, and showed that any of its members constitutes a partial-rogue wave provided that an associated generalised Okamoto polynomial has no real…
In this paper, by the generalized Bell umbra and Rolle's theorem, we give some results on the real rootedness of polynomials. Some applications on partition polynomials and the sigma polynomials of graphs are given.
One of the cornerstones of the distributed complexity theory is the derandomization result by Chang, Kopelowitz, and Pettie [FOCS 2016]: any randomized LOCAL algorithm that solves a locally checkable labeling problem (LCL) can be…
Under reasonable algebraic assumptions and under an infinite second order moment assumption, we show that the logarithm of the norm (log-norm) of a product of random i.i.d. matrices with entries in $\mathbb{R}$ or in any other local field…
The $k$-cut number of rooted graphs was introduced by Cai et al. as a generalization of the classical cutting model by Meir and Moon. In this paper, we show that all moments of the k-cut number of conditioned Galton-Watson trees converges…
In 1985, Razborov discovered a proof that the monotone circuit complexity of the clique problem is super-polynomial. Alon and Boppana improved the result into exponential lower bound exp(\Omega(n / \log n)^{1/3})) of a monotone circuit C to…
One of the central models in distributed computing is Linial's LOCAL model [SIAM J. Comp. 1992]. Over time, researchers have studied distributed graph problems in the LOCAL model under slightly different assumptions, such as whether nodes…
This paper extends earlier work on the distribution in the complex plane of the roots of random polynomials. In this paper, the random polynomials are generalized to random finite sums of given "basis" functions. The basis functions are…
In many medical and biological investigations, including genetics, it is typical to handle high dimensional data which can be viewed as a set of values of some factors and a binary response variable. For instance, the response variable can…
The purpose of this paper is to provide a first class of explicit sufficient conditions for the central limit theorem and related results in the setup of non-uniformly (partially) expanding non iid random transformations, considered as…
A while ago MLC (the conjecture that the Mandelbrot set is locally connected) was proven for quasi-hyperbolic points by Douady and Hubbard, and for boundaries of hyperbolic components by Yoccoz. More recently Yoccoz proved MLC for all at…
Wooley ({\em J. Number Theory}, 1996) gave an elementary proof of a Bezout like theorem allowing one to count the number of isolated integer roots of a system of polynomial equations modulo some prime power. In this article, we adapt the…
We investigate the evolution of the empirical distribution of the complex roots of high-degree random polynomials, when the polynomial undergoes the heat flow. In one prominent example of Weyl polynomials, the limiting zero distribution…
Tries are among the most versatile and widely used data structures on words. In particular, they are used in fundamental sorting algorithms such as radix sort which we study in this paper. While the performance of radix sort and tries under…
We study the Central Limit Theorem (CLT) in the so-called hybrid Lebesgue-continuous spaces and tail behavior of normed sums of centered random independent variables (vectors) with values in these spaces.
For each $n$, let $X_n \in \{0,\ldots,n\}$ be a random variable with mean $\mu_n$, standard deviation $\sigma_n$, and let \[ P_n(z) = \sum_{k=0}^n \mathbb{P}( X_n = k) z^k ,\] be its probability generating function. We show that if none of…