Related papers: A Closeness Function on Coarse Grained Lorentzian …

We prove a functional limit theorem for vector-valued functionals of the fractional Ornstein-Uhlenbeck process, providing the foundation for the fluctuation theory of slow/fast systems driven by such a noise. Our main contribution is on the…

We show how to use a variational approximation to the logistic function to perform approximate inference in Bayesian networks containing discrete nodes with continuous parents. Essentially, we convert the logistic function to a Gaussian,…

In this paper a relative number density parameter, called the neighborhood function, is introduced so that the crowded nature of the neighborhood of individual sources can be described. With this parameter one can determine the probability…

This book offers to study locally compact groups from the point of view of appropriate metrics that can be defined on them, in other words to study "Infinite groups as geometric objects", as Gromov writes it in the title of a famous…

We demonstrate that any full and faithful $*$-functor between approximable categories of locally finite coarse spaces induces a coarse embedding between the underlying spaces. Furthermore, we establish a general characterisation of such…

We study the Riemannian distance function from a fixed point (a point-wise target) of Euclidean space in the presence of a compact obstacle bounded by a smooth hypersurface. First, we show that such a function is locally semiconcave with a…

We study notions of conjugate points along timelike geodesics in the synthetic setting of Lorentzian (pre-)length spaces, inspired by earlier work for metric spaces by Shankar--Sormani. After preliminary considerations on convergence of…

Warped time-frequency systems have recently been introduced as a class of structured continuous frames for functions on the real line. Herein, we generalize this framework to the setting of functions of arbitrary dimensionality. After…

We define a new type of transformation for Lorentzian manifolds characterized by mapping every causal future-directed vector onto a causal future-directed vector. The set of all such transformations, which we call causal symmetries, has the…

We study a discrete approximation of functionals depending on nonlocal gradients. The discretized functionals are proved to be coercive in classical Sobolev spaces

We provide in a unified way quantitative forms of strong convergence results for numerous iterative procedures which satisfy a general type of Fejer monotonicity where the convergence uses the compactness of the underlying set. These…

Geometric characteristics of metric spaces that appear in formulas of the Gromov--Hausdorff distances from these spaces to so-called simplexes, i.e., to the metric spaces, all whose non-zero distances are the same are studied. The…

We extend the Theory of Computation on real numbers, continuous real functions, and bounded closed Euclidean subsets, to compact metric spaces $(X,d)$: thereby generically including computational and optimization problems over higher types,…

This article introduces and studies the tight approximation property, a property of algebraic varieties defined over the function field of a complex or real curve that refines the weak approximation property (and the known cohomological…

An approach to modelling random sets with locally finite perimeter as random elements in the corresponding subspace of $L^1$ functions is suggested. A Crofton formula for flat sections of the perimeter is shown. Finally, random processes of…

An important, if relatively less well known aspect of the singularity theorems in Lorentzian Geometry is to understand how their conclusions fare upon weakening or suppression of one or more of their hypotheses. Then, theorems with modified…

We investigate fundamental properties of the proximal point algorithm for Lipschitz convex functions on (proper, geodesic) Gromov hyperbolic spaces. We show that the proximal point algorithm from an arbitrary initial point can find a point…

In this paper we discuss three distance functions on the set of convex bodies. In particular we study the convergence of Delzant polytopes, which are fundamental objects in symplectic toric geometry. By using these observations, we derive…

Distance function to a compact set plays a central role in several areas of computational geometry. Methods that rely on it are robust to the perturbations of the data by the Hausdorff noise, but fail in the presence of outliers. The…

We provide a comprehensive study of the convergence of the forward-backward algorithm under suitable geometric conditions, such as conditioning or {\L}ojasiewicz properties. These geometrical notions are usually local by nature, and may…