Related papers: Geometric properties of infinite graphs and the Ha…
Twin-width is a recently introduced graph parameter with applications in algorithmics, combinatorics, and finite model theory. For graphs of bounded degree, finiteness of twin-width is preserved by quasi-isometry. Thus, through Cayley…
We present recent advances in harmonic analysis on infinite graphs. Our approach combines combinatorial tools with new results from the theory of unbounded Hermitian operators in Hilbert space, geometry, boundary constructions, and spectral…
In this paper we investigate the boundedness of classical operators, namely the Hardy-Littlewood maximal operator, fractional integral operators, and Calderon-Zygmund operators, on generalized weighted Morrey spaces and generalized weighted…
A rigidity theory is developed for frameworks in a metric space with two types of distance constraints. Mixed sparsity graph characterisations are obtained for the infinitesimal and continuous rigidity of completely regular bar-joint…
We study mapping properties of the centered Hardy--Littlewood maximal operator $\mathcal{M}$ acting on Lorentz spaces. Given $p \in (1,\infty)$ and a metric measure space $\mathfrak{X}$ we let $\Omega^p_{\rm HL}(\mathfrak{X}) \subset…
We consider changes in properties of a subgraph of an infinite graph resulting from the addition of open edges of Bernoulli percolation on the infinite graph to the subgraph. We give the triplet of an infinite graph, one of its subgraphs,…
Poljak and Turz\'ik (Discrete Math. 1986) introduced the notion of \lambda-extendible properties of graphs as a generalization of the property of being bipartite. They showed that for any 0<\lambda<1 and \lambda-extendible property \Pi, any…
Gromov hyperbolicity is an interesting geometric property, and so it is natural to study it in the context of geometric graphs. It measures the tree-likeness of a graph from a metric viewpoint. In particular, we are interested in…
We explore the consequences for the boundedness properties of averaging and maximal averaging operators, of the following local comparabiliity condition for measures: Intersecting balls of the same radius have comparable sizes. Since in…
On finite metric graphs the set of all realizations of the Laplace operator in the edgewise defined $L^2$-spaces are studied. These are defined by coupling boundary conditions at the vertices most of which define non-self-adjoint operators.…
Twin-width is a recently introduced graph parameter based on the repeated contraction of near-twins. It has shown remarkable utility in algorithmic and structural graph theory, as well as in finite model theory -- particularly since…
We study two subspace systems in a separable infinite-dimensional Hilbert space up to (bounded) isomorphism. One of the main result of this paper is the following: Isomorphism classes of two subspace systems given by graphs of bounded…
The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppstein [Separating thickness from geometric thickness. In: Towards a…
We consider the global Morrey-type spaces with variable exponents and general function defining these spaces. In the case of unbounded sets, we prove boundedness of the Hardy-Littlewood maximal operator, potential type operator in these…
We prove a sharp integral inequality which connects the dyadic maximal operator with the Hardy operator. We also give some applications of this inequality.
This article investigates structural, geometrical, and topological characterizations and properties of weakly modular graphs and of cell complexes derived from them. The unifying themes of our investigation are various `nonpositive…
The present note concerns the "graph of graphs" that has cubic graphs as vertices connected by edges represented by the so-called Whitehead moves. Here, we prove that the outer-conductance of the graph of graphs tends to zero as the number…
For a finite not necessarily compact metric graph, one considers the differential expression $-\frac{d^2}{d x^2}$ on each edge. The boundary conditions at the vertices of the graph yielding quasi-m-accretive as well as m-accretive operators…
In this note we study the eigenvalue growth of infinite graphs with discrete spectrum. We assume that the corresponding Dirichlet forms satisfy certain Sobolev-type inequalities and that the total measure is finite. In this sense, the…
We describe the structure of connected graphs with the minimum and maximum average distance, radius, diameter, betweenness centrality, efficiency and resistance distance, given their order and size. We find tight bounds on these graph…