REVIEW 2 cited by
Higher-order modeling of face-to-face interactions
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
read the original abstract
The most fundamental social interactions among humans occur face-to-face. Their features have been extensively studied in recent years, owing to the availability of high-resolution data on individuals' proximity. Mathematical models based on mobile agents have been crucial to understanding the spatio-temporal organization of face-to-face interactions. However, these models focus on dyadic relationships only, failing to characterize interactions in larger groups of individuals. Here, we propose a model in which agents interact with each other by forming groups of different sizes. Each group has a degree of social attractiveness, based on which neighboring agents decide whether to join. Our framework reproduces different properties of groups in face-to-face interactions, including their distribution, the correlation in their number, and their persistence in time, which dyadic models cannot replicate. Furthermore, it captures homophilic patterns at the level of higher-order interactions, going beyond standard pairwise approaches. Our work provides further evidence that higher-order interactions are key to describe human face-to-face contacts, paving the way for further investigation of how group dynamics at a microscopic scale affects social phenomena at a macroscopic scale.
Forward citations
Cited by 2 Pith papers
-
The recurrence of groups inhibits the information spreading under higher-order interactions
Recurring triangular groups in face-to-face contact networks suppress information spreading, and higher-order (triad-level) transmission strengthens this suppression.
-
Streaming Model Cascades for Semantic SQL
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.
Discussion (0). Continue with ORCID to comment.