Related papers: Component Spectrum of Large Sparse Uniformly Rando…
We prove a generalization of the Expander Mixing Lemma for arbitrary (finite) simplicial complexes. The original lemma states that concentration of the Laplace spectrum of a graph implies combinatorial expansion (which is also referred to…
We consider the ensemble of N-dimensional random symmetric matrices A that have, in average, p non-zero elements per row. We study the asymptotic behavior of the norm of A in the limit of infinitely increasing N and p. We prove that the…
In this paper, we study the structure of the complete asymptotic expansion of the probability that a large combinatorial object is connected or consists of a given number of connected components. For rapidly growing labeled families of…
This paper is devoted to the structure of the complete asymptotic expansion of the probability that a large combinatorial object is irreducible or consists of a given number of irreducible parts, where irreducibility is understood in terms…
We consider vertex partitions of the binomial random graph $G_{n,p}$. For $np\to\infty$, we observe the following phenomenon: in any partition into asymptotically fewer than $\chi(G_{n,p})$ parts, i.e. $o(np/\log np)$ parts, one part must…
Triggered by a controversy surrounding a universal behaviour of the power spectrum in quantum systems exhibiting regular classical dynamics, we focus on a model of random diagonal matrices (RDM), often associated with the Poisson spectral…
We study the asymptotics of large, moderate and normal deviations for the connected components of the sparse random graph by the method of stochastic processes. We obtain the logarithmic asymptotics of large deviations of the joint…
We consider uniformly random set partitions of size $n$ with exactly $k$ blocks, and uniformly random permutations of size $n$ with exactly $k$ cycles, under the regime where $n-k \sim t\sqrt{n}$, $t>0$. In this regime, there is a simple…
We compute spectra of symmetric random matrices defined on graphs exhibiting a modular structure. Modules are initially introduced as fully connected sub-units of a graph. By contrast, inter-module connectivity is taken to be incomplete.…
In this paper we study the component structure of random graphs with independence between the edges. Under mild assumptions, we determine whether there is a giant component, and find its asymptotic size when it exists. We assume that the…
We introduce two new heuristic ideas concerning the spectrum of a Laplacian, and we give theorems and conjectures from the realms of manifolds, graphs and fractals that validate these heuristics. The first heuristic concerns Laplacians that…
Using methods from random matrix theory researchers have recently calculated the full spectra of random networks with arbitrary degrees and with community structure. Both reveal interesting spectral features, including deviations from the…
We determine the true asymptotic behaviour for the expected number of connected components for a model of random lemniscates proposed recently by Lerario and Lundberg. These are defined as the subsets of the Riemann sphere, where the…
We numerically analyze the spectral statistics of the multiparametric Gaussian ensembles of complex matrices with zero mean and variances with different decay routes away from the diagonals. As the latter mimics different degree of…
We study the effect of gradual symmetry breaking in a non-integrable system on the level fluctuation statistics. We consider the case when the symmetry is represented by a quantum number that takes one of two possible values, so that the…
Two models of a random digraph on $n$ vertices, $D(n,\text{Prob}(\text{arc})=p)$ and $D(n,\text{number of arcs}=m)$ are studied. In 1990, Karp for $D(n,p)$ and independently T. \L uczak for $D(n,m=cn)$ proved that for $c>1$, with…
We consider random graphs with a given degree sequence and show, under weak technical conditions, asymptotic normality of the number of components isomorphic to a given tree, first for the random multigraph given by the configuration model…
We study the richness of the ensemble of graphical structures (i.e., unlabeled graphs) of the one-dimensional random geometric graph model defined by $n$ nodes randomly scattered in $[0,1]$ that connect if they are within the connection…
We show that the variance of the number of connected components of the zero set of the two-dimensional Gaussian ensemble of random spherical harmonics of degree n grows as a positive power of n. The proof uses no special properties of…
We study the number of chords and the number of crossings in the largest component of a random chord diagram when the chords are sparsely crossing. This is equivalent to studying the number of vertices and the number of edges in the largest…