Searcharxiv⌕ Search

arXiv subjects

Ander Aguirre

Publications and source records attributed to Ander Aguirre.

7 recordsLinked to original sources

Central limit theorem for real zeros of random Weyl polynomials with general coefficients

For a random polynomial, the number of real zeros $N_{\mathbb R}$ is a highly nonlinear function of its coefficients, and its statistical properties have been studied extensively. A natural question is whether $N_{\mathbb R}$ satisfies a central limit theorem. For various ensembles with iid standard Gaussian coefficients, such central limit theorems have been established; see, for instance, arXiv:1911.12182, arXiv:1801.06331, arXiv:1401.5745; Azais and Leon, Electron. J. Probab. 18 (2013), no. 68; arXiv:1504.05355, arXiv:2111.09015, arXiv:1707.09276, arXiv:1005.4113. These results rely on a rich range of tools, including Kac-Rice formulas, moment methods, and Wiener chaos decompositions. In the non-Gaussian setting, however, many of these tools are unavailable. To the best of our knowledge, prior central limit theorems beyond the Gaussian setting were limited to Kac-type polynomials, including hyperbolic polynomials; see the works of Maslova (1974), O. Nguyen and Vu (arXiv:1904.04347), and, more recently, Do, N. Nguyen, and O'Rourke (arXiv:2605.26402). In this paper, we prove a central limit theorem for the total number of real zeros of Weyl polynomials whose coefficients are iid copies of a symmetric, mean-zero, variance-one subgaussian random variable $ξ$. This substantially extends one of the main results of Do and Vu (arXiv:1707.09276) to a broad class of non-Gaussian distributions, including the Rademacher distribution. Without the symmetry assumption, we prove central limit theorems for the number of real zeros for positive bulk intervals, as well as for $[0,\infty)$. Our proof combines the uniform one-point anti-concentration estimates from our recent work (arXiv:2511.07735) with the localization of Weyl polynomials around the coefficient index $i\approx x^2$. While our proofs use comparison to compute the variances, the CLT deduction is rather direct.

math.PR↗

Real Roots of Random Weyl Polynomials with General Coefficients: Expectation and Variance

In this paper, we investigate the number of real zeros of random Weyl polynomials of degree \(n \to \infty\) with general coefficient distributions. Motivated by the results of arXiv:1409.4128 and arXiv:1402.4628 as well as arXiv:1711.03316 and arXiv:1912.11901, we determine how the expected number of real zeros and their variance, over various natural intervals, depend on the moments of the common coefficient distribution. Our main finding is that while the first-order asymptotic of the expectation is universal, the next-order correction depends on the third and fourth moments of the distribution, and may grow linearly with \(\log n\), depending on the interval under consideration. In contrast, for the variance we show that the leading-order term is universal, which differs from the behavior observed for random trigonometric polynomials in arXiv:1711.03316 and arXiv:1912.11901. Our approach relies on an Edgeworth expansion for random walks arising from Weyl polynomials, a result of independent interest.

math.PR↗

Phase transition in one-dimensional excitable media with variable interaction range

We investigate two discrete models of excitable media on a one-dimensional integer lattice $\mathbb{Z}$: the $κ$-color Cyclic Cellular Automaton (CCA) and the $κ$-color Firefly Cellular Automaton (FCA). In both models, sites are assigned uniformly random colors from $\mathbb{Z}/κ\mathbb{Z}$. Neighboring sites with colors within a specified interaction range $r$ tend to synchronize their colors upon a particular local event of 'excitation'. We establish that there are three phases of CCA/FCA on $\mathbb{Z}$ as we vary the interaction range $r$. First, if $r$ is too small (undercoupled), there are too many non-interacting pairs of colors, and the whole graph $\mathbb{Z}$ will be partitioned into non-interacting intervals of sites with no excitation within each interval. If $r$ is within a sweet spot (critical), then we show the system clusters into ever-growing monochromatic intervals. For the critical interaction range $r=\lfloor κ/2 \rfloor$, we show the density of edges of differing colors at time $t$ is $Θ(t^{-1/2})$ and each site excites $Θ(t^{1/2})$ times up to time $t$. Lastly, if $r$ is too large (overcoupled), then neighboring sites can excite each other and such 'defects' will generate waves of excitation at a constant rate so that each site will get excited at least at a linear rate. For the special case of FCA with $r=\lfloor 2/κ\rfloor+1$, we show that every site will become $(κ+1)$-periodic eventually.

math.PR↗

Concentration of the number of real roots of random polynomials

Many statistics of roots of random polynomials have been studied in the literature, but not much is known on the concentration aspect. In this note we present a systematic study of this question, aiming towards nearly optimal bounds to some extent. Our method is elementary and works well for many models of random polynomials, with gaussian or non-gaussian coefficients.

math.PR↗

Pair Dependent Linear Statistics for Circular Beta Ensemble

We study limiting distribution of pair counting statistics of the form $ \sum_{1\leq i\neq j\leq N} f(L_N\*(θ_i-θ_j))$ for the circular $β$-ensemble (C$β$E) of random matrices for sufficiently smooth test function $f$ and $L_N=O(N).$ For $β=2$ and $L_N=N$ our results are inspired by a classical result of Montgomery on pair correlation of zeros of Riemann zeta function.

math.PR↗