Related papers: Asymptotically Pseudo-Independent Matrices
We introduce a new model for random simplicial complexes which with high probability generates a complex that has a simply-connected double cover. Hence we develop a model for random simplicial complexes with fundamental group…
For any family of $N\times N$ random matrices $(\mathbf{A}_k)_{k\in K}$ which is invariant, in law, under unitary conjugation, we give general sufficient conditions for central limit theorems for random variables of the type…
Analytic combinatorics studies asymptotic properties of families of combinatorial objects using complex analysis on their generating functions. In their reference book on the subject, Flajolet and Sedgewick describe a general approach that…
We present a definition for second-order freeness in the quaternionic case. We demonstrate that this definition on a second-order probability space is asymptotically satisfied by independent symplectically invariant quaternionic matrices.…
Many automatic sequences, such as the Thue-Morse sequence or the Rudin-Shapiro sequence, have some desirable features of pseudorandomness such as a large linear complexity and a small well-distribution measure. However, they also have some…
The asymptotic dimension of metric spaces is an important notion in geometric group theory introduced by Gromov. The metric spaces considered in this paper are the ones whose underlying spaces are the vertex-sets of graphs and whose metrics…
Voiculescu's notion of asymptotic free independence is known for a large class of random matrices including independent unitary invariant matrices. This notion is extended for independent random matrices invariant in law by conjugation by…
The asyptotic number of nonequivalent binary n-codes is determined. This is also the asymptotic number of nonisomorphic binary n-matroids. The connection to a result of Lefmann, Roedl, Phelps is explored. The latter states that almost all…
We establish properties of families of automorphic representations as we vary prescribed supercuspidal representations at a given finite set of primes. For the tame supercuspidals constructed by J.-K. Yu we prove the limit multiplicity…
We study properties of two resampling scenarios: Conditional Randomisation and Conditional Permutation schemes, which are relevant for testing conditional independence of discrete random variables $X$ and $Y$ given a random variable $Z$.…
We introduce a new kind of free independence, called real infinitesimal freeness. We show that independent orthogonally invariant with infinitesimal laws are asymptotically real infinitesimally free. We introduce new cumulants, called real…
We define totally-isotropic polynomials of alternating matrix spaces over finite fields, by analogy with independence polynomials of graphs. Our main result shows that totally-isotropic polynomials of graphical alternating matrix spaces…
Many high-dimensional hypothesis tests aim to globally examine marginal or low-dimensional features of a high-dimensional joint distribution, such as testing of mean vectors, covariance matrices and regression coefficients. This paper…
Given a sequence of real rooted polynomials $\{p_n\}_{n\geq 1}$ with a fixed asymptotic root distribution, we study the asymptotic root distribution of the repeated polar derivatives of this sequence. This limiting distribution can be seen…
Lieanders are special cases of meanders and first appeared in connection with Lie algebras. Using the results from the author with E. Goujard, P. Zograf and A. Zorich, we prove a polynomial asymptotics for the number of lieanders with fixed…
Sample correlation matrices are employed ubiquitously in statistics. However, quite surprisingly, little is known about their asymptotic spectral properties for high-dimensional data, particularly beyond the case of "null models" for which…
We consider graphs that represent pairwise marginal independencies amongst a set of variables (for instance, the zero entries of a covariance matrix for normal data). We characterize the directed acyclic graphs (DAGs) that faithfully…
We prove a conjecture by Brown, Dilcher and Manna on the asymptotic behavior of sparse binomial-type polynomials arising naturally in a graph theoretical context in connection with the expected number of independent sets of a graph.
We completely determine the asymptotic depth, equivalently, the asymptotic projective dimension of a chain of edge ideals that is invariant under the action of the monoid Inc of increasing functions on the positive integers. Our results and…
We provide bivariate asymptotics for the poly-Bernoulli numbers, a combinatorial array that enumerates lonesum matrices, using the methods of Analytic Combinatorics in Several Variables (ACSV). For the diagonal asymptotic (i.e., for the…