Related papers: Geometric properties of infinite graphs and the Ha…
In this paper we study the $L^p$ boundedness of the centred and the uncentred Hardy--Littlewood maximal operators on the class $\Upsilon_{a,b}$, $2\leq a\leq b$, of trees with $(a,b)$-bounded geometry. We find the sharp range of $p$,…
We find an upper bound for the asymptotic dimension of a hyperbolic metric space with a set of geodesics satisfying a certain boundedness condition studied by Bowditch. The primary example is a collection of tight geodesics on the curve…
In this paper we characterize the Banach lattices with the Hardy-Littlewood property by using maximal operators defined by semigroups of operators associated with the inverse Gauss measure.
We characterise the form of all simple, finite graphs for which the girth of the graph is equal to the circumference of the graph. We apply this to prove a bound on the number of edges in such a graph.
We study mapping properties of the centered Hardy--Littlewood maximal operator $\mathcal{M}$ acting on Lorentz spaces $L^{p,q}(\mathfrak{X})$ in the context of certain non-doubling metric measure spaces $\mathfrak{X}$. The special class of…
We study the relations between some geometric properties of maximal monotone operators and generic geometric and analytical properties of the functions on the associate Fitzpatrick family of convex representations. We also investigate under…
We introduce generalized Fofana spaces and we give some of their basic properties. These spaces are a kind of generalization of generalized Morrey spaces. As application, we establish the boundedness of the Hardy-Littlewood maximal operator…
We construct optimal Hardy weights to subcritical energy functionals $h$ associated with quasilinear Schr\"odinger operators on locally finite graphs. Here, optimality means that the weight $w$ is the largest possible with respect to a…
We extend the concept of the law of a finite graph to graphings, which are, in general, infinite graphs whose vertices are equipped with the structure of a probability space. By doing this, we obtain a vast array of new unimodular measures.…
This survey on graphs of large girth consists of two parts. The first deals with some aspects of algebraic and extremal graph theory loosely related to the Moore bound. Our point of departure for the second, Ramsey theoretic, part are some…
The notions of bounded expansion and nowhere denseness not only offer robust and general definitions of uniform sparseness of graphs, they also describe the tractability boundary for several important algorithmic questions. In this paper we…
This paper studies the Hardy-type inequalities on the intervals (may be infinite) with two weights, either vanishing at two endpoints of the interval or having mean zero. For the first type of inequalities, in terms of new isoperimetric…
We give a quantitative characterization of the pairs of weights $(w,v)$ for which the dyadic version of the one-sided Hardy-Littlewood maximal operator satisfies a restricted weak $(p,p)$ type inequality, for $1\leq p<\infty$. More…
We introduce the extension graph of graph product of groups and study its geometry. This enables us to study properties of graph product by exploiting large scale geometry of its defining graph. In particular, we show that the extension…
Twin-width is a recently introduced graph parameter. In this article, we compute twin-width of various finite graphs. In particular, we prove that the twin-widths of finite graphs with 4 and 5 vertices are less than equal to 1 and 2,…
We consider weighted graphs with an infinite set of vertices. We show that boundedness of all functions of finite energy can be seen as a notion of `relative compactness' for such graphs and study sufficient and necessary conditions for…
We extend to infinite graphs the matroidal characterization of finite graph duality, that two graphs are dual iff they have complementary spanning trees in some common edge set. The naive infinite analogue of this fails. The key in an…
We investigate quantum graphs with infinitely many vertices and edges without the common restriction on the geometry of the underlying metric graph that there is a positive lower bound on the lengths of its edges. Our central result is a…
We show that in random $K$-uniform hypergraphs of constant average degree, for even $K \geq 4$, local algorithms defined as factors of i.i.d. can not find nearly maximal cuts, when the average degree is sufficiently large. These algorithms…
It is now well known that ultracontractive properties of semigroups with infinitesimal generator given by an undirected graph Laplacian operator can be obtained through an understanding of the geometry of the underlying infinite weighted…