Network of social groups or Let's have a party
Marian Brandau, Steffen Trimper
Abstract
We present a simple model for growing up and depletion of parties due to the permanent communication between the participants of the events. Because of the rapid exchange of information, everybody is able to evaluate its own and and all other parties by means of the list of its friends. Therefore the number of participants at different parties can be changed incessantly. Depending on the deepness of the social contacts, which will be characterized by a parameter α, a stable distribution of party members emerges. At a critical αc an abrupt depletion of almost all parties is observed and as the consequence all the peoples are assembled at a single party. The model is based on a hierarchical social network. The probability that a certain person is contacted to another one depends on the social distance introduced within the network and homophily parameter α.
Create a lesson
Related papers
Modelling the complex dynamics of online disinformation cascades
Guillermo Romero Moreno, Valentin Robu, Han La Poutré
A data-driven heuristic-ensemble method for behavioural inference in collective-risk dilemma experiments
Marc Sadurní, Martín F. Díaz, Josep Perelló et al.
Learning Social Influence with Unobserved Attention
William Thompson, Moyi Tian, Linh Huynh et al.
A Gauge-Invariant Clustering Coefficient for Complex-Weighted Bipartite Networks
Anjali Waghmare, Yu Tian, Renaud Lambiotte
Tracking High-Impact Researchers Through Highly Cited Tails
Hirushan Sajindra, Eoin Ó Colgáin
Breaking Behavioral Uniformity in Traffic Flow: Analytical Derivation and Numerical Verification of Optimal Cooperative Buffering
Raphael Korbmacher, Antoine Tordeux