Related papers: Volume Growth, Spectrum and Stochastic Completenes…
We examine diagonal combs, a recently identified class of infinite metric graphs whose properties depend on one parameter. These graphs exhibit a fascinating regime where they possess infinite volume while maintaining purely discrete…
This paper is devoted to the investigation of the spectral theory and dynamical properties of periodic graphs which are not locally finite but carry non-negative, symmetric and summable edge weights. These graphs are shown to exhibit rather…
We show that the set of locally finite Borel graphs with finite Borel asymptotic dimension is $\mathbf{\Sigma}^1_2$-complete. The result is based on a combinatorial characterization of finite Borel asymptotic dimension for graphs generated…
It is well-known that a stochastic differential equation (SDE) on a Euclidean space driven by a Brownian motion with Lipschitz coefficients generates a stochastic flow of homeomorphisms. When the coefficients are only locally Lipschitz,…
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.…
We considered the Edwards-Wilkinson model on a small-world network. We studied the finite-size behavior of the surface width by performing exact numerical diagonalization for the underlying coupling matrix. We found that the spectrum…
We study harmonic measure in finite graphs with an emphasis on expanders, that is, positive spectral gap. It is shown that if the spectral gap is positive then for all sets that are not too large the harmonic measure from a uniform starting…
The asymptotic shape of randomly growing radial clusters is studied. We pose the problem in terms of the dynamics of stochastic partial differential equations. We concentrate on the properties of the realizations of the stochastic growth…
We study the connection between the dimension of certain spaces of harmonic functions on a group and its geometric and algebraic properties. Our main result shows that (for sufficiently "nice" random walk measures) a connected, compactly…
In a previous paper Hua-Jost-Liu, we have applied Alexandrov geometry methods to study infinite semiplanar graphs with nonnegative combinatorial curvature. We proved the weak relative volume comparison and the Poincar\'e inequality on these…
We study the symmetry classes of graphene quantum dots, both open and closed, through the conductance and energy level statistics. For abrupt termination of the lattice, these properties are well described by the standard orthogonal and…
We study the interplay between spectrum, geometry and boundary conditions for two distinguished self-adjoint realisations of the Laplacian on infinite metric graphs, the so-called riedrichs and Neumann extensions. We introduce a new…
We show that an entire branched cover of finite distortion cannot have a compact branch set if its distortion satisfies a certain asymptotic growth condition. We furthermore show that this bound is strict by constructing an entire,…
The metric dimension of non-component graph, associated to a finite vector space, is determined. It is proved that the exchange property holds for resolving sets of the graph, except a special case. Some results are also related to an…
Partial vertex cover and partial dominating set are two well-investigated optimization problems. While they are $\rm W[1]$-hard on general graphs, they have been shown to be fixed-parameter tractable on many sparse graph classes, including…
The properties of scale-free random trees are investigated using both preconditioning on non-extinction and fixed size averages, in order to study the thermodynamic limit. The scaling form of volume probability is found, the connectivity…
We characterize the spectrum of the Laplacian of graphs composed of one or two finite or infinite chains connected to a complete graph. We show the existence of localized eigenvectors of two types, eigenvectors that vanish exactly outside…
In this paper we study the spectral gap of the path graph and illustrate an interesting effect which has been described recently in the continuous setting. More explicitly, in the large-volume limit and in the presence of a certain external…
A necessary and sufficient condition is presented for a graph algebra to satisfy a bracketing identity. The associative spectrum of an arbitrary graph algebra is shown to be either constant or exponentially growing.
For various purposes and, in particular, in the context of data compression, a graph can be examined at three levels. Its structure can be described as the unlabeled version of the graph; then the labeling of its structure can be added; and…