English
Related papers

Related papers: Cohen-Lenstra distribution for sparse matrices wit…

200 papers

Let $\mathcal B=\mathcal B_{k,n,p}$ be a random collection of $k$-subsets of $[n]$ where each possible set is present independently with probability $p$. Let $\cal E_{\mathcal B}$ be the event that $\mathcal B$ defines the set of bases of a…

Combinatorics · Mathematics 2026-05-11 Patrick Bennett , Alan Frieze

Consider a random $n\times n$ zero-one matrix with "density" $p$, sampled according to one of the following two models: either every entry is independently taken to be one with probability $p$ (the "Bernoulli" model), or each row is…

Combinatorics · Mathematics 2021-04-22 Asaf Ferber , Matthew Kwan , Lisa Sauermann

We extend the Cohen-Lenstra heuristics to the setting of ray class groups of imaginary quadratic number fields, viewed as exact sequences of Galois modules. By asymptotically estimating the mixed moments governing the distribution of a…

Number Theory · Mathematics 2017-10-23 Carlo Pagano , Efthymios Sofos

We give effective estimates for the $l^1$-distance between the corank distribution of $r \times r$ R\'edei matrices and the measure predicted by the Cohen--Lenstra heuristics. To this end we pinpoint a class of stochastic processes, which…

Number Theory · Mathematics 2021-03-09 Peter Koymans , Carlo Pagano

Given a prime $p$ and a positive integer $k$, let $\mathrm{M}_{n}(\mathbb{Z}/p^{k}\mathbb{Z})$ be the ring of $n \times n$ matrices over $\mathbb{Z}/p^{k}\mathbb{Z}$. We consider the number of solutions $X \in…

Combinatorics · Mathematics 2023-01-10 Gilyoung Cheong , Yunqi Liang , Michael Strand

In this paper we study the asymptotic normality in high-dimensional linear regression. We focus on the case where the covariance matrix of the regression variables has a KMS structure, in asymptotic settings where the number of predictors,…

Statistics Theory · Mathematics 2022-05-17 Saulius Jokubaitis , Remigijus Leipus

For a family of interpolation norms $\| \cdot \|_{1,2,s}$ on $\mathbb{R}^n$, we provide a distribution over random matrices $\Phi_s \in \mathbb{R}^{m \times n}$ parametrized by sparsity level $s$ such that for a fixed set $X$ of $K$ points…

Data Structures and Algorithms · Computer Science 2015-06-03 Felix Krahmer , Rachel Ward

We investigate the level spacing distribution for the quantum spectrum of the square billiard. Extending work of Connors--Keating, and Smilansky, we formulate an analog of the Hardy--Littlewood prime $k$-tuple conjecture for sums of two…

Mathematical Physics · Physics 2017-01-06 Tristan Freiberg , Pär Kurlberg , Lior Rosenzweig

We prove that $\frac{\log n}{n}$ is the sharp threshold for universality of the distribution of cokernels of random matrices over $\mathbb{Z}_p$. More precisely, let $\alpha_n = \frac{c\log n}{n}$ for a constant $c>0$ and let $A(n)$ be an…

Combinatorics · Mathematics 2026-03-16 Jiwan Jung , Jungin Lee , Myungjun Yu

In the sufficiently sparse case, we find the probability that a uniformly random bipartite graph with given degree sequence contains no edge from a specified set of edges. This enables us to enumerate loop-free digraphs and oriented graphs…

Combinatorics · Mathematics 2026-01-09 Catherine Greenhill , Mahdieh Hasheminezhad , Isaiah Iliffe , Brendan D. McKay

In [NVP22], Nguyen and Van Peski raised the question of whether the surjective flag of $\mathbb Z_p$-modules modeled by $\mathrm{cok}(M_1\cdots M_k)\twoheadrightarrow \dots\twoheadrightarrow \mathrm{cok}(M_1)$ for independent random…

Number Theory · Mathematics 2024-03-18 Yifeng Huang

We study asymptotic zero distribution of random Laurent polynomials whose support are contained in dilates of a fixed integral polytope $P$ as their degree grow. We consider a large class of probability distributions including the ones…

Complex Variables · Mathematics 2017-06-06 Turgay Bayraktar

We consider the ensemble of N-dimensional random symmetric matrices A that have, in average, p non-zero elements per row. We study the asymptotic behavior of the norm of A in the limit of infinitely increasing N and p. We prove that the…

Probability · Mathematics 2014-11-18 A. Khorunzhy

Let g be a random element of a finite classical group G, and let \lambda_{z-1}(g) denote the partition corresponding to the polynomial z-1 in the rational canonical form of g. As the rank of G tends to infinity, \lambda_{z-1}(g) tends to a…

Number Theory · Mathematics 2013-07-04 Jason Fulman

In this paper, we study the distribution of the cokernel of a general random Hermitian matrix over the ring of integers $\mathcal{O}$ of a quadratic extension $K$ of $\mathbb{Q}_p$. For each positive integer $n$, let $X_n$ be a random $n…

Number Theory · Mathematics 2023-11-23 Jungin Lee

We revisit the probabilistic construction of sparse random matrices where each column has a fixed number of nonzeros whose row indices are drawn uniformly at random. These matrices have a one-to-one correspondence with the adjacency…

Information Theory · Computer Science 2013-07-25 Bubacarr Bah , Jared Tanner

Random correlation matrices are studied for both theoretical interestingness and importance for applications. The author of [6] is interested in their interpretation as covariance matrices of purely random signals, the authors of [16]…

Probability · Mathematics 2016-07-28 A. M. Hanea , G. F Nane

For a finite group $\Gamma$, we study the distribution of the Galois group $G_{\emptyset}^{\#}(K)$ of the maximal unramified extension of $K$ that is split completely at $\infty$ and has degree prime to $|\Gamma|$ and $\textit{Char}(K)$, as…

Number Theory · Mathematics 2025-07-30 Yuan Liu , Ken Willyard

We revisit the derivation of the density of states of sparse random matrices. We derive a recursion relation that allows one to compute the spectrum of the matrix of incidence for finite trees that determines completely the low…

Condensed Matter · Physics 2009-11-07 Guilhem Semerjian , Leticia F. Cugliandolo

Random subspaces $X$ of $\mathbb{R}^n$ of dimension proportional to $n$ are, with high probability, well-spread with respect to the $\ell_2$-norm. Namely, every nonzero $x \in X$ is "robustly non-sparse" in the following sense: $x$ is…

Computational Complexity · Computer Science 2024-07-11 Venkatesan Guruswami , Peter Manohar , Jonathan Mosheiff