Related papers: Asymptotically Pseudo-Independent Matrices
In this paper, we study the asymptotic nonnegative rank of matrices, which characterizes the asymptotic growth of the nonnegative rank of fixed nonnegative matrices under the Kronecker product. This quantity is important since it governs…
We study the Plancherel--Rotach asymptotics of four families of orthogonal polynomials, the Chen--Ismail polynomials, the Berg-Letessier-Valent polynomials, the Conrad--Flajolet polynomials I and II. All these polynomials arise in…
We study asymptotic distributions of large dimensional random matrices of the form $BB^{*}$, where $B$ is a product of $p$ rectangular random matrices, using free probability and combinatorics of colored labeled noncrossing partitions.…
We consider random symmetric matrices with independent entries distributed according to the Haar measure on $\mathbb{Z}_p$ for odd primes $p$ and derive the distribution of their canonical form with respect to several equivalence relations.…
In this paper, we derive high-dimensional asymptotic properties of the Moore-Penrose inverse and, as a byproduct, of various ridge-type inverses of the sample covariance matrix. In particular, the analytical expressions of the asymptotic…
An ensemble of 2 x 2 pseudo-Hermitian random matrices is constructed that possesses real eigenvalues with level-spacing distribution exactly as for the Gaussian Unitary Ensemble found by Wigner. By a re-interpretation of Connes' spectral…
Random graphs have proven to be one of the most important and fruitful concepts in modern Combinatorics and Theoretical Computer Science. Besides being a fascinating study subject for their own sake, they serve as essential instruments in…
The Littlewood--Richardson process is a discrete random point process arising from the isotypic decomposition of tensor products of irreducible representations of $\operatorname{GL}_N(\mathbb{C})$. Biane--Perelomov--Popov matrices are…
We study Hermitian random matrix models with an external source matrix which has equispaced eigenvalues, and with an external field such that the limiting mean density of eigenvalues is supported on a single interval as the dimension tends…
Random integral mappings $I^{h,r}_{(a,b]}$ give isomorphisms between the sub-semigroups of the classical $(ID, \ast)$ and the free-infinite divisible $(ID,\boxplus)$ probability measures. This allows us to introduce new examples of such…
We outline an approach recently used to prove formulae for the multiplicative constants in the asymptotics for the sine-kernel and Airy-kernel determinants appearing in random matrix theory and related areas.
In this paper, we present a new method via the transfer matrix approach to obtain asymptotic formulae of orthogonal polynomials with asymptotically identical coefficients of bounded variation. We make use of the hyperbolicity of the…
We apply round-off to planar rotations, obtaining a one-parameter family of invertible maps of a two-dimensional lattice. As the angle of rotation approaches pi/2, the fourth iterate of the map produces piecewise-rectilinear motion, which…
We study the structure of the asymptotic expansion of the probability that a combinatorial object is connected. We show that the coefficients appearing in those asymptotics are integers and can be interpreted as the counting sequences of…
This paper presents the asymptotic analysis of random lattices in high dimensions to clarify the distance properties of the considered lattices. These properties not only indicate the asymptotic value for the distance between any pair of…
We investigate multiplicative groups consisting entirely of singular alternating sign matrices (ASMs), and present several constructions of such groups. It is shown that every finite group is isomorphic to a group of singular ASMs, with a…
We provide a framework which admits a number of ``marginal'' sequential Monte Carlo (SMC) algorithms as particular cases -- including the marginal particle filter [Klaas et al., 2005, in: Proceedings of Uncertainty in Artificial…
We compute the asymptotic metrics for moduli spaces of SU(N) monopoles with maximal symmetry breaking. These metrics are exponentially close to the exact monopole metric as soon as, for each simple root, the individual monopoles…
Paley graphs and Paley sum graphs are classical examples of quasi-random graphs. In this paper, we provide new constructions of families of quasi-random graphs that behave like Paley graphs but are neither Cayley graphs nor Cayley sum…
In this thesis, we investigate the asymptotics of random partitions chosen according to probability measures coming from the representation theory of the symmetric groups $S_n$ and of the finite Chevalley groups $GL(n,F_q)$ and…