Related papers: Doob's estimate for coherent random variables and …
For $2\leq p\leq \infty$, we establish dimension-free estimates for discrete dyadic Hardy-Littlewood maximal operators over Euclidean balls on semi-commutative $L_{p}$ space. In particular, when the radius is sufficiently large, these…
Pairwise ordered tree alignment are combinatorial objects that appear in RNA secondary structure comparison. However, the usual representation of tree alignments as supertrees is ambiguous, i.e. two distinct supertrees may induce identical…
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 obtain results concerning the so-called factorization for the convergence of random variables almost everywhere (almost surely or with probability one), belonging to the classical Lebesgue-Riesz spaces and we extend these results to the…
The purpose of the paper is to establish weighted maximal $L_p$-inequalities in the context of operator-valued martingales on semifinite von Neumann algebras. The main emphasis is put on the optimal dependence of the $L_p$ constants on the…
We discuss the Hardy-Littlewood maximal operator on discrete Morrey spaces of arbitrary dimension. In particular, we obtain its boundedness on the discrete Morrey spaces using a discrete version of the Fefferman-Stein inequality. As a…
In this paper we investigate the question of estimating the Gram operator by a robust estimator from an i.i.d. sample in a separable Hilbert space and we present uniform bounds that hold under weak moment assumptions. The approach consists…
We prove that the Hardy--Littlewood maximal operator $M$ is bounded on the variable Lebesgue space $L^{p(\cdot)}(X,d,\mu)$, with $1<p_-\le p_+<\infty$, over an unbounded space of homogeneous type $(X,d,\mu)$ with a Borel-semiregular measure…
Consider the following heuristic for building a decision tree for a function $f : \{0,1\}^n \to \{\pm 1\}$. Place the most influential variable $x_i$ of $f$ at the root, and recurse on the subfunctions $f_{x_i=0}$ and $f_{x_i=1}$ on the…
Given an undirected graph $G=(V,E)$, and a designated vertex $q\in V$, the notion of a $G$-parking function (with respect to $q$) was independently developed and studied by various authors, and has recently gained renewed attention. This…
We study admissible observation operators for perturbed evolution equations using the concept of maximal regularity. We first show the invariance of the maximal $L^p$-regularity under non-autonomous Miyadera-Voigt perturbations. Second, we…
In this paper, the author considers the weighted vector-valued estimate for the operator defined by $$T_Af(x)={\rm p.\,v.}\int_{\mathbb{R}^n}\frac{\Omega(x-y)}{|x-y|^{n+1}}\big(A(x)-A(y)-\nabla A(y)\big)f(y){\rm d}y,$$ and the corresponding…
In this article, we study the relationship among maximal green sequences, complete forward hom-orthogonal sequences and stability functions in abelian length categories. Mainly, we firstly give a one-to-one correspondence between maximal…
The paper is devoted to two-weight estimates for the fractional maximal operators $\mathcal{M}^\alpha$ on general probability spaces equipped with a tree-like structure. For given $1<p\leq q<\infty$, we study the sharp universal upper bound…
We apply modern techniques of dyadic harmonic analysis to obtain sharp estimates for the Bergman projection in weighted Bergman spaces. Our main theorem focuses on the Bergman projection on the Hartogs triangle. The estimates of the…
A neural network works as an associative memory device if it has large storage capacity and the quality of the retrieval is good enough. The learning and attractor abilities of the network both can be measured by the mutual information…
We obtain sharp bounds for the modulus of continuity of the uncentered maximal function in terms of the modulus of continuity of the given function, via integral formulas. Some of the results deduced from these formulas are the following:…
Given a graph $G=(V,E)$ with non-negative real edge lengths and an integer parameter $k$, the Min-Max k-Tree Cover problem seeks to find a set of at most $k$ subtrees of $G$, such that the union of the trees is the vertex set $V$. The…
Consider $n$ complex random matrices $X_1,\ldots,X_n$ of size $d\times d$ sampled i.i.d. from a distribution with mean $E[X]=\mu$. While the concentration of averages of these matrices is well-studied, the concentration of other functions…
The hierarchical and recursive expressive capability of rooted trees is applicable to represent statistical models in various areas, such as data compression, image processing, and machine learning. On the other hand, such hierarchical…