Related papers: Pseudo-Wigner Matrices
We consider the number of crossings in a graph which is embedded randomly on a convex set of points. We give an estimate to the normal distribution in Kolmogorov distance which implies a convergence rate of order $n^{-1/2}$ for various…
Let $G$ be a large (simple, unlabeled) dense graph on $n$ vertices. Suppose that we only know, or can estimate, the empirical distribution of the number of subgraphs $F$ that each vertex in $G$ participates in, for some fixed small graph…
We consider distributional approximation by generalized Dickman distributions, which appear in number theory, perpetuities, logarithmic combinatorial structures and many other areas. We prove bounds in the Kolmogorov distance for the…
We present a new interpretation for reduced density matrices of secondary variables in relativistic systems via an analysis of Wigner's method to construct the irreducible unitary representations of the Poincar\'e group. We argue that the…
We suggest fast algorithm for the matrix generator of pseudorandom numbers based on Kolmogorov-Anosov K systems which has been proposed earlier. This algorithm reduces $N^{2}$ operation of the matrix generator to $NlnN$ and essentially…
We prove the universal asymptotically almost sure non-singularity of general Ginibre and Wigner ensembles of random matrices when the distribution of the entries are independent but not necessarily identically distributed and may depend on…
Although the spectra of random networks have been studied for a long time, the influence of network topology on the dense limit of network spectra remains poorly understood. By considering the configuration model of networks with four…
We introduce a new technique to prove bounds for the spectral radius of a random matrix, based on using Jensen's formula to establish the zerofreeness of the associated characteristic polynomial in a region of the complex plane. Our…
The classical Gaussian ensembles of random matrices can be constructed by maximizing Boltzmann-Gibbs-Shannon's entropy, S_{BGS} = - \int d{\bf H} [P({\bf H})] \ln [P({\bf H})], with suitable constraints. Here we construct and analyze…
Random matrix ensembles with orthogonal and unitary symmetry correspond to the cases of real symmetric and Hermitian random matrices respectively. We show that the probability density function for the corresponding spacings between…
In this paper we investigate phenomena of spontaneous emergence or purposeful formation of highly organized structures in networks of related agents. We show that the formation of large organized structures requires exponentially large, in…
Since E.P.Wigner (1958) established his famous semicircle law, lots of attention has been paid by physicists, probabilists and statisticians to study the asymptotic properties of the largest eigenvalues for random matrices. Bai and Yin…
We study sample covariance matrices arising from rectangular random matrices with i.i.d. columns. It was previously known that the resolvent of these matrices admits a deterministic equivalent when the spectral parameter stays bounded away…
We consider the convergence of the empirical spectral measures of random $N \times N$ unitary matrices. We give upper and lower bounds showing that the Kolmogorov distance between the spectral measure and the uniform measure on the unit…
We study the induced spherical ensemble of non-Hermitian matrices with real quaternion entries (considering each quaternion as a $2\times 2$ complex matrix). We define the ensemble by the matrix probability distribution function that is…
The aim of this note is to investigate the Kolmogorov distance of the Circular Law to the empirical spectral distribution of non-Hermitian random matrices with independent entries. The optimal rate of convergence is determined by the…
Many models for chaotic systems consist of joining two integrable systems with incompatible constants of motion. The quantum counterparts of such models have a propagator which factorizes into two integrable parts. Each part can be…
Kolmogorov Complexity constitutes an integral part of computability theory, information theory, and computational complexity theory -- in the discrete setting of bits and Turing machines. Over real numbers, on the other hand, the…
In this paper, we systematically study generalized Markov numbers arising from semigroups of reduced integer matrices. This construction allows us to find these numbers by counting perfect matchings of a new family of bipartite graphs,…
Motivated by practical concerns in cryptography, we study pseudorandomness properties of permutations on $\{0,1\}^n$ computed by random circuits made from reversible $3$-bit gates (permutations on $\{0,1\}^3$). Our main result is that a…