Tail bounds for gaps between eigenvalues of sparse random matrices

Lopatto, Patrick; Luh, Kyle

doi:10.48550/arxiv.1901.05948

Cited by 5 publications

(23 citation statements)

References 40 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We note that since its first appearance in [25], the RLCD has been used in many works (see, e.g., [13,14,16,19,26]); the MRLCD (and median threshold, for discrete distributions) can replace these applications in a black-box manner, and likely lead to improved quantitative estimates. We also note that a related use of combinatorially incorporating arithmetic unstructure of different projections of a vector appeared in recent work of the authors [8]; however, the interaction with both the net and anticoncentration estimates is more delicate here.…”

Section: Introductionmentioning

confidence: 99%

On the smallest singular value of symmetric random matrices

Jain¹,

Sah²,

Sawhney³

2020

Preprint

View full text Add to dashboard Cite

We show that for an n × n random symmetric matrix An, whose entries on and above the diagonal are independent copies of a sub-Gaussian random variable ξ with mean 0 and variance 1,) for all ǫ ≥ 0. This improves a result of Vershynin, who obtained such a bound with n 1/2 replaced by n c for a small constant c, and 1/8 replaced by (1/8) + η (with implicit constants also depending on η > 0). Furthermore, when ξ is a Rademacher random variable, we prove thatThe special case ǫ = 0 improves a recent result of Campos, Mattos, Morris, and Morrison, which showed that P[sn(AnThe main innovation in our work are new notions of arithmetic structure -the Median Regularized Least Common Denominator and the Median Threshold, which we believe should be more generally useful in contexts where one needs to combine anticoncentration information of different parts of a vector.

show abstract

Section: Introductionmentioning

confidence: 99%

On the smallest singular value of symmetric random matrices

Jain¹,

Sah²,

Sawhney³

2020

Preprint

View full text Add to dashboard Cite

show abstract

“…Also, one can obtain tail-bounds for consecutive eigenvalue gaps of G(n, p), i.e. δ i = λ i+1 − λ i which in turn leads to a lower bound on ∆ min for ĀG(n,p) as ∆ min ≥ n −5/2+o(1) p −1/2 , almost surely [43,44]. This is the best known bound for this quantity for discrete random matrices.…”

Section: Mixing Of Quantum Walksmentioning

confidence: 90%

“…However as we examine gaps λ i+r − λ i for large enough r, rigidity provides a better estimate on the gap size than the tail bounds from Ref. [43]. Combining both estimates at the different scales of r yields an improved estimate for Σ r .…”

Section: Mixing Of Quantum Walksmentioning

confidence: 97%

“…However, this does not rule out the possibility of having gaps ∆ and as such, to extract bounds on eigenvalue gaps one needs to look at the local spectral statistics of ĀG(n,p) . It has been recently proven that ĀG(n,p) has no degenerate eigenvalues (simple spectrum), almost surely as long as C log 6 (n)/n ≤ p ≤ 1 − C log 6 (n)/n for some constant C > 0 [37,42,43]. Note that these bounds are quite tight: for p = 1, we know that ĀG(n,p) has repeated eigenvalues while on the other hand for p = o(log(n)/n), the underlying random graph is disconnected, implying again that ĀG(n,p) has repeated eigenvalues.…”

Section: Mixing Of Quantum Walksmentioning

confidence: 99%

“…Lemma 10 (A G(n,p) has simple spectrum [37,42,43]) Let A G(n,p) denote the adjacency matrix of a random graph G(n, p). Then there exists a constant C > 0 such that for…”

Section: Spectral Properties Of Erd öS-renyi Random Networkmentioning

confidence: 99%

See 2 more Smart Citations

How Fast Do Quantum Walks Mix?

2020

Self Cite

View full text Add to dashboard Cite

The fundamental problem of sampling from the limiting distribution of quantum walks on networks, known as mixing, finds widespread applications in several areas of quantum information and computation. Of particular interest in most of these applications, is the minimum time beyond which the instantaneous probability distribution of the quantum walk remains close to this limiting distribution, known as the quantum mixing time. However this quantity is only known for a handful of specific networks. In this letter, we prove an upper bound on the quantum mixing time for almost all networks, i.e. the fraction of networks for which our bound holds, goes to one in the asymptotic limit. To this end, using several results in random matrix theory, we find the quantum mixing time of Erdös-Renyi random networks: networks of n nodes where each edge exists with probability p independently. For example for dense random networks, where p is a constant, we show that the quantum mixing time is O(n 3/2+o(1) ). Besides opening avenues for the analytical study of quantum dynamics on random networks, our work could find applications beyond quantum information processing. Owing to the universality of Wigner random matrices, our results on the spectral properties of random graphs hold for general classes of random matrices that are ubiquitous in several areas of physics. In particular, our results could lead to novel insights into the equilibration times of isolated quantum systems defined by random Hamiltonians, a foundational problem in quantum statistical mechanics.The quantum dynamics of any discrete system can be captured by a quantum walk on a network, which is a universal model for quantum computation [1]. Besides being a useful primitive to design quantum algorithms [2][3][4][5][6], quantum walks are a powerful tool to model transport in quantum systems such as the transfer of excitations in light-harvesting systems [7][8][9]. Studying the long-time dynamics of quantum walks on networks is crucial to the understanding of these diverse problems. As quantum evolutions are unitary and hence distancepreserving, quantum walks never converge to a limiting distribution, unlike their classical counterpart. However, given a network of n nodes, one can define the limiting distribution of quantum walk on the network as the long-time average probability distribution of finding the walker in each node [10]. Of particular interest is the quantum mixing time: starting from some initial state, the minimum time after which the underlying quantum walk remains close to its limiting distribution.The importance of the problem of mixing for quantum walks cannot be overstated: this is at the heart of quantum speedups for a number of quantum algorithms [2,11] and is also key to demonstrating the equivalence between the standard (circuit) and Hamiltonian-based models of quantum computation [12,13]. Unfortunately, no general result exists for quantum mixing time on networks: it has been estimated for a handful of specific graphs (graphs and networks are ...

show abstract

Noise sensitivity of the top eigenvector of a Wigner matrix

Bordenave

Lugosi

Zhivotovskiy

2020

Probab. Theory Relat. Fields

View full text Add to dashboard Cite

We investigate the noise sensitivity of the top eigenvector of a Wigner matrix in the following sense. Let v be the top eigenvector of an N × N Wigner matrix. Suppose that k randomly chosen entries of the matrix are resampled, resulting in another realization of the Wigner matrix with top eigenvector v [k] . We prove that, with high probability, when k ≪ N 5/3−o(1) , then v and v [k] are almost collinear and when k ≫ N 5/3 , then v [k] is almost orthogonal to v.

show abstract

Tail bounds for gaps between eigenvalues of sparse random matrices

Cited by 5 publications

References 40 publications

On the smallest singular value of symmetric random matrices

On the smallest singular value of symmetric random matrices

How Fast Do Quantum Walks Mix?

Noise sensitivity of the top eigenvector of a Wigner matrix

Contact Info

Product

Resources

About