Related papers: Isospectral Reduction in Infinite Graphs

Graph classes of bounded tree rank were introduced recently in the context of the model checking problem for first-order logic of graphs. These graph classes are a common generalization of graph classes of bounded degree and bounded…

In this paper, we shall consider an infinite-derivative theory of gravity, with a view to making it renormalisable. First, we derive the modified superficial degree of divergence. Next, we establish that the theory is invariant under BRS…

Reducing a graph while preserving its overall properties is an important problem with many applications. Typically, reduction approaches either remove edges (sparsification) or merge nodes (coarsening) in an unsupervised way with no…

After a brief review of the key theorems concerning recurrent sequences, we give an explicit computation of the inverse of the Vandermonde matrix. This will then be used to derive sub-exponential decay error terms in the ergodic theorem of…

We look at a graph property called reducibility which is closely related to a condition developed by Brown to evaluate Feynman integrals. We show for graphs with a fixed number of external momenta, that reducibility with respect to both…

A finite graph embedded in the plane is called a series-parallel map if it can be obtained from a finite tree by repeatedly subdividing and doubling edges. We study the scaling limit of weighted random two-connected series-parallel maps…

Based on earlier work by Carlen-Maas and the second- and third-named author, we introduce the notion of intertwining curvature lower bounds for graphs and quantum Markov semigroups. This curvature notion is stronger than both Bakry-\'Emery…

Restricted Schur polynomials have been posited as orthonormal operators for the change of basis from N=4 SYM to type IIB string theory [1,2,3,4]. In this letter we briefly expound the relationship found between the restricted Schurs and the…

We introduce area-minimizing subgraphs in an infinite graph via the formulation of functions of bounded variations initiated by De Giorgi. We classify area-minimizing subgraphs in the two-dimensional integer lattice up to isomorphisms, and…

Some results of B. Pasynkov and H. Torunczyk on finite-dimensional maps are improved. A generalization of a Dranishnikov-Uspenskij theorem about extensional dimension is also obtained.

We consider infinite graphs and the associated energy forms. We show that a graph is canonically compactifiable (i.e. all functions of finite energy are bounded) if and only if the underlying set is totally bounded with respect to any…

The adjacency operator of a graph has a spectrum and a class of scalar-valued spectral measures which have been systematically analyzed; it also has a spectral multiplicity function which has been less studied. The first purpose of this…

We describe an algorithm that recognizes some (perhaps all) intrinsically knotted (IK) graphs, and can help find knotless embeddings for graphs that are not IK. The algorithm, implemented as a Mathematica program, has already been used by…

A switching method is a graph operation that results in cospectral graphs (graphs with the same spectrum). Work by Wang and Xu [Discrete Math. 310 (2010)] suggests that most cospectral graphs with cospectral complements can be constructed…

The recently established spectral Favard theorem for bounded banded matrices admitting a positive bidiagonal factorization is applied to a broader class of Markov chains with bounded banded transition matrices, extending beyond the…

We show that families of leafless quantum graphs that are isospectral for the standard Laplacian are finite. We show that the minimum edge length is a spectral invariant. We give an upper bound for the size of isospectral families in terms…

There is a graph reduction system so that every optimal 1-planar graph can be reduced to an irreducible extended wheel graph, provided the reductions are applied such that the given graph class is preserved. A graph is optimal 1-planar if…

This is a survey of the method of graph cuts and its applications to graph clustering of weighted unsigned and signed graphs. I provide a fairly thorough treatment of the method of normalized graph cuts, a deeply original method due to Shi…

We propose a notion of graph convergence that interpolates between the Benjamini--Schramm convergence of bounded degree graphs and the dense graph convergence developed by L\'aszl\'o Lov\'asz and his coauthors. We prove that spectra of…

It is well known that iterates of quasi-compact operators converge towards a spectral projection, whereas the explicit construction of the limiting operator is in general hard to obtain. Here, we show a simple method to explicitly construct…