Related papers: Crowding at the Front of the Marathon Packs
Nonreciprocal interaction crowd systems, such as human-human, human-vehicle, and human-robot systems, often have serious impacts on pedestrian safety and social order. A more comprehensive understanding of these systems is needed to…
Flocking is a fascinating phenomenon observed across a wide range of living organisms. We investigate, based on a simple self-propelled particle model, how the emergence of ordered motion in a collectively moving group is influenced by the…
We present here a system with collection of random walks relaying a signal in one dimension in the presence of delays. We are interested in the time for a signal to travel from one end (start) to the other end (finish) of the lined group of…
Pedestrian routing choices play a crucial role in shaping collective crowd dynamics, yet the influence of interactions among unfamiliar individuals remains poorly understood. In this study, we analyze real-world pedestrian behavior at a…
We calculate the probability for rapidity gaps in the parton cascade for different approximations within the perturbative QCD and compare the results with recent measurements. The aim is to find out whether the dual connection between the…
We present a closed-form expression for the survival probability of a biased random walker to first reach a target site on a 1D lattice. The expression holds for any step number $N$ and is computationally faster than non-closed-form results…
Empirical and numerical microscopic features of moving traffic jams are presented. Based on a single vehicle data analysis, it is found that within wide moving jams, i.e., between the upstream and downstream jam fronts there is a complex…
We consider Sinai's random walk in random environment. We prove that infinitely often (i.o.) the size of the concentration neighborhood of this random walk is almost surely bounded. As an application we get that i.o. the maximal distance…
We prove that in any finite set of $\mathbb Z^d$ with $d\ge 3$, there is a subset whose capacity and volume are both of the same order as the capacity of the initial set. As an application we obtain estimates on the probability of {\it…
We study sorting of permutations by random swaps if each comparison gives the wrong result with some fixed probability $p<1/2$. We use this process as prototype for the behaviour of randomized, comparison-based optimization heuristics in…
Crowd counting, which has been widely adopted for estimating the number of people in safety-critical scenes, is shown to be vulnerable to adversarial examples in the physical world (e.g., adversarial patches). Though harmful, adversarial…
We present a strategy capable of describing basic features of the dynamics of crowds. The behaviour of the crowd is considered from a twofold perspective. We examine both the large scale behaviour of the crowd, and phenomena happening at…
Microscopic mechanisms of natural processes are frequently understood in terms of random walk models by analyzing local particle transitions. This is because these models properly account for dynamic processes at the molecular level and…
An aging population is bringing new challenges to the management of escape routes and facility design in many countries. This paper investigates pedestrian movement properties of crowd with different age compositions. Three pedestrian…
In this paper we deal with pedestrian modeling, aiming at simulating crowd behavior in normal and emergency scenarios, including highly congested mass events. We are specifically concerned with a new agent-based, continuous-in-space,…
Public transportation is a fundamental infrastructure for the daily mobility in cities. Although its capacity is prepared for the usual demand, congestion may rise when huge crowds concentrate in special events such as massive…
A variation of Rosenstock's trapping model in which $N$ independent random walkers are all initially placed upon a site of a one-dimensional lattice in the presence of a {\em one-sided} random distribution (with probability $c$) of…
Pairs of numerically computed trajectories of a chaotic system may coalesce because of finite arithmetic precision. We analyse an example of this phenomenon, showing that it occurs surprisingly frequently. We argue that our model belongs to…
We study the problem of matching agents who arrive at a marketplace over time and leave after d time periods. Agents can only be matched while they are present in the marketplace. Each pair of agents can yield a different match value, and…
We give sharp, uniform estimates for the probability that a random walk of n steps on the reals avoids a half-line [y,infinity) given that it ends at the point x. The estimates hold for general continuous or lattice distributions provided…