Results 21 to 30 of about 797,910 (276)
Rooted trees and moments of large sparse random matrices [PDF]
In these expository paper we describe the role of the rooted trees as a base for convenient tools in studies ofrandom matrices. Regarding the Wigner ensemble of random matrices, we represent main ingredients ofthis approach.
Oleksiy Khorunzhiy
doaj +1 more source
Free random Lévy matrices [PDF]
Using the theory of free random variables (FRV) and the Coulomb gas analogy, we construct stable random matrix ensembles that are random matrix generalizations of the classical one-dimensional stable L vy distributions. We show that the resolvents for the corresponding matrices obey transcendental equations in the large size limit.
Burda, Z. +5 more
openaire +3 more sources
Sparse random block matrices [PDF]
Abstract The spectral moments of ensembles of sparse random block matrices are analytically evaluated in the limit of large order. The structure of the sparse matrix corresponds to the Erdös–Renyi random graph. The blocks are i.i.d. random matrices of the classical ensembles GOE or GUE. The moments are evaluated for finite or infinite
Giovanni M Cicuta, Mario Pernici
openaire +3 more sources
Stochastic differential equations for random matrices processes in the nonlinear framework [PDF]
In this paper, we investigate the processes of eigenvalues and eigenvectors of a symmetric matrix valued process \(X_{t}\), where \(X_{t}\) is the solution of a general SDE driven by a \(G\)-Brownian motion matrix.
Sara Stihi +2 more
doaj +1 more source
Exploring Transition from Stability to Chaos through Random Matrices
This study explores the application of random matrices to track chaotic dynamics within the Chirikov standard map. Our findings highlight the potential of matrices exhibiting Wishart-like characteristics, combined with statistical insights from their ...
Roberto da Silva, Sandra Denise Prado
doaj +1 more source
Randomized Simplicial Hessian Update
Recently, a derivative-free optimization algorithm was proposed that utilizes a minimum Frobenius norm (MFN) Hessian update for estimating the second derivative information, which in turn is used for accelerating the search.
Árpád Bűrmen +2 more
doaj +1 more source
Chaos, complexity, and random matrices
Chaos and complexity entail an entropic and computational obstruction to describing a system, and thus are intrinsically difficult to characterize. In this paper, we consider time evolution by Gaussian Unitary Ensemble (GUE) Hamiltonians and analytically
Jordan Cotler +3 more
doaj +1 more source
Random matrices, random polynomials and Coulomb systems [PDF]
It is well known that the joint probability density of the eigenvalues of Gaussian ensembles of random matrices may be interpreted as a Coulomb gas.
Leboeuf, P.
core +2 more sources
Hearing random matrices and random waves
The eigenangles of random matrices in the three standard circular ensembles are rendered as sounds in several different ways. The different fluctuation properties of these ensembles can be heard, and distinguished from the two extreme cases, of angles ...
M V Berry, Pragya Shukla
doaj +1 more source
Relating Entropies of Quantum Channels
In this work, we study two different approaches to defining the entropy of a quantum channel. One of these is based on the von Neumann entropy of the corresponding Choi–Jamiołkowski state.
Dariusz Kurzyk +2 more
doaj +1 more source

