Related papers: Marathon pacing and elevation change
Using publicly available traffic camera data in New York City, we quantify time-dependent patterns in aggregate pedestrian foot traffic. These patterns exhibit repeatable diurnal behaviors that differ for weekdays and weekends but are…
We introduce a toy model of the "rat race" in which individuals try to better themselves relative to the rest of the population. An individual is characterized by a real-valued fitness and each advances at a constant rate by an amount that…
Human movement prediction is difficult as humans naturally exhibit complex behaviors that can change drastically from one environment to the next. In order to alleviate this issue, we propose a prediction framework that decouples short-term…
We study the relaxation time in the random walk with jumps. The random walk with jumps combines random walk based sampling with uniform node sampling and improves the performance of network analysis and learning tasks. We derive various…
Uncovering the mechanism behind the scaling law in human trajectories is of fundamental significance in understanding many spatio-temporal phenomena. In combination of the exploration and the preferential returns, we propose a simple…
We present a multivariate functional mixed effects model for kinematic data from a large number of recreational runners. The runners' sagittal plane hip and knee angles are modelled jointly as a bivariate function with random effects…
We consider the adaptation dynamics of an asexual population that walks uphill on a rugged fitness landscape which is endowed with large number of local fitness peaks. We work in a parameter regime where only those mutants that are single…
We show how reaction coordinate path lengths affect the relaxation efficiency of a complex system. To this purpose, we consider the metric contributions to the transition rates. These metric contributions preserve informations about the…
The Fast Marching Method is a very popular algorithm to compute times-of-arrival maps (distances map measured in time units). Since their proposal in 1995, it has been applied to many different applications such as robotics, medical…
The mathematical model of J. Keller for predicting World Record race times, based on a simple differential equation of motion, predicted quite well the records of the day. One of its shortcoming is that it neglects to account for a…
Running is part of almost every sport, and requires a great amount of stamina, endurance, mental toughness and overall strength. At every step, the foot experiences ground reaction forces necessary to support the motion of the body. With…
We study a random walk on $\mathbb{Z}$ which evolves in a dynamic environment determined by its own trajectory. Sites flip back and forth between two modes, $p$ and $q$. $R$ consecutive right jumps from a site in the $q$-mode are required…
Among random sampling methods, Markov Chain Monte Carlo algorithms are foremost. Using a combination of analytical and numerical approaches, we study their convergence properties towards the steady state, within a random walk Metropolis…
Galloping is a common high-speed gait in both animals and quadrupedal robots, yet its energetic characteristics remain insufficiently explored. This study systematically analyzes a large number of possible galloping gaits by categorizing…
Pedestrian behaviours tend to depend on the type of facility. Therefore accurate predictions of pedestrians movements in complex geometries (including corridor, bottleneck or intersection) are difficult to achieve for classical models with…
In spite of precautions to avoid the harmful effects of extreme events, we experience recurrently phenomena that overcome the preventive barriers. These barriers usually increase drastically right after the occurrence of such extreme…
We present a mathematical model for optimizing breakaway strategies in competitive cycling, balancing power expenditure, aerodynamic drag, and crashing. Our framework incorporates probabilistic crash dynamics, allowing a cyclist's risk…
The random walk with choice is a well known variation to the random walk that first selects a subset of $d$ neighbours nodes and then decides to move to the node which maximizes the value of a certain metric; this metric captures the number…
When human participants repeatedly encounter a velocity-dependent force field that distorts their movement trajectories, they adapt their motor behavior to recover straight trajectories. Computational models suggest that adaptation to a…
We present a comparative study of several algorithms for an in-plane random walk with a variable step. The goal is to check the efficiency of the algorithm in the case where the random walk terminates at some boundary. We recently found…