Related papers: Asymptotically Pseudo-Independent Matrices
We introduce a theory of probability in $\lambda$-rings designed to efficiently describe random variables valued in multisets of complex numbers, varieties over a field, or other similar enriched settings. A key role is played by the…
We introduce a new class of large structured random matrices characterized by four fundamental properties which we discuss. We prove that this class is stable under matrix-valued and pointwise non-linear operations. We then formulate an…
Solitons in one-dimensional parity-time (PT)-symmetric periodic potentials are studied using exponential asymptotics. The new feature of this exponential asymptotics is that, unlike conservative periodic potentials, the inner and outer…
In their paper, "A new application of random matrices: Ext(C*_red(F_2)) is not a group", Haagerup and Thorbjornsen prove an extension of Voiculescu's random matrix model for independent complex self-adjoint Gaussian random matrices. We…
In this paper we introduce and investigate a one-parameter family of polynomials. They are semisymmetric, i.e. symmetric in the variables with odd and even index separately. In fact, the family forms a basis of the space of semisymmetric…
We study limit distributions of independent random matrices as well as limit joint distributions of their blocks under normalized partial traces composed with classical expectation. In particular, we are concerned with the ensemble of…
We consider random trigonometric polynomials with general dependent coefficients. We show that under mild hypotheses on the structure of dependence, the asymptotics as the degree goes to infinity of the expected number of real zeros…
A strongly regular graph is called trivial if it or its complement is a union of disjoint cliques. We prove that every infinite family of nontrivial strongly regular graphs is quasi-random in the sense of Chung, Graham and Wilson.
In this paper, we study random matrix models which are obtained as a non-commutative polynomial in random matrix variables of two kinds: (a) a first kind which have a discrete spectrum in the limit, (b) a second kind which have a joint…
We investigate the asymptotics of eigenvalues of sample covariance matrices associated with a class of non-independent Gaussian processes (separable and temporally stationary) under the Kolmogorov asymptotic regime. The limiting spectral…
We formulate a new criterion of the asymptotic stability for some non-equicontinuous Markov semigroups, the so-called eventually continuous semigroups. In particular, we provide a non-equicontinuous Markov semigroup example with essential…
Random matrix theory has played a major role in several areas of pure and applied mathematics, as well as statistics, physics, and computer science. This lecture aims to describe the intrinsic freeness phenomenon and how it provides new…
A random phase property is proposed for products of random matrices drawn from any one of the classical groups associated with the ten Cartan symmetry classes of non-interacting disordered Fermion systems. It allows to calculate the…
In this paper we construct the new coefficient which allows to measure quantitatively the independence of the two discrete random variables. The new inequalities for the matrices with non-negative elements are found
An approach to generate the pseudorandom-bit sequence from the asymptotic deterministic randomness system is proposed in this Letter. We study the characteristic of multi-value correspondence of the asymptotic deterministic randomness…
We consider the asymptotic joint distributions among several families of well-known metrics on $S_n$, the symmetric group. These include the bi-invariant metrics such as the Cayley and Hamming distance, and the left-invariant metrics such…
Motivated by pseudo-Gorenstein rings in commutative algebra, introduced by Herzog et al., we define pseudo-Gorenstein$^{*}$ graphs and classify them in several natural graph families using independence polynomials.
We characterize compatible families of real-rooted polynomials, allowing both positive and negative leading coefficients. Our characterization naturally generalizes the same-sign characterization used by Chudnovsky and Seymour in their…
For a sufficiently nice 2 dimensional shape, we define its approximating matrix (or patterned matrix) as a random matrix with iid entries arranged according to a given pattern. For large approximating matrices, we observe that the…
Let $M_n = (\xi_{ij})_{1 \leq i,j \leq n}$ be a real symmetric random matrix in which the upper-triangular entries $\xi_{ij}, i<j$ and diagonal entries $\xi_{ii}$ are independent. We show that with probability tending to 1, $M_n$ has no…