Using an extension of Wright's version of the circle method, we obtain asymptotic formulae for partition ranks similar to formulae for partition cranks which where conjectured by F. Dyson and recently proved by the first author and K. Bringmann.
Motivated by the Watts-Strogatz model for a complex network, we introduce a generalization of the Erdős-Rényi random graph. We derive a combinatorial formula for the moment sequence of its spectral distribution in the sparse limit.
Two new examples are given for illustrating the method of quantum decomposition in the asymptotic spectral analysis for a growing family of graphs. The odd graphs form a growing family of distance-regular graphs and the two-sided Rayleigh distribution appears in the limit of vacuum spectral distribution of the adjacency matrix. For a spidernet as well as for a growing family of spidernets the vacuum distribution of the adjacency matrix is the free Meixner law. These distributions are calculated...
We derive the asymptotic spectral distribution of the distance k-graph of N-dimensional hypercube as N → ∞.
Let G be a finite connected graph on two or more vertices, and the distance-k graph of the N-fold Cartesian power of G. For a fixed k ≥ 1, we obtain explicitly the large N limit of the spectral distribution (the eigenvalue distribution of the adjacency matrix) of . The limit distribution is described in terms of the Hermite polynomials. The proof is based on asymptotic combinatorics along with quantum probability theory.
We establish necessary and sufficient conditions for the convergence (in the sense of finite dimensional distributions) of multiplicative measures on the set of partitions. The multiplicative measures depict distributions of component spectra of random structures and also the equilibria of classic models of statistical mechanics and stochastic processes of coagulation-fragmentation. We show that the convergence of multiplicative measures is equivalent to the asymptotic independence of counts of...