Related papers: Isospectral Reduction in Infinite Graphs

We introduce the notion of Benjamini-Schramm convergence for quantum graphs. This notion of convergence, intended to play the role of the already existing notion for discrete graphs, means that the restriction of the quantum graph to a…

Color refinement is a classical technique used to show that two given graphs G and H are non-isomorphic; it is very efficient, although it does not succeed on all graphs. We call a graph G amenable to color refinement if it succeeds in…

In this note, we show that locally finite quasi-transitive graphs are quasi-isometric to trees if and only if every other locally finite quasi-transitive graph quasi-isometric to them is minor excluded. This generalizes results by…

Drawing on some recent results that provide the formalism necessary to definite stationarity for infinite random graphs, this paper initiates the study of statistical and learning questions pertaining to these objects. Specifically, a…

We extend an example of B. Aupetit, which illustrates spectral discontinuity for operators on an infinite dimensional separable Hilbert space, to a general spectral discontinuity result in abstract Banach algebras. This can then be used to…

The aim of this chapter is to provide an adequate graph theoretic framework for the description of periodic bifurcations which have recently been discovered in descendant trees of finite p-groups. The graph theoretic concepts of rooted…

Applying quantitative perturbation theory for linear operators, we prove non-asymptotic limit theorems for Markov chains whose transition kernel has a spectral gap in an arbitrary Banach algebra of functions X . The main results are…

Building upon [1], this study aims to introduce fractal geometry into graph theory, and to establish a potential theoretical foundation for complex networks. Specifically, we employ the method of substitution to create and explore…

We work out the theory of fractional isomorphism of graphons as a generalization to the classical theory of fractional isomorphism of finite graphs. The generalization is given in terms of homomorphism densities of finite trees and it is…

We show that smoothness implies norm-controlled inversion: the smoothness of an element $a$ in a Banach algebra with a one-parameter automorphism group is preserved under inversion, and the norm of the inverse $a^{-1}$ is controlled by the…

This paper presents a general framework for a refined spectral analysis of a group of isometries acting on a Banach space, which extends the spectral theory of Arveson. The concept of continuous Arveson spectrum is introduced and the…

The present paper is the first one in the sequence of papers about a simple class of {\em framed $4$-graphs}; the goal of the present paper is to collect some well-known results on planarity and to reformulate them in the language of {\em…

We investigate topological, combinatorial, statistical, and enumeration properties of finite graphs with high Kolmogorov complexity (almost all graphs) using the novel incompressibility method. Example results are: (i) the mean and variance…

Can one reduce the size of a graph without significantly altering its basic properties? The graph reduction problem is hereby approached from the perspective of restricted spectral approximation, a modification of the spectral similarity…

Motivated by the prevalent data science applications of processing large-scale graph data such as social networks and biological networks, this paper investigates lossless compression of data in the form of a labeled graph. Particularly, we…

We consider the Bernoulli bond percolation process (with parameter $p$) on infinite graphs and we give a general criterion for bounded degree graphs to exhibit a non-trivial percolation threshold based either on a single isoperimetric…

In 1983, Borowiecki and J\'o\'zwiak posed the problem ``Characterize those graphs which have purely imaginary per-spectrum.'' This problem is still open. The most general result, although a partial solution, was given in 2004 by Yan and…

We use the concept of intrinsic metrics to give a new definition for an isoperimetric constant of a graph. We use this novel isoperimetric constant to prove a Cheeger-type estimate for the bottom of the spectrum which is nontrivial even if…

For each infinite word over a given finite alphabet, we define an increasing sequence of rooted finite graphs, that can be thought as approximations of the famous Sierpinski carpet. These sequences naturally converge to an infinite rooted…

We determine both the semigroup and spectral properties of a group of weighted composition operators on the Little Bloch space. It turns out that these are strongly continuous groups of invertible isometries on the Bloch space. We then…