Related papers: Piecewise Constant Martingales and Lazy Clocks
We compare the fluctuations in the velocity and in the fraction of time spent at a given position for minimal models of a passive and an active particle: an asymmetric random walker and a run-and-tumble particle in continuous time and on a…
This work provides a novel convergence analysis for stochastic optimization in terms of stopping times, addressing the practical reality that algorithms are often terminated adaptively based on observed progress. Unlike prior approaches,…
We use the martingale-theoretic approach of game-theoretic probability to incorporate imprecision into the study of randomness. In particular, we define a notion of computable randomness associated with interval, rather than precise,…
We describe a simple method that can be used to sample the rare fluctuations of discrete-time Markov chains. We focus on the case of Markov chains with well-defined steady-state measures, and derive expressions for the large-deviation rate…
We prove the existence of exponentially localised and time-periodic solutions in general nonlinear Hamiltonian lattice systems. Like normal modes, these localised solutions are characterised by collective oscillations at the lattice sites…
We propose an approach to determine the continual progression of algorithmic efficiency, as an alternative to standard calculations of time complexity, likely, but not exclusively, when dealing with data structures with unknown maximum…
We introduce a new family of temporal logics intended for specifications in motion planning (MP). It builds upon the signal temporal logic (STL), which is a linear-time logic over real-valued signals that possess quantitative semantics and…
We consider a discrete-time process adapted to some filtration which lives on a (typically countable) subset of $\mathbb{R}^d$, $d\geq 2$. For this process, we assume that it has uniformly bounded jumps, is uniformly elliptic (can advance…
The tropical (ultradiscrete) periodic Toda lattice is a dynamical system derived from a time-discretized version of the periodic Toda lattice through a limiting procedure called tropicalization. We propose a new formulation for this…
In this work, we address the problem of identifying sparse continuous-time dynamical systems when the spacing between successive samples (the sampling period) is not constant over time. The proposed approach combines the…
Random walks of particles on a lattice are a classical paradigm for the microscopic mechanism underlying diffusive processes. In deterministic walks, the role of space and time can be reversed, and the microscopic dynamics can produce quite…
We present and analyze mechanisms for the patterned deposition of particles in a spatio-temporally driven lattice. The working principle is based on the breaking of the spatio-temporal translation symmetry, which is responsible for the…
We test a hypothesis for the origin of dynamical heterogeneity in slowly relaxing systems, namely that it emerges from soft (Goldstone) modes associated with a broken continuous symmetry under time reparametrizations. We do this by…
Transitions between steady dynamical regimes in diverse applications are often modelled using discontinuities, but doing so introduces problems of uniqueness. No matter how quickly a transition occurs, its inner workings can affect the…
Homogeneous fragmentations describe the evolution of a unit mass that breaks down randomly into pieces as time passes. They can be thought of as continuous time analogs of a certain type of branching random walks, which suggests the use of…
This paper presents an algorithmic framework for control synthesis of continuous dynamical systems subject to signal temporal logic (STL) specifications. We propose a novel algorithm to obtain a time-partitioned finite automaton from an STL…
We develop an algorithm for the motion and task planning of a system comprised of multiple robots and unactuated objects under tasks expressed as Linear Temporal Logic (LTL) constraints. The robots and objects evolve subject to uncertain…
Various specifiable combinatorial structures, with d extensive parameters, can be exactly sampled both by the recursive method, with linear arithmetic complexity if a heavy preprocessing is performed, or by the Boltzmann method, with…
Random walks find applications in many areas of science and are the heart of essential network analytic tools. When defined on temporal networks, even basic random walk models may exhibit a rich spectrum of behaviours, due to the…
We provide an example for the generating matrix $A$ of a two-dimensional lattice $\Gamma = A\mathbb{Z}^2$, such that the following holds: For any sufficiently smooth and localized mother wavelet $\psi$, there is a constant…