Sharp inequalities for maximal operators on finite graphs

DOI10.1007/S12220-021-00625-0MaRDI QIDQ1979210zbMATH OpenOpenAlexFDO

Authors Cristian González-Riquelme, Jose Beltrán Jiménez

Publication date 2 September 2021

Published in The Journal of Geometric Analysis (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2005.03146

\(p\)-bounded variation finite graphs maximal operators sharp constants

Distance in graphs (05C12) Functions of bounded variation, generalizations (26A45) Discrete version of topics in analysis (39A12) Maximal functions, Littlewood-Paley theory (42B25) Sobolev spaces and other spaces of ``smooth functions, embedding theorems, trace theorems (46E35) Sobolev (and similar kinds of) spaces of functions of discrete variables (46E39)

Abstract: Let

G = (V, E)

be a finite graph and

M_{G}

be the centered Hardy-Littlewood maximal operator defined there. We find the optimal value

such that the inequality

ext{Var}_{p}(M_{G}f)leq { extbf{C}}_{G,p} ext{Var}_{p}(f)

holds for every

f : V o m a t h b b R,

where

e x t {V a r}_{p}

stands for the

p

-variation, when: (i)

G = K_{n}

(complete graph) and

p i n [f r a c l o g (4) l o g (6), i n f t y)

or

G = K_{4}

and

p i n (0, i n f t y)

; (ii)

G = S_{n}

(star graph) and

1 g e p g e f r a c 12

;

p i n (0, f r a c 12)

and

n g e C (p)

or

G = S_{3}

and

p i n (1, i n f t y) .

We also find the value of the norm

| M_{G} |_{2}

when: (i)

G = K_{n}

and

n g e 3

; (ii)

G = S_{n}

and

n g e 3.

Review text

Let \(G = (V, E)\) be a finite graph. To \(G\) we may associate a centered Hardy-Littlewood maximal operator \(M_G\) defined by \[M_G f (e) = \max_{r \geq 0} \frac{1}{|B(e,r)|}\sum_{m \in B(e,r)}|f(m)|\;,\]where \(f: V \rightarrow \mathbb{R}\), \(e \in V\) and \(B(e,r) = \{m \in V: d_G(e,m) \leq r\}\). Here \(d_G(x,y)\) is the number of edges in a shortest path in \(G\) connecting points \(x\) and \(y\) in \(V\). The \(p\)-variation of a function \(f: V \rightarrow \mathbb{R}\) is defined by \[Var_p f = \left(\frac{1}{2} \sum_n \sum_{m : d_G(n,m) = 1} \left|f(n) - f(m)\right|^p\right)^{\frac{1}{p}}\;.\] In this paper, the authors find the optimal value \(C_{G, p}\) such that the inequality \[Var_p M_G f \leq C_{G, p} Var_p f\] holds for every \(f: V \rightarrow \mathbb{R}\), when (i) \(G = K_n\) (the complete graph) and \(p \in [\frac{\log 4}{\log 6}, \infty)\) or \(G = K_4\) and \(p \in (0, \infty)\); (ii) \(G = S_n \)(the star graph) and \(1 \geq p \geq \frac{1}{2}\); \(p \in (0, \frac{1}{2})\) and \(n \geq C(p)\) or \(G = S_3\) and \(p \in (1, \infty)\). The authors also find the norm \(\|M_G\|_2\) when (i) \(G = K_n\) and \(n \geq 3\); (ii) \(G = S_n\) and \(n \geq 3\). Not only providing a background and historical overview related to these results, the authors also mention several open problems associated to maximal operators on finite graphs.

Recommendations

Cites work

Cited in

(16)

This page was built for publication: Sharp inequalities for maximal operators on finite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1979210)