Related papers: Strict p-negative type of a metric space

A central computational problem for analyzing and model checking various classes of infinite-state recursive probabilistic systems (including quasi-birth-death processes, multi-type branching processes, stochastic context-free grammars,…

We present a new robust bootstrap method for a test when there is a nuisance parameter under the alternative, and some parameters are possibly weakly or non-identified. We focus on a Bierens (1990)-type conditional moment test of omitted…

We present a tree-based construction of LDPC codes that have minimum pseudocodeword weight equal to or almost equal to the minimum distance, and perform well with iterative decoding. The construction involves enumerating a $d$-regular tree…

The notion of tree-shifts constitutes an intermediate class in between one-sided shift spaces and multidimensional ones. This paper proposes an algorithm for computing of the entropy of a tree-shift of finite type. Meanwhile, the entropy of…

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 \cite{MR447956}, Muckenhoupt and Wheeden formulated a weighted weak $(p,p)$ inequality where the weight for the weak $L^p$ space is treated as a multiplier rather than a measure. They proved such inequalities for the Hardy-Littlewood…

The Schatten-$p$ quasi-norm with $p\in(0,1)$ has recently gained considerable attention in various low-rank matrix estimation problems offering significant benefits over relevant convex heuristics such as the nuclear norm. However, due to…

Steiner Tree Packing (STP) is a notoriously hard problem in classical complexity theory, which is of practical relevance to VLSI circuit design. Previous research has approached this problem by providing heuristic or approximate algorithms.…

A set N is called a "weak epsilon-net" (with respect to convex sets) for a finite set X in R^d if N intersects every convex set that contains at least epsilon*|X| points of X. For every fixed d>=2 and every r>=1 we construct sets X in R^d…

The aim of this chapter is to provide an adequate graph theoretic framework for the description of periodic bifurcations which have recently been discovered in descendant trees of finite p-groups. The graph theoretic concepts of rooted…

For 1<p< \infty, weight w \in A_p, and any L ^2 -bounded Calder\'on-Zygmund operator T, we show that there is a constant C(T,P) so that we prove the sharp norm dependence on T_#, the maximal truncations of T, in both weak and strong type…

In this article, we prove a weak type $(p,p)$ maximal inequality, $1<p<\infty$, for weighted averages of a positive Dunford-Schwarz operator $T$ acting on a noncommutative $L_p$-space associated to a semifinite von Neumann algebra…

A standard way of justifying that a certain probabilistic property holds in a system is to provide a witnessing subsystem (also called critical subsystem) for the property. Computing minimal witnessing subsystems is NP-hard already for…

Computing a minimum-area planar straight-line drawing of a graph is known to be NP-hard for planar graphs, even when restricted to outerplanar graphs. However, the complexity question is open for trees. Only a few hardness results are known…

The aim of this paper is to provide upper bounds for the entropy numbers of summation operators on trees in a critical case. In a recent paper [10] we elaborated a framework of weighted summation operators on general trees where we related…

For a property $P$ and a sub-property $P'$, we say that $P$ is $P'$-partially testable with $q$ queries if there exists an algorithm that distinguishes, with high probability, inputs in $P'$ from inputs $\epsilon$-far from $P$ by using $q$…

We establish the existence and uniqueness of discrete Einstein metrics on trees under Lin-Lu-Yau Ricci curvature using Perron-Frobenius theory. We establish a sharp upper bound for the largest eigenvalue of the associated Ricci matrix in…

Selective inference is considered for testing trees and edges in phylogenetic tree selection from molecular sequences. This improves the previously proposed approximately unbiased test by adjusting the selection bias when testing many trees…

Topological measures and quasi-linear functionals generalize measures and linear functionals. We define and study deficient topological measures on locally compact spaces. A deficient topological measure on a locally compact space is a set…

Diversities are a generalization of metric spaces in which a non-negative value is assigned to all finite subsets of a set, rather than just to pairs of points. Here we provide an analogue of the theory of negative type metrics for…