Related papers: Closest Distance between Iterates of Typical Point…
We prove consistency of four different approaches to formalizing the idea of minimum average edge-length in a path linking some infinite subset of points of a Poisson process. The approaches are (i) shortest path from origin through some…
The variational principle for Gibbs point processes with general finite range interaction is proved. Namely, the Gibbs point processes are identified as the minimizers of the free excess energy equals to the sum of the specific entropy and…
In this paper, we consider entropy spectra on topological Markov shifts. We prove that if two measure-preserving dynamical systems of Gibbs measures with H\"older continuous potentials are isomorphic, then their entropy spectra are the…
We prove that there is only one translation-invariant Gibbsian point process w.r.t. to a chosen interaction if any of them satisfies a certain bound related to concentration-of-measure. This concentration-of-measure bound is e.g. fulfilled…
As periodic orbit theory works badly on computing the observable averages of dynamical systems with intermittency, we propose a scheme to cooperate with cycle expansion and perturbation theory so that we can deal with intermittent systems…
Relative entropy is a powerful measure of the dissimilarity between two statistical field theories in the continuum. In this work, we study the relative entropy between Gaussian scalar field theories in a finite volume with different masses…
Two general upper bounds on the topological entropy of nonlinear time-varying systems are established: one using the matrix measure of the system Jacobian, the other using the largest real part of the eigenvalues of the Jacobian matrix with…
We present a family of entropic uncertainty relations for pointer-based simultaneous measurements of conjugate observables. The lower bounds of these relations explicitly incorporate the influence of the measurement apparatus. We achieve…
Consider a string of $n$ positions, i.e. a discrete string of length $n$. Units of length $k$ are placed at random on this string in such a way that they do not overlap, and as often as possible, i.e. until all spacings between neighboring…
We prove that certain Gibbs measures on subshifts of finite type are nonsingular and ergodic for certain countable equivalence relations, including the orbit relation of the adic transformation (the same as equality after a permutation of…
For two d-dimensional point sets A, B of size up to n, the Chamfer distance from A to B is defined as CH(A,B) = \sum_{a \in A} \min_{b \in B} \|a-b\|. The Chamfer distance is a widely used measure for quantifying dissimilarity between sets…
We investigate an extension of the Generalized Uncertainty Principle (GUP) in three dimensions by modifying the three dimensional position and momentum operators in a manner that remains coordinate-independent and retains as much of the…
In a recent breakthrough, Teyssier [Tey20] introduced a new method for approximating the distance from equilibrium of a random walk on a group. He used it to study the limit profile for the random transpositions card shuffle. His techniques…
Local correlation entropy, introduced by Takens in 1983, represents the exponential decay rate of the relative frequency of recurrences in the trajectory of a point, as the embedding dimension grows to infinity. In this paper we study…
The shortest-path, commute time, and diffusion distances on undirected graphs have been widely employed in applications such as dimensionality reduction, link prediction, and trip planning. Increasingly, there is interest in using…
We introduce and study the minimum distance function of a graded ideal in a polynomial ring with coefficients in a field, and show that it generalizes the minimum distance of projective Reed-Muller-type codes over finite fields. This gives…
Mostof the existing literature on supervised machine learning problems focuses on the case when the training data set is drawn from an i.i.d. sample. However, many practical problems are characterized by temporal dependence and strong…
Minimum error state discrimination between two mixed states \rho and \sigma can be aided by the receipt of "classical side information" specifying which states from some convex decompositions of \rho and \sigma apply in each run. We…
It is well known that for pure states the relative entropy of entanglement is equal to the reduced entropy, and the closest separable state is explicitly known as well. The same holds for Renyi relative entropy per recent results. We ask…
A Chebyshev-type quadrature for a probability measure sigma is a distribution which is uniform on n points and has the same first k moments as sigma. We give an upper bound for the minimal n required to achieve a given degree k, for sigma…