Pith. sign in

REVIEW 2 cited by

Simple crowd dynamics to generate complex temporal contact networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2405.06508 v2 pith:J6HXDNR7 submitted 2024-05-10 physics.soc-ph cond-mat.stat-mech

classification physics.soc-phcond-mat.stat-mech
keywords contactnetworksmodelsdurationsdynamicsempiricalparticlesimple
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Empirical contact networks or interaction networks demonstrate peculiar characteristics stemming from the fundamental social, psychological, physical mechanisms governing human interactions. Although these mechanisms are complex, we test whether we are able to reproduce some dynamical properties of these empirical networks from relatively simple models. In this study, we perform simulations for a range of 2D models of particle dynamics, namely the Random Walk, Active Brownian Particles, and Vicsek models, to generate artificial contact networks. We investigate temporal properties of these contact networks: the distributions of contact durations, inter-contact durations and number of contact per pair of particle. We demonstrate that the distribution of inter-contact durations can be recovered by the dynamics of these simple crowd particle models, and show that it is simply related to the well-know first-return process, which explains the -3/2 exponent that is found in both the numerical models and empirical contact networks.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Modeling memory in time-respecting paths on temporal networks

    physics.soc-ph 2025-11 conditional novelty 6.0 of 10

    A one-parameter 'return to previously visited nodes' model reveals strong memory in time-respecting paths across eight human-proximity datasets, and higher memory slows diffusion.

  2. Streaming Model Cascades for Semantic SQL

    cs.DB 2026-04 unverdicted novelty 5.5 of 10

    SUPG-IT and GAMCAL route streaming semantic-SQL rows through cheap proxies with joint precision/recall guarantees or a single cost-error tradeoff, cutting oracle calls while keeping high F1.

Pith tools