相关论文: The Canopy Graph and Level Statistics for Random O…

We analyze a class of spatial random spanning trees built on a realization of a homogeneous Poisson point process of the plane. This tree has a simple radial structure with the origin as its root. We first use stochastic geometry arguments…

Consider a random regular graph of fixed degree $d$ with $n$ vertices. We study spectral properties of the adjacency matrix and of random Schr\"odinger operators on such a graph as $n$ tends to infinity. We prove that the integrated density…

We investigate the bottom of the spectra of infinite quantum graphs, i.e., Laplace operators on metric graphs having infinitely many edges and vertices. We introduce a new definition of the isoperimetric constant for quantum graphs and then…

In this article we investigate the spectral properties of the infinitesimal generator of an infinite system of master equations arising in the analysis of the approach to equilibrium in statistical mechanics. The system under investigation…

In this paper we investigate the eigenvalue statistics of exponentially weighted ensembles of full binary trees and $p$-branching star graphs. We show that spectral densities of corresponding adjacency matrices demonstrate peculiar…

Consider the d-dimensional lattice Z^d where each vertex is ``open'' or ``closed'' with probability p or 1-p, respectively. An open vertex v is connected by an edge to the closest open vertex w such that the dth co-ordinates of v and w…

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…

We analyze the eigenvalues of the adjacency matrices of a wide variety of random trees. Using general, broadly applicable arguments based on the interlacing inequalities for the eigenvalues of a principal submatrix of a Hermitian matrix and…

We give new general formulas for the asymptotics of the number of spanning trees of a large graph. A special case answers a question of McKay (1983) for regular graphs. The general answer involves a quantity for infinite graphs that we call…

We survey results concerning the spectral properties of limit-periodic operators. The main focus is on discrete one-dimensional Schr\"odinger operators, but other classes of operators, such as Jacobi and CMV matrices, continuum…

We analyze a class of parametrized Random Matrix models, introduced by Rosenzweig and Porter, which is expected to describe the energy level statistics of quantum systems whose classical dynamics varies from regular to chaotic as a function…

Degree distribution, or equivalently called degree sequence, has been commonly used to be one of most significant measures for studying a large number of complex networks with which some well-known results have been obtained. By contrast,…

In recent work on equiangular lines, Jiang, Tidor, Yuan, Zhang, and Zhao showed that a connected bounded degree graph has sublinear second eigenvalue multiplicity. More generally they show that there cannot be too many eigenvalues near the…

Directed covers of finite graphs are also known as periodic trees or trees with finitely many cone types. We expand the existing theory of directed covers of finite graphs to those of infinite graphs. While the lower growth rate still…

Measuring the complexity of tree structures can be beneficial in areas that use tree data structures for storage, communication, and processing purposes. This complexity can then be used to compress tree data structures to their…

In 1986, Janson showed that the number of edges in the union of $k$ random spanning trees in the complete graph $K_n$ is a shifted Poisson distribution. Using results from the theory of electrical networks, we provide a new proof of this…

Random walks on a graph reflect many of its topological and spectral properties, such as connectedness, bipartiteness and spectral gap magnitude. In the first part of this paper we define a stochastic process on simplicial complexes of…

In this article, we define discrete analogue of generalized Hardy spaces and its separable subspace on a homogenous rooted tree and study some of its properties such as completeness, inclusion relations with other spaces, separability,…

The authors study the spectral theory of self-adjoint operators that are subject to certain types of perturbations. An iterative introduction of infinitely many randomly coupled rank-one perturbations is one of our settings. Spectral…

The number of self-adjoint extensions of a symmetric operator acting on a complex Hilbert space is characterized by its deficiency indices. Given a locally finite unoriented simple tree, we prove that the deficiency indices of any discrete…