相关论文: A Note on Mixed Matrix Moments for the Complex Gin…
Gibbs sampling on factor graphs is a widely used inference technique, which often produces good empirical results. Theoretical guarantees for its performance are weak: even for tree structured graphs, the mixing time of Gibbs may be…
Glauber dynamics is a powerful tool to generate randomized, approximate solutions to combinatorially difficult problems. Applications include Markov Chain Monte Carlo (MCMC) simulation and distributed scheduling for wireless networks. In…
This is part II of a review relating to the three classes of random non-Hermitian Gaussian matrices introduced by Ginibre in 1965. While part I restricted attention to the GinUE (Ginibre unitary ensemble) case of complex elements, in this…
The purpose of this paper is to introduce the notion of mixed twistor structure, a generalization of the notion of mixed Hodge structure. The utility of this notion is to make possible a theory of weights for various things surrounding…
In this paper we outline a Matrix Ansatz approach to some problems of combinatorial enumeration. The idea is that many interesting quantities can be expressed in terms of products of matrices, where the matrices obey certain relations. We…
We examine the asymptotics of the moments of characteristic polynomials of $N\times N$ matrices drawn from the Hermitian ensembles of Random Matrix Theory, in the limit as $N\to\infty$. We focus in particular on the Gaussian Unitary…
We present a unifying framework for generating extended formulations for the polyhedral outer approximations used in algorithms for mixed-integer convex programming (MICP). Extended formulations lead to fewer iterations of outer…
We study the images of the complex Ginibre eigenvalues under the power maps $\pi_M: z \mapsto z^M$, for any integer $M$. We establish the following equality in distribution, $$ {\rm{Gin}}(N)^M \stackrel{d}{=} \bigcup_{k=1}^M {\rm{Gin}}…
From transportation networks to complex infrastructures, and to social and communication networks, a large variety of systems can be described in terms of multiplexes formed by a set of nodes interacting through different networks (layers).…
Given an associative multiplication in matrix algebra compatible with the usual one or, in other words, linear deformation of matrix algebra, we construct a solution to the classical Yang-Baxter equation. We also develop a theory of such…
The paper is concerned with the asymptotic behavior of the correlation functions of the characteristic polynomials of non-Hermitian random matrices with independent entries. It is shown that the correlation functions behave like that for…
We establish formulae for the moments of the moments of the characteristic polynomials of random orthogonal and symplectic matrices in terms of certain lattice point count problems. This allows us to establish asymptotic formulae when the…
Systems where time evolution follows a multiplicative process are ubiquitous in physics. We study a toy model for such systems where each time step is given by multiplication with an independent random $N\times N$ matrix with complex…
In this paper, we establish an explicit isomorphism between the symmetric group algebra and the path algebra of the Young graph. Specifically, we construct a family of matrix units in the group algebra. As a main application of this…
We establish asymptotic formulae for general joint moments of characteristic polynomials and their higher-order derivatives associated with matrices drawn randomly from the groups $\mathrm{USp}(2N)$ and $\mathrm{SO}(2N)$ in the limit as…
We compute an asymptotic formula for the mixed second moment of the $\mu$-th and $\nu$-th derivatives of quadratic Dirichlet $L$-functions over monic, irreducible polynomials in the function field setting.
We introduce the "moment rank" and "unitary rank" of numerical sequences, close relatives of linear-recursive order. We show that both parameters can be characterized by a broad set of criteria involving moments of measures, types of…
We consider adjustable robust linear complementarity problems and extend the results of Biefel et al. (2022) towards convex and compact uncertainty sets. Moreover, for the case of polyhedral uncertainty sets, we prove that computing an…
The elliptic Ginibre ensemble of complex non-Hermitian random matrices allows to interpolate between the rotational invariant Ginibre ensemble and the Gaussian unitary ensemble of Hermitian random matrices. It corresponds to a…
The complex elliptic Ginibre ensemble with coupling $\tau$ is a complex Gaussian matrix interpolating between the Gaussian Unitary Ensemble (GUE) and the Ginibre ensemble. It has been known for some time that its eigenvalues form a…