Search arXivSearch

arXiv · 1203.5941

Circular law for random discrete matrices of given row sum

Abstract

Let $M_n$ be a random matrix of size $n\times n$ and let $λ_1,...,λ_n$ be the eigenvalues of $M_n$. The empirical spectral distribution $μ_{M_n}$ of $M_n$ is defined as $$μ_{M_n}(s,t)=\frac{1}{n}# \{k\le n, \Re(λ_k)\le s; \Im(λ_k)\le t\}.$$ The circular law theorem in random matrix theory asserts that if the entries of $M_n$ are i.i.d. copies of a random variable with mean zero and variance $σ^2$, then the empirical spectral distribution of the normalized matrix $\frac{1}{σ\sqrt{n}}M_n$ of $M_n$ converges almost surely to the uniform distribution $μ_\cir$ over the unit disk as $n$ tends to infinity. In this paper we show that the empirical spectral distribution of the normalized matrix of $M_n$, a random matrix whose rows are independent random $(-1,1)$ vectors of given row-sum $s$ with some fixed integer $s$ satisfying $|s|\le (1-o(1))n$, also obeys the circular law. The key ingredient is a new polynomial estimate on the least singular value of $M_n$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hoi H. Nguyen, Van Vu. 2012-03-27. Circular law for random discrete matrices of given row sum. https://arxiv.org/abs/1203.5941

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

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO