SearcharxivSearch

arXiv · 2504.13833

Limiting spectral laws for sparse random circulant matrices

Abstract

Fix a positive integer $d$ and let $(G_n)_{n\geq1}$ be a sequence of finite abelian groups with orders tending to infinity. For each $n \geq 1$, let $C_n$ be a uniformly random $G_n$-circulant matrix with entries in $\{0,1\}$ and exactly $d$ ones in each row/column. We show that the empirical spectral distribution of $C_n$ converges weakly in expectation to a probability measure $\mu$ on $\mathbb{C}$ if and only if the distribution of the order of a uniform random element of $G_n$ converges weakly to a probability measure $\rho$ on $\mathbb{N}^*$, the one-point compactification of the natural numbers. Furthermore, we show that convergence in expectation can be strengthened to convergence in probability if and only if $\rho$ is a Dirac mass $\delta_m$. In this case, $\mu$ is the $d$-fold convolution of the uniform distribution on the $m$-th roots of unity if $m\in\mathbb{N}$ or the unit circle if $m = \infty$. We also establish that, under further natural assumptions, the determinant of $C_n$ is $\pm\exp((c_{m,d}+o(1))|G_n|)$ with high probability, where $c_{m,d}$ is a constant depending only on $m$ and $d$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Adrian Beker. 2025-04-18. Limiting spectral laws for sparse random circulant matrices. https://arxiv.org/abs/2504.13833

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR