Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2202.05308

Preventing congestion in crowd dynamics caused by reversing flow

Giuseppe G. Amaro·Emiliano Cristiani·Marta Menci
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper we devise a microscopic (agent-based) mathematical model for reproducing crowd behaviour in a specific scenario: a number of pedestrians, consisting of numerous social groups, flow along a corridor until a gate located at the end of the corridor closes. People are not informed about the closure of the gate and perceive the blockage observing dynamically the local crowd conditions. Once people become aware of the new conditions, they stop and then decide either to stay, waiting for reopening, or to go back and leave the corridor for ever. People going back hit against newly incoming people who are not yet aware of the blockage or have already decided to stay. This creates a dangerous counter-flow which can easily lead to accidents. We run several numerical simulations varying parameters which control the crowd behaviour, in order to understand the factors which have the greatest impact on the dynamics. We conclude with some useful suggestions directed to the organizers of mass events.

Explore related subjects

math.DS

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Giuseppe G. Amaro, Emiliano Cristiani, Marta Menci. 2022-02-10. Preventing congestion in crowd dynamics caused by reversing flow. https://doi.org/10.23939/mmc2022.03.555

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Effective equidistribution of orbits under semisimple groups on congruence quotients

We prove an effective equidistribution result for periodic orbits of semisimple groups on congruence quotients of an ambient semisimple group.This extends a previous work of Einsiedler, Margulis and Venkatesh. The main new feature is that we allow for periodic orbits of semisimple groups with nontrivial centralizer in the ambient group. Our proof uses crucially an effective closing lemma from work of the author with Lindenstrauss, Margulis,Mohammadi, and Shah.

math.DS↗
arXiv2026

Generalized entropy of measure-induced maps

A classical result by E. Glasner and B. Weiss states that the topological entropy of a map $f$ is zero if and only if the topological entropy of its measure-induced map $f_*$ is zero, where $f_*$ is defined as the push-forward of a measure. In this work, we use generalized entropy to distinguish the complexity of these maps and prove that the measure-induced map is much more complex than the original map. Moreover, we introduce the generalized mean dimension, an invariant that is useful for distinguishing dynamical systems with zero mean dimension, including those with the small-boundary property, and we show a relationship between this new invariant and generalized entropy.

math.DS↗
arXiv2026

The endpoint problem for $\varepsilon$-hypercyclicity

For a fixed $0<\varepsilon<1$, F. Bayart asked in 2024 whether there exists an operator $T$ such that, for every $0<δ<1$, $T$ is $δ$-hypercyclic if and only if $δ\in[\varepsilon,1)$. We answer this question affirmatively by constructing a weighted backward shift on $\ell_2(\mathbb N_0,\ell_2(\mathbb N_0))$ with this property.

math.DS↗