Related papers: Discrete geodesics and cellular automata
Many statistical and machine learning approaches rely on pairwise distances between data points. The choice of distance metric has a fundamental impact on performance of these procedures, raising questions about how to appropriately…
Cayley graphs have a number of useful features: the ability to graphically represent finitely generated group elements and their relations; to name all vertices relative to a point; and the fact that they have a well-defined notion of…
Differential calculus on discrete spaces is studied in the manner of non-commutative geometry by representing the differential calculus by an operator algebra on a suitable Krein space. The discrete analogue of a (pseudo-)Riemannian metric…
Constructing a discrete model like a cellular automaton is a powerful method for understanding various dynamical systems. However, the relationship between the discrete model and its continuous analogue is, in general, nontrivial. As a…
We consider discrete dynamical systems and lattice models in statistical mechanics from the point of view of their symmetry groups. We describe a C program for symmetry analysis of discrete systems. Among other features, the program…
We describe, in an intrinsic way and using the global chart provided by Ito's parallel transport, a generalisation of the notion of geodesic (as critical path of an energy functional) to diffusion processes on Riemannian manifolds. These…
Cellular automata are fully-discrete, spatially-extended dynamical systems that evolve by simultaneously applying a local update function. Despite their simplicity, the induced global dynamic produces a stunning array of richly-structured,…
Riemannian geodesic orbit spaces (G/H,g) are natural generalizations of symmetric spaces, defined by the property that their geodesics are orbits of one-parameter subgroups of G. We study the geodesic orbit spaces of the form (G/S,g), where…
Discretization of general relativity is a promising route towards quantum gravity. Discrete geometries have a finite number of degrees of freedom and can mimic aspects of quantum geometry. However, selection of the correct discrete freedoms…
A discrete time quantum walk is known to be the single-particle sector of a quantum cellular automaton. Searching in this mathematical framework has interested the community since a long time. However, most results consider spatial search…
Bijections between sets may be seen as discrete (or crisp) unitary transformations used in quantum computations. So discrete quantum cellular automata are cellular automata with reversible transition functions. This note studies on 1d…
An approach to the discrete quantum gravity based on the Regge calculus is discussed which was developed in a number of our papers. Regge calculus is general relativity for the subclass of general Riemannian manifolds called piecewise flat…
Following our earlier work, we construct statistical discrete geometry by applying statistical mechanics to discrete (Regge) gravity. We propose a coarse-graining method for discrete geometry under the assumptions of atomism and background…
This paper proposes a new framework and algorithms to address the problem of diffeomorphic registration on a general class of geometric objects that can be described as discrete distributions of local direction vectors. It builds on both…
The goal of this paper is to study periodic geodesics for sub-Riemannian metrics on a contact 3D-manifold.We develop two rather independent subjects:1) The existence of closed geodesics spiraling around periodic Reeb orbits for a generic…
Numerical computation of shortest paths or geodesics on curved domains, as well as the associated geodesic distance, arises in a broad range of applications across digital geometry processing, scientific computing, computer graphics, and…
In this paper the optimal transport and the metamorphosis perspectives are combined. For a pair of given input images geodesic paths in the space of images are defined as minimizers of a resulting path energy. To this end, the underlying…
We study discrete dynamical systems through the topological concepts of limit set, which consists of all points that can be reached arbitrarily late, and asymptotic set, which consists of all adhering values of orbits. In particular, we…
Ultradiscretization is a limiting procedure transforming a given difference equation into a cellular automaton. In addition the cellular automaton constructed by this procedure preserves the essential properties of the original equation,…
We consider here the discrete time dynamics described by a transformation $T:M \to M$, where $T$ is either the action of shift $T=\sigma$ on the symbolic space $M=\{1,2,...,d\}^\mathbb{N}$, or, $T$ describes the action of a $d$ to $1$…