Related papers: Restricted Path Characteristic Function Determines…
This paper establishes a comprehensive concentration theory for truncated signatures of Gaussian rough paths. The signature of a path, defined as the collection of all iterated integrals, provides a complete description of its geometric…
This paper addresses the estimation problem of an unknown drift parameter matrix for a fractional Ornstein-Uhlenbeck process in a multi-dimensional setting. To tackle this problem, we propose a novel approach based on rough path theory that…
The paper addresses the question whether a random functional, a map from a set $E$ into the space of real-valued measurable functions on a probability space, has a measurable version with values in ${\mathbb R}^E$. Similarly, one may ask…
We consider rough paths with jumps. In particular, the analogue of Lyons' extension theorem and rough integration are established in a jump setting, offering a pathwise view on stochastic integration against cadlag processes. A class of…
This paper presents an identity between the multivariate and univariate saddlepoint approximations applied to sample path probabilities for a certain class of stochastic processes. This class, which we term the recursively compounded…
The normalised partial sums of values of a nonnegative multiplicative function over divisors with appropriately restricted sizes of a random permutation from the symmetric group define trajectories of a stochastic process. We prove a…
We analyze the disordered Riemannian geometry resulting from random perturbations of the Euclidean metric. We focus on geodesics, the paths traced out by a particle traveling in this quenched random environment. By taking the point of the…
This study in centered on models accounting for stochastic deformations of sample paths of random walks, embedded either in $\mathbb{Z}^2$ or in $\mathbb{Z}^3$. These models are immersed in multi-type particle systems with exclusion.…
The signature of a path provides a top down description of the path in terms of its effects as a control [Differential Equations Driven by Rough Paths (2007) Springer]. The signature transforms a path into a group-like element in the tensor…
The theta process is a stochastic process of number theoretical origin arising as a scaling limit of quadratic Weyl sums. It can be described in terms of the geodesic flow and an automorphic function on a homogeneous space. This process has…
The thesis concentrates on two problems in discrete geometry, whose solutions are obtained by analytic, probabilistic and combinatoric tools. The first chapter deals with the strong polarization problem. This states that for any sequence…
Our objective is to explore random walks on the general linear group, constrained to a specific domain, with a primary focus on establishing the conditioned local limit theorem. This paper marks the initial stride toward achieving this…
Stochastic localization is a pathwise analysis technique originating from convex geometry. This paper explores certain algorithmic aspects of stochastic localization as a computational tool. First, we unify various existing stochastic…
This note is an attempt to unconditionally prove the existence of weak one way functions (OWF). Starting from a provably intractable decision problem $L_D$ (whose existence is nonconstructively assured from the well-known discrete…
In this paper, we study parameter identification for solutions to (possibly non-linear) SDEs driven by additive Rosenblatt process and singularity of the induced laws on the path space. We propose a joint estimator for the drift parameter,…
The trajectories of diffusion processes are continuous but non-differentiable, and each occurs with vanishing probability. This introduces a gap between theory, where path probabilities are used in many contexts, and experiment, where only…
The Random Walks (RW) algorithm is one of the most e - cient and easy-to-use probabilistic segmentation methods. By combining contrast terms with prior terms, it provides accurate segmentations of medical images in a fully automated manner.…
The recently developed bag-of-paths (BoP) framework consists in setting a Gibbs-Boltzmann distribution on all feasible paths of a graph. This probability distribution favors short paths over long ones, with a free parameter (the temperature…
The stochastic sewing lemma recently introduced by Le~(2020) allows to construct a unique limit process from a doubly indexed stochastic process that satisfies some regularity. This lemma is stated in a given probability space on which…
We present a novel probabilistic approach for optimal path experimental design. In this approach a discrete path optimization problem is defined on a static navigation mesh, and trajectories are modeled as random variables governed by a…