English
Related papers

Related papers: Pseudo-Wigner Matrices

200 papers

Attention has been brought to the possibility that statistical fluctuation properties of several complex spectra, or, well-known number sequences may display strong signatures that the Hamiltonian yielding them as eigenvalues is…

Quantum Physics · Physics 2009-11-10 Zafar Ahmed

Correlations between energy levels can help distinguish whether a many-body system is of integrable or chaotic nature. The study of short-range and long-range spectral correlations generally involves quantities which are very different,…

Quantum Physics · Physics 2025-11-06 Ruth Shir , Pablo Martinez-Azcona , Aurélia Chenu

We investigate the eigenvalues statistics of ensembles of normal random matrices when their order N tends to infinite. In the model the eigenvalues have uniform density within a region determined by a simple analytic polynomial curve. We…

Probability · Mathematics 2009-09-08 Alexei M. Veneziani , Tiago Pereira , Domingos H. U. Marchetti

Any positive word comprised of random sequence of tokens form a finite alphabet can be reduced (without change of length) using an appropriate size Braid group relationships. Surprisingly the Braid relations dramatically reduce the…

Computational Complexity · Computer Science 2013-08-20 Dara O Shayda

Random Matrix Theory (RMT) has successfully modeled diverse systems, from energy levels of heavy nuclei to zeros of $L$-functions; this correspondence has allowed RMT to successfully predict many number theoretic behaviors. However there…

We have calculated the joint probability distribution function for random reverse-cyclic matrices and shown that it is related to an N-body exactly solvable model. We refer to this well-known model potential as a screened harmonic…

Mathematical Physics · Physics 2013-02-13 Shashi C. L. Srivastava , Sudhir R. Jain

We develop the theory of cryptographic nondeterministic-secure pseudorandomness beyond the point reached by Rudich's original work (Rudich 1997), and apply it to draw new consequences in average-case complexity and proof complexity.…

Computational Complexity · Computer Science 2025-01-14 Iddo Tzameret , Lu-Ming Zhang

We consider the random hypergraph on a finite vertex set by choosing each set of vertices as an hyperedge independently at random. We express the probability distributions of the (lower-)associated simplicial complex and the…

Combinatorics · Mathematics 2022-11-09 S. Ren

Building upon the theory of graph limits and the Aldous-Hoover representation and inspired by Panchenko's work on asymptotic Gibbs measures (Annals of Probability 2013), we construct continuous embeddings of discrete probability…

Probability · Mathematics 2017-11-17 Amin Coja-Oghlan , Will Perkins , Kathrin Skubch

We study the spectrum of a random multigraph with a degree sequence ${\bf D}_n=(D_i)_{i=1}^n$ and average degree $1 \ll \omega_n \ll n$, generated by the configuration model, and also the spectrum of the analogous random simple graph. We…

Probability · Mathematics 2020-05-15 Amir Dembo , Eyal Lubetzky , Yumeng Zhang

One of the simplest methods of generating a random graph with a given degree sequence is provided by the Monte Carlo Markov Chain method using switches. The switch Markov chain converges to the uniform distribution, but generally the rate…

Combinatorics · Mathematics 2021-07-06 Péter L. Erdős , Ervin Győri , Tamás Róbert Mezei , István Miklós , Dániel Soltész

In this paper, we study the effect of sparsity on the appearance of outliers in the semi-circular law. Let $(W_n)_{n=1}^\infty$ be a sequence of random symmetric matrices such that each $W_n$ is $n\times n$ with i.i.d entries above and on…

Probability · Mathematics 2019-05-24 Konstantin Tikhomirov , Pierre Youssef

We consider an ensemble of large non-Hermitian random matrices of the form $\hat{H}+i\hat{A}_s$, where $\hat{H}$ and $\hat{A}_s$ are Hermitian statistically independent random $N\times N$ matrices. We demonstrate the existence of a new…

Condensed Matter · Physics 2016-08-31 Yan V. Fyodorov , Boris A. Khoruzhenko , Hans-Juergen Sommers

We review the application of the notion of local convergence on locally finite randomly rooted graphs, known as Benjamini-Schramm convergence, to the calculation of the global eigenvalue density of random matrices from the beta-Gaussian and…

Probability · Mathematics 2018-05-29 Sergio Andraus

We develop a supersymmetric field theoretical description of the Gaussian ensemble of the almost diagonal Hermitian Random Matrices. The matrices have independent random entries H_{ij} with parametrically small off-diagonal elements…

Disordered Systems and Neural Networks · Physics 2016-09-07 Oleg Yevtushenko , Alexander Ossipov

We consider large Hermitian matrices whose entries are defined by evaluating the exponential function along orbits of the skew-shift $\binom{j}{2} \omega+jy+x \mod 1$ for irrational $\omega$. We prove that the eigenvalue distribution of…

Mathematical Physics · Physics 2021-07-14 Arka Adhikari , Marius Lemm , Horng-Tzer Yau

Efficient methods for generating pseudo-randomly distributed unitary operators are needed for the practical application of Haar distributed random operators in quantum communication and noise estimation protocols. We develop a theoretical…

Quantum Physics · Physics 2009-11-11 Joseph Emerson , Etera Livine , Seth Lloyd

We consider $N\times N$ random matrices of the form $H = W + V$ where $W$ is a real symmetric Wigner matrix and $V$ a random or deterministic, real, diagonal matrix whose entries are independent of $W$. We assume subexponential decay for…

Probability · Mathematics 2015-09-29 Ji Oon Lee , Kevin Schnelli

Pseudospectral analysis serves as a powerful tool in matrix computation and the study of both linear and nonlinear dynamical systems. Among various numerical strategies, random sampling, especially in the form of rank-$1$ perturbations,…

Spectral Theory · Mathematics 2025-05-19 Kuo Gai , Bin Shi

It follows from the Marcus-Spielman-Srivastava proof of the Kadison-Singer conjecture that if $G=(V,E)$ is a $\Delta$-regular dense expander then there is an edge-induced subgraph $H=(V,E_H)$ of $G$ of constant maximum degree which is also…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-03-09 Luca Becchetti , Andrea Clementi , Emanuele Natale , Francesco Pasquale , Luca Trevisan