Related papers: Trace Formulae and Spectral Statistics for Discret…
This paper presents theory for Normalized Random Measures (NRMs), Normalized Generalized Gammas (NGGs), a particular kind of NRM, and Dependent Hierarchical NRMs which allow networks of dependent NRMs to be analysed. These have been used,…
In this article, we relate the spectrum of the discrete magnetic Laplacian (DML) on a finite simple graph with two structural properties of the graph: the existence of a perfect matching and the existence of a Hamiltonian cycle of the…
In the stochastic network model of Britton and Lindholm [Dynamic random networks in dynamic populations. Journal of Statistical Physics, 2010], the number of individuals evolves according to a supercritical linear birth and death process,…
We consider the limiting behavior of the count of subgraphs isomorphic to a graph $G$ with $m\geq 0$ fixed endpoints (or roots) in the random-connection model, as the intensity $\lambda$ of the underlying Poisson point process tends to…
In the first part of this paper, we survey results that are associated with three types of Laplacian matrices:difference, normalized, and signless. We derive eigenvalue and eigenvector formulaes for paths and cycles using circulant matrices…
The Poisson distribution arises naturally when dealing with data involving counts, and it has found many applications in inverse problems and imaging. In this work, we develop an approximate Bayesian inference technique based on expectation…
We study the spectral statistics for extended yet finite quasi 1-d systems which undergo a transition from periodicity to disorder. In particular we compute the spectral two-point form factor, and the resulting expression depends on the…
For a large class of quantum systems the statistical properties of their spectrum show remarkable agreement with random matrix predictions. Recent advances show that the scope of random matrix theory is much wider. In this work, we show…
The statistical properties of a Hamiltonian $H_0$ perturbed by a localized scatterer are considered. We prove that when $H_0$ describes a bounded chaotic motion, the universal part of the spectral statistics are not changed by the…
In an era of unprecedented deluge of (mostly unstructured) data, graphs are proving more and more useful, across the sciences, as a flexible abstraction to capture complex relationships between complex objects. One of the main challenges…
We define natural probability measures on cycle-rooted spanning forests (CRSFs) on graphs embedded on a surface with a Riemannian metric. These measures arise from the Laplacian determinant and depend on the choice of a unitary connection…
The random connection model is a random graph whose vertices are given by the points of a Poisson process and whose edges are obtained by randomly connecting pairs of Poisson points in a position dependent but independent way. We study…
Large unweighted directed graphs are commonly used to capture relations between entities. A fundamental problem in the analysis of such networks is to properly define the similarity or dissimilarity between any two vertices. Despite the…
Motivated by questions of present interest in nuclear and condensed matter physics we consider the superposition of a diagonal matrix with independent random entries and a GUE. The relative strength of the two contributions is determined by…
A general analytical approach to the statistical description of quantum graph spectra based on the exact periodic orbit expansions of quantum levels is discussed. The exact and approximate expressions obtained in \cite{Anima} for the…
For chaotic scattering on quantum graphs, the semiclassical approximation is exact. We use this fact and employ supersymmetry, the colour-flavour transformation, and the saddle-point approximation to calculate the exact expression for the…
We study complex networks under random matrix theory (RMT) framework. Using nearest-neighbor and next-nearest-neighbor spacing distributions we analyze the eigenvalues of adjacency matrix of various model networks, namely, random,…
The classical matrix-tree theorem relates the determinant of the combinatorial Laplacian on a graph to the number of spanning trees. We generalize this result to Laplacians on one- and two-dimensional vector bundles, giving a combinatorial…
We investigate the spontaneous parity-time (PT )-symmetry breaking and spectral properties of a PT symmetric quantum kicked rotor under resonance conditions. At resonance, the QKR reduces to a finite-dimensional system. In the localized…
Many regular graphs admit a natural partition of their edge set into cliques of the same order such that each vertex is contained in the same number of cliques. In this paper, we study the mixing rate of certain random walks on such graphs…