Related papers: Random matrix ensembles: Wang-Landau algorithm for…
We present an algorithm for the calculation of eigenstates with definite linear momentum in quantum lattices. Our method is related to the Density Matrix Renormalization Group, and makes use of the distribution of multipartite entanglement…
Statistical properties of ensembles of random density matrices are investigated. We compute traces and von Neumann entropies averaged over ensembles of random density matrices distributed according to the Bures measure. The eigenvalues of…
We derive the spectral properties of adjacency matrix of complex networks and of their Laplacian by the replica method combined with a dynamical population algorithm. By assuming the order parameter to be a product of Gaussian…
Thevon Neumann entropy, named after John von Neumann, is an extension of the classical concept of entropy to the field of quantum mechanics. From a numerical perspective, von Neumann entropy can be computed simply by computing all…
We introduce two methods for estimating the density matrix for a quantum system: Quantum Maximum Likelihood and Quantum Variational Inference. In these methods, we construct a variational family to model the density matrix of a mixed…
We apply the recently developed critical minimum energy subspace scheme for the investigation of the random-field Ising model. We point out that this method is well suited for the study of this model. The density of states is obtained via…
We apply random matrix theory to derive spectral density of large sample covariance matrices generated by multivariate VMA(q), VAR(q) and VARMA(q1,q2) processes. In particular, we consider a limit where the number of random variables N and…
A method to generate new classes of random matrix ensembles is proposed. Random matrices from these ensembles are Lax matrices of classically integrable systems with a certain distribution of momenta and coordinates. The existence of an…
Evaluation of global thermodynamic properties, such as the entropy or the free energy, of complex systems featuring a high degree of frustration or disorder is often desirable. Nevertheless, they cannot be measured directly in standard…
A simple modification of the ``Wang-Landau sampling'' algorithm removes the systematic error that occurs at the boundary of the range of energy over which the random walk takes place in the original algorithm.
By combining two generalized-ensemble algorithms, Replica-Exchange Wang-Landau (REWL) method and Multicanonical Replica-Exchange Method (MUCAREM), we propose an effective simulation protocol to determine the density of states with high…
We study a class of random matrices arising from the Lax matrix structure of classical integrable systems, particularly the Calogero family of models. Our focus is the density of eigenvalues for these random matrices. The problem can be…
We introduce a rejection-free, flat histogram, cluster algorithm to determine the density of states of hard-core lattice gases. We show that the algorithm is able to efficiently sample low entropy states that are usually difficult to…
We derive exact results for gap probabilities, as well as densities of extreme eigenvalues for six complex random matrix ensembles of fundamental importance. These are Gauss-Wigner, Laguerre-Wishart, Cauchy-Lorentz (two variants),…
We give a constructive proof for the superbosonization formula for invariant random matrix ensembles, which is the supersymmetry analog of the theory of Wishart matrices. Formulas are given for unitary, orthogonal and symplectic symmetry,…
We survey recent mathematical results about the spectrum of random band matrices. We start by exposing the Erd{\H o}s-Schlein-Yau dynamic approach, its application to Wigner matrices, and extension to other mean-field models. We then…
The 1/t Wang-Landau algorithm is analyzed from the viewpoint of execution time and accuracy when it is used in computations of the density of states of a two-dimensional Ising model. We find that the simulation results have a systematic…
In this communication, the convergence of the 1/t and Wang - Landau algorithms in the calculation of multidimensional numerical integrals is analyzed. Both simulation methods are applied to a wide variety of integrals without restrictions…
We propose a flat-histogram Monte Carlo method to efficiently sample fractal landscapes such as escape time functions of open chaotic systems. This is achieved by using a random-walk step which depends on the height of the landscape via the…
Random feature maps are ubiquitous in modern statistical machine learning, where they generalize random projections by means of powerful, yet often difficult to analyze nonlinear operators. In this paper, we leverage the "concentration"…