Related papers: Crowding at the Front of the Marathon Packs
Next place prediction algorithms are invaluable tools, capable of increasing the efficiency of a wide variety of tasks, ranging from reducing the spreading of diseases to better resource management in areas such as urban planning. In this…
We address the problem of tracking and detecting interactions between the different groups of runners that form during a race. In athletic races control points are set to monitor the progress of athletes over the course. Intuitively, a {\it…
To study gap acceptance behaviour one needs the distribution (or probability density function) of gaps in the opposing stream. Further, in these times of widespread availability of large computing powers, traffic simulation has emerged as a…
Sets of moving entities can form groups which travel together for significant amounts of time. Tracking such groups is an important analysis task in a variety of areas, such as wildlife ecology, urban transport, or sports analysis.…
Recent theoretical works have shown that the NSGA-II efficiently computes the full Pareto front when the population size is large enough. In this work, we study how well it approximates the Pareto front when the population size is smaller.…
Societal complexity may be at a historical peak. Distinct from entropy, complexity tends to rise as systems move away from order, crest at an intermediate state, and decline as entropy continues increasing. The use of a thermodynamic…
The availability of new data sources on human mobility is opening new avenues for investigating the interplay of social networks, human mobility and dynamical processes such as epidemic spreading. Here we analyze data on the time-resolved…
We consider hundreds of thousands of individual economic transactions to ask: how predictable are consumers in their merchant visitation patterns? Our results suggest that, in the long-run, much of our seemingly elective activity is…
We study nearest neighbor random walks on fixed environments of $\mathbb{Z}$ composed of two point types : $(1/2,1/2)$ and $(p,1-p)$ for $p>1/2$. We show that for every environment with density of $p$ drifts bounded by $\lambda$ we have…
This article presents an interdisciplinary study of physical and social psychological effects on crowd dynamics based on a series of bottleneck experiments. Bottlenecks are of particular interest for applications such as crowd management…
Marathons are one of the ultimate challenges of human endeavor. In this paper, we apply recently introduced multifractal techniques which yield a new classification parameter in the processing of physiological data captured on marathon…
The dynamical evolution of many economic, sociological, biological and physical systems tends to be dominated by a relatively small number of unexpected, large changes (`extreme events'). We study the large, internal changes produced in a…
Clogging raises as the principal phenomenon during many evacuation processes of pedestrians in a panic situation. As people push to escape from danger, compression forces may increase to harming levels. Many individuals might fall down,…
People tend to walk in groups, and interactions with those groups have a significant impact on crowd behavior and pedestrian traffic dynamics. Social norms can be seen as unwritten rules regulating people interactions in social settings.…
The asymptotics of the probability that the self-intersection local time of a random walk on $\Z^d$ exceeds its expectation by a large amount is a fascinating subject because of its relation to some models from Statistical Mechanics, to…
This paper presents a sharp approximation of the density of long runs of a random walk conditioned on its end value or by an average of a function of its summands as their number tends to infinity. In the large deviation range of the…
We pose a new and intriguing question motivated by distributed computing regarding random walks on graphs: How long does it take for several independent random walks, starting from the same vertex, to cover an entire graph? We study the…
Modern methods for counting people in crowded scenes rely on deep networks to estimate people densities in individual images. As such, only very few take advantage of temporal consistency in video sequences, and those that do only impose…
We consider a random walk of $n$ steps starting at $x_0=0$ with a double exponential (Laplace) jump distribution. We compute exactly the distribution $p_{k,n}(\Delta)$ of the gap $d_{k,n}$ between the $k^{\rm th}$ and $(k+1)^{\rm th}$…
An overview of the results of new exhaustive computations of gaps between primes in arithmetic progressions is presented. We also give new numerical results for exceptionally large least primes in arithmetic progressions.