Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 0708.3339

Crowd turbulence: the physics of crowd disasters

Dirk Helbing·Anders Johansson·Habib Z. Al-Abideen
View original source ↗Read source document ↗Export metadata ↓

Abstract

The panic stampede is a serious concern during mass events like soccer championship games. Despite huge numbers of security forces and crowd control measures, hundreds of lives are lost in crowd disasters each year. An analysis of video recordings of the annual pilgrimage in Makkah reveals how high-density crowds develop to turbulent dynamics and earthquake-like eruptions, which is impossible to control.

Explore related subjects

physics.soc-phphysics.flu-dyn

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dirk Helbing, Anders Johansson, Habib Z. Al-Abideen. 2007-08-24. Crowd turbulence: the physics of crowd disasters. https://arxiv.org/abs/0708.3339

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

KEEP EXPLORING

Related papers

arXiv2026

Adaptive cut reveals multiscale complexity in networks

Hierarchical clustering and community detection are important problems in machine learning and complex network analysis. A common approach to identify clusters is to simply cut dendrograms at some threshold. However, single-level cuts are often suboptimal in terms of capturing underlying structure in the data, especially when the dendrogram is unbalanced. In this paper, we present the adaptive cut, a novel method that leverages the hierarchical structure of dendrograms by employing multi-level cuts to overcome the limitations of single-level approaches. The adaptive cut optimizes an objective function using a Markov chain Monte Carlo with simulated annealing, resulting in better partitions. We demonstrate the effectiveness of the adaptive cut through applications to link clustering and modularity optimization, but note that the method is applicable to any clustering task that relies on a dendrogram and an objective function. Beyond the adaptive cut, we introduce the balancedness score, an information-theoretic metric that quantifies how balanced a dendrogram is. Balancedness predicts the potential benefits of using multi-level cuts. For the community detection examples, we evaluate our method on more than 200 real-world networks and multiple synthetic datasets, demonstrating significant improvements in partition density and modularity over traditional single-cut approaches. In addition, we show the generality of the adaptive cut by applying it across various hierarchical clustering techniques and objective functions. Our results indicate that the adaptive cut provides a robust and versatile tool for improving clustering outcomes.

physics.soc-ph↗
arXiv2026

Reconsidering Global Comparisons of Scientist Trustworthiness

In a reanalysis of perceived scientist trustworthiness across 68 countries/regions, measurement-aligned indicated limitations in the cross-national comparability of the original measurement structure. Some country/region rankings and predictor associations varied across alternative scoring approaches, suggesting the value of considering measurement invariance when interpreting cross-national findings. Future research could use diverse methods to strengthen cross-cultural measurement validity.

physics.soc-ph↗
arXiv2026

An Eco-Friendly Tourism Trip Planner Driven by Z-Number Uncertainty: Evidence from Baku, Dubai, Abu Dhabi, Tashkent, and Istanbul

Deployed tourism trip planners ingest travel times and ratings as exact numbers, although routing services return travel times that vary with the hour of departure and a platform rating may rest on a handful of reviews or on tens of thousands. We present an eco-friendly trip planner that represents both quantities as Z-numbers, which pair a fuzzy restriction on a value with a fuzzy reliability on the evidence behind it, and that constructs them directly from routing-service observations at six departure hours and from platform review counts rather than from linguistic elicitation. A hybrid loss combines score, carbon, travel-time, and reliability terms, and an adaptive large neighborhood search returns single-day itineraries with per-leg reliability annotations through a conversational front end. We compare the planner with a crisp-mean baseline under an identical optimizer in Baku, Dubai, Abu Dhabi, Tashkent, and Istanbul, with fifteen points of interest and thirty seeds per city, and we evaluate the selected itineraries on their trip carbon and their total travel time. Pooled over 150 seed-paired runs, the planner lowers trip carbon from 3.24 to 2.61 kg (19.3%, Wilcoxon p = 0.017; city-clustered bootstrap interval 6.4% to 26.7%) and travel time from 123 to 109 minutes per trip (11.5%, p = 2.8e-10; interval 5.0% to 18.2%). The travel-time reductions survive a Holm correction in Baku, Istanbul, and Abu Dhabi, the carbon reduction is significant in Baku and large but uncertain in the dispersed catalogs of Dubai and Abu Dhabi, and neither metric changes in Tashkent. Review counts were measured for Baku and estimated for the other four cities, and the comparison involves a single baseline, so the results establish feasibility and direction rather than a general advantage. Code, routing caches, frozen routing tables, and per-seed results are openly released.

physics.soc-ph↗