English
Related papers

Related papers: Geodesic Walks in Polytopes

200 papers

We propose a theoretically justified and practically applicable slice sampling based Markov chain Monte Carlo (MCMC) method for approximate sampling from probability measures on Riemannian manifolds. The latter naturally arise as posterior…

Computation · Statistics 2025-08-25 Alain Durmus , Samuel Gruffaz , Mareike Hasenpflug , Daniel Rudolf

Based on a local approximation of the Riemannian distance on a manifold by a computationally cheap dissimilarity measure, a time discrete geodesic calculus is developed, and applications to shape space are explored. The dissimilarity…

Numerical Analysis · Mathematics 2012-10-03 Martin Rumpf , Benedikt Wirth

We study geometric stochastic differential equations (SDEs) and their approximations on Riemannian manifolds. In particular, we introduce a simple new construction of geometric SDEs, using which with bounded curvature. In particular, we…

Probability · Mathematics 2023-11-22 Xiang Cheng , Jingzhao Zhang , Suvrit Sra

We study random walks on sub-Riemannian manifolds using the framework of retractions, i.e., approximations of normal geodesics. We show that such walks converge to the correct horizontal Brownian motion if normal geodesics are approximated…

Probability · Mathematics 2023-11-30 Michael Herrmann , Pit Neumann , Simon Schwarz , Anja Sturm , Max Wardetzky

This work describes a new algorithm for creating a superposition over the edge set of a graph, encoding a quantum sample of the random walk stationary distribution. The algorithm requires a number of quantum walk steps scaling as…

Quantum Physics · Physics 2019-04-26 Simon Apers

We study the geodesic motion planning problem for complete Riemannian manifolds and investigate their geodesic complexity, an integer-valued isometry invariant introduced by D. Recio-Mitter. Using methods from Riemannian geometry, we…

Geometric Topology · Mathematics 2023-08-02 Stephan Mescher , Maximilian Stegemeyer

We study the problem of "isotropically rounding" a polytope $K\subset\mathbb{R}^n$, that is, computing a linear transformation which makes the uniform distribution on the polytope have roughly identity covariance matrix. We assume $K$ is…

Data Structures and Algorithms · Computer Science 2019-09-17 Oren Mangoubi , Nisheeth K. Vishnoi

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…

Probability · Mathematics 2020-07-13 Ana Bela Cruzeiro , Jean-Claude Zambrini

We consider a certain class of Riemannian submersions $\pi : N \to M$ and study lifted geodesic random walks from the base manifold $M$ to the total manifold $N$. Under appropriate conditions on the distribution of the speed of the geodesic…

Probability · Mathematics 2023-10-03 Jonathan Junné , Frank Redig , Rik Versendaal

The geometric approach to optimal transport and information theory has triggered the interpretation of probability densities as an infinite-dimensional Riemannian manifold. The most studied Riemannian structures are Otto's metric, yielding…

Analysis of PDEs · Mathematics 2018-07-20 Martin Bauer , Sarang Joshi , Klas Modin

We consider a one-dimensional continuous time random walk with transition rates depending on an underlying autonomous simple symmetric exclusion process starting out of equilibrium. This model represents an example of a random walk in a…

Probability · Mathematics 2016-11-26 Luca Avena , Tertuliano Franco , Milton Jara , Florian Völlering

We prove that a uniformized variant of both the Rosenthal walk \cite{Rosenthal} and the Kac random walk \cite{Kac} on SO(n) mixes in $\cO(n^3)$ steps in total variation distance. The proof also extends easily to Rosenthal walk with fixed…

Probability · Mathematics 2011-10-26 Yunjiang Jiang

In this paper the space of images is considered as a Riemannian manifold using the metamorphosis approach, where the underlying Riemannian metric simultaneously measures the cost of image transport and intensity variation. A robust and…

Numerical Analysis · Mathematics 2015-05-28 Benjamin Berkels , Alexander Effland , Martin Rumpf

The real symplectic Stiefel manifold is the manifold of symplectic bases of symplectic subspaces of a fixed dimension. It features in a large variety of applications in physics and engineering. In this work, we study this manifold with the…

Differential Geometry · Mathematics 2021-08-31 Thomas Bendokat , Ralf Zimmermann

We show that simple random walks on (non-trivial) relatively hyperbolic groups stay $O(\log(n))$-close to geodesics, where $n$ is the number of steps of the walk. Using similar techniques we show that simple random walks in mapping class…

Group Theory · Mathematics 2013-05-24 Alessandro Sisto

We consider homogeneous open quantum random walks on a lattice with finite dimensional local Hilbert space and we study in particular the position process of the quantum trajectories of the walk. We prove that the properly rescaled position…

Probability · Mathematics 2022-06-08 Raffaella Carbone , Federico Girotti , Anderson Melchor Hernandez

We consider a random walk on a homogeneous space $G/\Lambda$ where $G$ is $\mathrm{SO}(2,1)$ or $\mathrm{SO}(3,1)$ and $\Lambda$ is a lattice. The walk is driven by a probability measure $\mu$ on $G$ whose support generates a Zariski-dense…

Dynamical Systems · Mathematics 2026-05-27 Timothée Bénard , Weikun He

The length of the geodesic between two data points along a Riemannian manifold, induced by a deep generative model, yields a principled measure of similarity. Current approaches are limited to low-dimensional latent spaces, due to the…

Many phenomena are naturally characterized by measuring continuous transformations such as shape changes in medicine or articulated systems in robotics. Modeling the variability in such datasets requires performing statistics on Lie groups,…

Methodology · Statistics 2025-08-19 Johannes Schade , Christoph von Tycowicz , Martin Hanik

The connections between (convex) optimization and (logconcave) sampling have been considerably enriched in the past decade with many conceptual and mathematical analogies. For instance, the Langevin algorithm can be viewed as a sampling…

Data Structures and Algorithms · Computer Science 2024-03-25 Yunbum Kook , Santosh S. Vempala