Related papers: Isospectral Reduction in Infinite Graphs

In machine learning, graph embedding algorithms seek low-dimensional representations of the input network data, thereby allowing for downstream tasks on compressed encodings. Recently, within the framework of network renormalization,…

We study finite graphs embedded in oriented surfaces by associating a polynomial to it. The tools used in developing a theory of such graph polynomials are algebraic topological while the polynomial itself is inspired from ideas arising in…

The goal of this paper is to study band-dominated operators on Banach spaces with Schauder basis with respect to uniformly locally finite metric spaces as well as the Banach algebras generated by them: the so called uniform Roe algebras. We…

In many branches of engineering, Banach contraction mapping theorem is employed to establish the convergence of certain deterministic algorithms. Randomized versions of these algorithms have been developed that have proved useful in…

Given a dense countable set in a metric space, the infinite random geometric graph is the random graph with the given vertex set and where any two points at distance less than 1 are connected, independently, with some fixed probability. It…

A cut $\varepsilon$-sparsifier of a weighted graph $G$ is a re-weighted subgraph of $G$ of (quasi)linear size that preserves the size of all cuts up to a multiplicative factor of $\varepsilon$. Since their introduction by Bencz\'ur and…

This work analyzes Graph Neural Networks, a generalization of Fully-Connected Deep Neural Nets on Graph structured data, when their width, that is the number of nodes in each fullyconnected layer is increasing to infinity. Infinite Width…

We prove that the edge-end space of an infinite graph is metrizable if and only if it is first-countable. This strengthens a recent result by Aurichi, Magalhaes Jr.\ and Real (2024). Our central graph-theoretic tool is the use of tree-cut…

The main result of the article is validity of the limiting absorption principle and thus absence of the singular continuous spectrum for compact quantum graphs with several infinite leads attached. The technique used involves…

Motivated by a paradigm shift towards a hyper-connected world, we develop a computationally tractable small-gain theorem for a network of infinitely many systems, termed as infinite networks. The proposed small-gain theorem addresses…

The main goal of this work is to introduce an analogous in the non-archimedean context of the Gelfand spaces of certain Banach commutative algebras with unit. In order to do that, we study the spectrum of this algebras and we show that,…

We construct small cancellation labellings for some infinite sequences of finite graphs of bounded degree. We use them to define infinite graphical small cancellation presentations of groups. This technique allows us to provide examples of…

This work will be centered in commutative Banach subalgebras of the algebra of bounded linear operators defined on a Free Banach spaces of countable type. The main goal of this work wil be to formulate a representation theorem for these…

In this dissertation I establish that a broad class of Banach *-algebras of infinite integral operators, defined by the property that the kernels of the elements of the algebras possess subexponential off-diagonal decay, is inverse closed…

We present and discuss isospectral quantum graphs which are not isometric. These graphs are the analogues of the isospectral domains in R2 which were introduced recently and are all based on Sunada's construction of isospectral domains.…

We study composition operators on the weighted Banach spaces of an infinite tree. We characterize the bounded and the compact operators, as well as determine the operator norm and the essential norm. In addition, we study the isometric…

The metric Markov cotype of barycentric metric spaces is computed, yielding the first class of metric spaces that are not Banach spaces for which this bi-Lipschitz invariant is understood. It is shown that this leads to new nonlinear…

Many enumeration problems in combinatorics, including such fundamental questions as the number of regular graphs, can be expressed as high-dimensional complex integrals. Motivated by the need for a systematic study of the asymptotic…

This paper summarizes our latest understanding and results about the application of the Mathematics Of Enumeration to Tanner Graphs that have a regular structure called Balanced Tanner Graphs. Some preliminaries of permutation groups have…

We prove a substantial extension of an inverse spectral theorem of Ambarzumyan, and show that it can be applied to arbitrary compact Riemannian manifolds, compact quantum graphs and finite combinatorial graphs, subject to the imposition of…