相关论文: Superbosonization
If supersymmetric particles are discovered, an important problem will be to determine how supersymmetry has been broken. At collider energies, supersymmetry breaking can be parameterised by soft supersymmetry breaking parameters. Several…
This is the extended version of a survey prepared for publication in the Springer INdAM series. Superbosonisation, introduced by Littelmann-Sommers-Zirnbauer, is a generalisation of bosonisation, with applications in Random Matrix Theory…
We consider asymptotics of ratios of random characteristic polynomials associated with orthogonal polynomial ensembles. Under some natural conditions on the measure in the definition of the orthogonal polynomial ensemble we establish a…
For random matrices with block correlation structure we show that the fluctuations of linear eigenvalue statistics are Gaussian on all mesoscopic scales with universal variance which coincides with that of the Gaussian unitary or Gaussian…
This paper establishes a comparison theorem for the maximum eigenvalue of a sum of independent random symmetric matrices. The theorem states that the maximum eigenvalue of the matrix sum is dominated by the maximum eigenvalue of a Gaussian…
Consider a doubly-infinite array of iid centered variables with moment conditions, from which one can extract a finite number of rectangular, overlapping submatrices, and form the corresponding Wishart matrices. We show that under basic…
Theoretical analysis of biological and artificial neural networks e.g. modelling of synaptic or weight matrices necessitate consideration of the generic real-asymmetric matrix ensembles, those with varying order of matrix elements e.g. a…
We give a proof of the Universality Conjecture for orthogonal (beta=1) and symplectic (beta=4) random matrix ensembles of Laguerre-type in the bulk of the spectrum as well as at the hard and soft spectral edges. Our results are stated…
A method is described to probe high-scale physics in lower-energy experiments by employing sum rules in terms of renormalisation group invariants. The method is worked out in detail for the study of supersymmetry-breaking mechanisms in the…
We construct rather general random ensembles that yield the optimal (isomorphic) estimate in the Dvoretzky-Milman Theorem. This is the first construction of non gaussian/spherical ensembles that exhibit the optimal behaviour. The ensembles…
We construct a very general family of characteristic functions describing Random Matrix Ensembles (RME) having a global unitary invariance, and containing an arbitrary, one-variable probability measure which we characterize by a `spread…
We give a generalization of the random matrix ensembles, including all lassical ensembles. Then we derive the joint density function of the generalized ensemble by one simple formula, which give a direct and unified way to compute the…
We show that a dynamical supersymmetry can appear in a purely fermionic system. This ``supersymmetry without bosons" is constructed by application of a recently introduced boson-fermion Dyson mapping from a fermion space to a space…
Simulations of supersymmetric field theories with spontaneously broken supersymmetry require in addition to the ultraviolet regularisation also an infrared one, due to the emergence of the massless Goldstino. The intricate interplay between…
The Wigner-Gaudin-Mehta-Dyson conjecture asserts that the local eigenvalue statistics of large random matrices exhibit universal behavior depending only on the symmetry class of the matrix ensemble. For invariant matrix models, the…
A superposition of a matrix ensemble refers to the ensemble constructed from two independent copies of the original, while a decimation refers to the formation of a new ensemble by observing only every second eigenvalue. In the cases of the…
We obtain general, exact formulas for the overlaps between the eigenvectors of large correlated random matrices, with additive or multiplicative noise. These results have potential applications in many different contexts, from quantum…
We introduce the notion of Bartlett spectral measure for isometrically invariant random measures on proper metric commutative spaces. When the underlying Gelfand pair corresponds to a higher-rank, connected, simple matrix Lie group with…
Universality of eigenvalue spacings is one of the basic characteristics of random matrices. We give the precise meaning of universality and discuss the standard universality classes (sine, Airy, Bessel) and their appearance in unitary,…
We propose a method based on the Wang-Landau algorithm to numerically generate the spectral densities of random matrix ensembles. The method employs Dyson's log-gas formalism for random matrix eigenvalues and also enables one to…