Related papers: Multigraph limits, unbounded kernels, and Banach s…
We study inhomogeneous random graphs with a finite type space. For a natural generalization of the model as a dynamic network-valued process, the paper establishes the following results: (a) Functional central limit theorems for the…
We study in how far it is possible to reconstruct a graph from various Banach algebras associated to its universal covering, and extensions thereof to quantum statistical mechanical systems. It turns out that most the boundary operator…
The existence of a Banach limit as a translation invariant positive continuous linear functional on the space of bounded scalar sequences which is equal to 1 at the constant sequence (1,1,...,1,...) is proved in a first course on functional…
We furnish a simple way of constructing an unbounded closed linear operator in a complex Banach space, whose spectrum is an arbitrary nonempty closed, in particular compact, subset of the complex plane.
We present some results on the structure of line graphs of triangle-free graphs and a homogenization of the line graph of the universal homogeneous triangle-free graph in a finite relational language with arity 4. This result is relevant to…
The goal of this paper is to unify two lines in a particular area of graph limits. First, we generalize and provide unified treatment of various graph limit concepts by means of a combination of model theory and analysis. Then, as an…
After collecting a number of results on interval and almost interval preserving linear maps and vector lattice homomorphisms, we show that direct systems in various categories of normed vector lattices and Banach lattices have direct…
We study the extension of holomorphic functions of bounded type defined on an open subset of a Banach space, to larger domains. For this, we first characterize the envelope of holomorphy of a Riemann domain over a Banach space, with respect…
The purpose of this article is to generalize some known characterizations of Banach space properties in terms of graph preclusion. In particular, it is shown that superreflexivity can be characterized by the non-equi-bi-Lipschitz…
We construct a locally finite graph and a bounded geometry metric space which do not admit a quasi-isometric embedding into any uniformly convex Banach space. Connections with the geometry of $c_0$ and superreflexivity are discussed.
To each colored graph, one can associate its closure in the universal space of isomorphism classes of pointed colored graphs, and this subspace can be regarded as a generalized subshift. Based on this correspondence, we extend the notion of…
Assume that $A$ is a closed linear operator defined on all of a Hilbert space $H$. Then $A$ is bounded. A new short proof of this classical theorem is given on the basis of the uniform boundedness principle. The proof can be easily extended…
The notion of homomorphism indistinguishability offers a combinatorial framework for characterizing equivalence relations of graphs, in particular equivalences in counting logics within finite model theory. That is, for certain graph…
A large body of work has investigated the properties of graph neural networks and identified several limitations, particularly pertaining to their expressive power. Their inability to count certain patterns (e.g., cycles) in a graph lies at…
In this article, we study directed graphs (digraphs) with a coloring constraint due to Von Neumann and related to Nim-type games. This is equivalent to the notion of kernels of digraphs, which appears in numerous fields of research such as…
This paper proves limit theorems for the number of monochromatic edges in uniform random colorings of general random graphs. These can be seen as generalizations of the birthday problem (what is the chance that there are two friends with…
We collect some general results on graph limits associated to hereditary classes of graphs. As examples, we consider some classes defined by forbidden subgraphs and some classes of intersection graphs, including triangle-free graphs,…
We extend the notion of graph homomorphism to cellularly embedded graphs (maps) by designing operations on vertices and edges that respect the surface topology; we thus obtain the first definition of map homomorphism that preserves both the…
We prove that for any weakly convergent sequence of finite graphs with bounded vertex degrees, there exists a topological limit graphing.
We study the asymptotic behavior of a bounded solution of an inhomogeneous delay linear difference equation in a Banach space by using the spectrum of bounded sequences. We get a significant extension of excellent results in [1]. A new…