Related papers: On the Harnack distance
We consider holographic entanglement entropy in higher derivative gravity theories. Recently Lewkowycz and Maldacena arXiv:1304.4926 have provided a method to derive the equations for the entangling surface from first principles. We use…
Although recovering an Euclidean distance matrix from noisy observations is a common problem in practice, how well this could be done remains largely unknown. To fill in this void, we study a simple distance matrix estimate based upon the…
This paper is devoted to interior, i.e. away from the boundary, estimates for eigenfunctions of the fractional Laplacian in an Euclidean domain of $\mathbb R^d$.
The concept of angle, angle functions, and the question how to measure angles present old and well-established mathematical topics referring to Euclidean space, and there exist also various extensions to non-Euclidean spaces of different…
The goal of this note is to show that some convolution type inequalities from Harmonic Analysis and Information Theory, such as Young's convolution inequality (with sharp constant), Nelson's hypercontractivity of the Hermite semi-group or…
We prove $L^p$-Hardy inequalities with distance to the boundary for domains in the Heisenberg group ${\mathbb{H}}^n$, $n\geq 1$. Our results are based on a certain geometric condition. This is first implemented for the Euclidean distance in…
This work builds a unified framework for the study of quadratic form distance measures as they are used in assessing the goodness of fit of models. Many important procedures have this structure, but the theory for these methods is dispersed…
Distance Geometry is based on the inverse problem that asks to find the positions of points, in a Euclidean space of given dimension, that are compatible with a given set of distances. We briefly introduce the field, and discuss some open…
In high dimension, low sample size (HDLSS) settings, classifiers based on Euclidean distances like the nearest neighbor classifier and the average distance classifier perform quite poorly if differences between locations of the underlying…
Hypernetwork is a useful way to depict multiple connections between nodes, making it an ideal tool for representing complex relationships in network science. In recent years, there has been a marked increase in studies on hypernetworks,…
Many of the properties of sectional category, topological complexity and homotopic distance are in fact derived from a small number of basic properties, which, once established, lead to all the others without further recourse to topology.…
We discuss entropy bounds for a class of two-dimensional gravity models. While the Bekenstein bound can be proved to hold in general for weakly gravitating matter, the analogous of the holographic bound is not universal, but depends on the…
We present a general approach to the study of the local distribution of measures on Euclidean spaces, based on local entropy averages. As concrete applications, we unify, generalize, and simplify a number of recent results on local…
Given a bounded domain, we deal with the problem of estimating the distance function from the internal points of the domain to the boundary of the domain. Convolutional and differential distance estimation schemes are considered and, for…
We formulate some properties of a set of several mutually unbiased measurements. These properties are used for deriving entropic uncertainty relations. Applications of mutually unbiased measurements in entanglement detection are also…
We consider percolation of the vacant set of random interlacements at intensity $u$ in dimensions three and higher, and derive lower bounds on the truncated two-point function for all values of $u>0$. These bounds are sharp up to principal…
Topological entropy or spatial entropy is a way to measure the complexity of shift spaces. This study investigates the relationships between the spatial entropy and the various periodic entropies which are computed by skew-coordinated…
Some graphs admit drawings in the Euclidean k-space in such a (natu- ral) way, that edges are represented as line segments of unit length. Such drawings will be called k dimensional unit distance representations. When two non-adjacent…
The inner product provides a conceptually and algorithmically simple method for calculating the comoving distance between two cosmological objects given their redshifts, right ascension and declination, and arbitrary constant curvature. The…
We study relations and characterizations of various elliptic Harnack inequalities for symmetric non-local Dirichlet forms on metric measure spaces. We allow the scaling function be state-dependent and the state space possibly disconnected.…