相关论文: Sub-Riemannian Random Walks: From Connections to R…

Let $G$ be a connected semisimple real Lie group with finite center, and $\mu$ a probability measure on $G$ whose support generates a Zariski-dense subgroup of $G$. We consider the right $\mu$-random walk on $G$ and show that each random…

Geodesics become an essential element of the geometry of a semi-Riemannian manifold. In fact, their differences and similarities with the (positive definite) Riemannian case, constitute the first step to understand semi-Riemannian Geometry.…

The question whether a Riemannian manifold is geodesically connected can be studied from geometrical as well as variational methods, and accurate results can be obtained by using the associated distance and related properties of the…

We consider a discrete-time random walk on the nodes of an unbounded hexagonal lattice. We determine the probability generating functions, the transition probabilities and the relevant moments. The convergence of the stochastic process to a…

For robots to work alongside humans and perform in unstructured environments, they must learn new motion skills and adapt them to unseen situations on the fly. This demands learning models that capture relevant motion patterns, while…

We prove an estimate for the probability that a simple random walk in a simply connected subset A of Z^2 starting on the boundary exits A at another specified boundary point. The estimates are uniform over all domains of a given inradius.…

We provide a direct proof of Cram\'er's theorem for geodesic random walks in a complete Riemannian manifold $(M,g)$. We show how to exploit the vector space structure of the tangent spaces to study large deviation properties of geodesic…

Consider a generic triangle in the upper half of the complex plane with one side on the real line. This paper presents a tailored construction of a discrete random walk whose continuum limit is a Brownian motion in the triangle, reflected…

Random geometric graphs are random graph models defined on metric spaces. Such a model is defined by first sampling points from a metric space and then connecting each pair of sampled points with probability that depends on their distance,…

Random geometric graphs are random graph models defined on metric measure spaces. A random geometric graph is generated by first sampling points from a metric space and then connecting each pair of sampled points independently with a…

Considering Riemannian submersions, we find necessary and sufficient conditions for when sub-Riemannian normal geodesics project to curves of constant first geodesic curvature or constant first and vanishing second geodesic curvatures. We…

In this paper we present a computation of the mean first-passage times both for a random walk in a discrete bounded lattice, between a starting site and a target site, and for a Brownian motion in a bounded domain, where the target is a…

In \cite{SzT}, D. Sz\'asz and A. Telcs have shown that for the diffusively scaled, simple symmetric random walk, weak convergence to the Brownian motion holds even in the case of local impurities if $d \ge 2$. The extension of their result…

We discuss the question of recurrence for persistent, or Newtonian, random walks in Z^2, i.e., random walks whose transition probabilities depend both on the walker's position and incoming direction. We use results by Toth and Schmidt-Conze…

We study the behaviour of the rescaled minimal subtree containing the origin and K random vertices selected from a random critical (sufficiently spread-out, and in dimensions d > 8) lattice tree conditioned to survive until time ns, in the…

Efficient approximation of geodesics is crucial for practical algorithms on manifolds. Here we introduce a class of retractions on submanifolds, induced by a foliation of the ambient manifold. They match the projective retraction to the…

We present a real space renormalization group scheme for the problem of random walks in a random environment on a strip, which includes one-dimensional random walk in random environment with bounded non-nearest-neighbor jumps. We show that…

We study a family of mappings from the powers of the unit tangent sphere at a point to a complete Riemannian manifold with non-positive sectional curvature, whose behavior is related to the spherical mean operator and the geodesic random…

Gradient descent with momentum has been widely applied in various signal processing and machine learning tasks, demonstrating a notable empirical advantage over standard gradient descent. However, momentum-based distributed Riemannian…

In this paper, we propose a model of arm reaching movements expressed in terms of geodesics in a sub-Riemannian space. We will choose a set of kinematic variables to which motor cortical cells are selective with the purpose of modelling the…