相关论文: How to generate random matrices from the classical…

Treating neural network inputs and outputs as random variables, we characterize the structure of neural networks that can be used to model data that are invariant or equivariant under the action of a compact group. Much recent research has…

This paper presents some first results on how to perform uniform random walks (where every trace has the same probability to occur) in very large models. The models considered here are described in a succinct way as a set of communicating…

Using the Generalized Maximium Entropy Principle based on the nonextensive q entropy a new family of random matrix ensembles is generated. This family unifies previous extensions of Random Matrix Theory and gives rise to an orthogonal…

In this article, we provide three generators of propositional formulae for arbitrary languages, which uniformly sample three different formulae spaces. They take the same three parameters as input, namely, a desired depth, a set of atomics…

We investigate the spectral properties of the product of $M$ complex non-Hermitian random matrices that are obtained by removing $L$ rows and columns of larger unitary random matrices uniformly distributed on the group ${\rm U}(N+L)$. Such…

The distribution of products of random matrices chosen from fixed spherical classes is determined for classical rank 1 symmetric spaces. It is observed that $n\to\infty$ limit behaves approximately as in the abelian case. A theorem on the…

It is known that a unitary matrix can be decomposed into a product of reflections, one for each dimension, and the Haar measure on the unitary group pushes forward to independent uniform measures on the reflections. We consider the sequence…

This paper defines and develops cycle indices for the finite classical groups. These tools are then applied to study properties of a random matrix chosen uniformly from one of these groups. Properties studied by this technique will include…

Recently much effort has been made towards the introduction of non-Hermitian random matrix models respecting $PT$-symmetry. Here we show that there is a one-to-one correspondence between complex $PT$-symmetric matrices and split-complex and…

In this talk we go over several new developments regarding the techniques for a large class of non-hermitian matrix models with unitary randomness (complex random numbers). In particular, we discuss: (a) - A diagrammatic approach based on a…

All coboundary Lie bialgebras and their corresponding Poisson--Lie structures are constructed for the oscillator algebra generated by $\{\aa,\ap,\am,\bb\}$. Quantum oscillator algebras are derived from these bialgebras by using the…

Multipartite quantum scenarios are a significant and challenging resource in quantum information science. Tensors provide a powerful framework for representing multipartite quantum systems. In this work, we introduce the role of…

The random matrix ensembles (RME), especially Gaussian RME and Ginibre RME, are applied to nuclear systems, molecular systems, and two-dimensional electron systems (Wigner-Dyson electrostatic analogy). Measures of quantum chaos and quantum…

We first obtain explicit upper bounds for the proportion of elements in a finite classical group G with a given characteristic polynomial. We use this to complete the proof that the proportion of elements of a finite classical group G which…

Cohn and Umans proposed a framework for developing fast matrix multiplication algorithms based on the embedding computation in certain groups algebras. In subsequent work with Kleinberg and Szegedy, they connected this to the search for…

From the standard procedure for constructing Feynman vacuum graphs in $\phi^4$ theory from the generating functional $Z$, we find a relation with sets of certain combinatorial matrices, which allows us to generate the set of all Feynman…

Uhlenbeck proved that a set of simple elements generates the group of rational loops in GL(n,C) that satisfy the U(n)-reality condition. For an arbitrary complex reductive group, a choice of representation defines a notion of rationality…

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 are interested in random uniform minimal factorizations of the $n$-cycle which are factorizations of $(1~2\dots n)$ into a product of $n-1$ transpositions. Our main result is an explicit formula for the joint probability that 1 and 2…

We describe a straightforward method to generate a random prime q such that the multiplicative group GF(q)* also has a random large prime-order subgroup. The described algorithm also yields this order p as well as a p'th primitive root of…