Related papers: Geometric properties of infinite graphs and the Ha…
We study the behavior of averages for functions defined on finite graphs $G$, in terms of the Hardy-Littlewood maximal operator $M_G$. We explore the relationship between the geometry of a graph and its maximal operator and prove that $M_G$…
In this paper we study the $L^p$ boundedness of the centred and the uncentred Hardy--Littlewood maximal operators on certain Riemannian manifolds with bounded geometry. Our results complement those of various authors. We show that, under…
In this note we describe some recent advances in the area of maximal function inequalities. We also study the behaviour of the centered Hardy-Littlewood maximal operator associated to certain families of doubling, radial decreasing…
We study sharp $p$-variational inequalities for the Hardy-Littlewood maximal operator on complete graphs, answering in the affirmative a question by Feng Liu and Qingying Xue. We also use computational assistance to find sharp constants in…
We study the metric dimension (strong and weak) of infinite graphs. In particular, our main interest is characterizing infinite graphs with finite dimension. Our main results: (1) graphs with more than one end have infinite strong…
We characterize the geometrically doubling condition of a metric space in terms of the uniform $L^1$-boundedness of superaveraging operators, where uniform refers to the existence of bounds independent of the measure being considered.
We introduce the graph theoretical parameter of edge treewidth. This parameter occurs in a natural way as the tree-like analogue of cutwidth or, alternatively, as an edge-analogue of treewidth. We study the combinatorial properties of…
Many machine learning algorithms used for dimensional reduction and manifold learning leverage on the computation of the nearest neighbours to each point of a dataset to perform their tasks. These proximity relations define a so-called…
We introduce and study asymptotically rigid mapping class groups of certain infinite graphs. We determine their finiteness properties and show that these depend on the number of ends of the underlying graph. In a special case where the…
Initial steps in the study of inner expansion properties of infinite Cayley graphs and other infinite graphs, such as hyperbolic ones, are taken, in a flavor similar to the well-known Lipton-Tarjan square root separation result for planar…
The main goal of this paper is to provide a complete characterization of the weak-type boundedness of the Hardy-Littlewood maximal operator, $M$, on weighted Lorentz spaces $\Lambda^p_u(w)$, whenever $p>1$. This solves a problem left open…
We consider isomorphism properties of infinite random geometric graphs defined over a variety of metrics. In previous work, it was shown that for $\mathbb{R}^n$ with the $L_{\infty}$-metric, the infinite random geometric graph is, with…
In this article we characterize all possible cases that may occur in the relations between the sets of $p$ for which weak type $(p,p)$ and strong type $(p,p)$ inequalities for the Hardy--Littlewood maximal operators, both centered and…
In this article we study a special class of non-doubling metric measure spaces for which there is a significant difference between the incidence of weak and restricted weak type $(p,p)$ inequalities for the centered and non-centered…
In this article we study the notion of capacity of a vertex for infinite graphs over non-Archimedean fields. In contrast to graphs over the real field monotone limits do not need to exist. Thus, in our situation next to positive and null…
We address the question of convergence of Schr\"odinger operators on metric graphs with general self-adjoint vertex conditions as lengths of some of graph's edges shrink to zero. We determine the limiting operator and study convergence in a…
For a given subcritical discrete Schr\"odinger operator $H$ on a weighted infinite graph $X$, we construct a Hardy-weight $w$ which is optimal in the following sense. The operator $H - \lambda w$ is subcritical in $X$ for all $\lambda < 1$,…
We prove measurable analogues of Whitney's classical theorems on weak isomorphisms of finite graphs. In the setting of locally finite graphings, we introduce a notion of weak isomorphism as an edge-measure-preserving Borel bijection that…
We study analytic properties of graph product of finite groups with a hyperbolic defining graph. This is done by studying dynamics on the Bowditch compactification of the extension graph, or the crossing graph, of graph product. In…
We describe some metric properties of incomparability graphs. We consider the problem of the existence of infinite paths, either induced or isometric, in the incomparability graph of a poset. Among other things, we show that if the…