SearcharxivSearch

arXiv · 2604.01877

Semicircle laws with combined variance for non-uniform Erd\H{o}s-R\'enyi hypergraphs

Abstract

We consider Erd\H{o}s-R\'enyi-type random hypergraphs that are non-uniform, in the sense that hyperedges of different sizes may coexist, and inhomogeneous, in that connection probabilities may depend on the hyperedge size. All parameters are allowed to scale with the hypergraph size. We study the random adjacency matrix whose $(u,v)$-entry counts the number of hyperedges containing both vertices $u$ and $v$, and characterize its expected limiting spectral distribution in terms of the connection probabilities and the hyperedge sizes. We provide a Pastur-type condition, in the sense of Chatterjee (2005), under which the matrix can be Gaussianized, as well as a more restrictive but simpler sufficient condition in terms of the generalized average degree of the model. As a second main result, based on such a Gaussianization, we characterize the limiting spectral distributions under non-sparse conditions as semicircle laws with an explicit parametric variance. The latter can be expressed as a convex combination of the variances arising in the uniform cases, with coefficients determined by the trade-off between the different sources of inhomogeneity.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Luca Avena, Elia Bisi, Eleonora Bordiga. 2026-04-02. Semicircle laws with combined variance for non-uniform Erd\H{o}s-R\'enyi hypergraphs. https://arxiv.org/abs/2604.01877

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