2000 character limit reached
Burstiness and tie reinforcement in time varying social networks
Published 29 Jul 2016 in physics.soc-ph, cond-mat.stat-mech, and cs.SI | (1607.08910v1)
Abstract: We introduce a time-varying network model accounting for burstiness and tie reinforcement observed in social networks. The analytical solution indicates a non-trivial phase diagram determined by the competition of the leading terms of the two processes. We test our results against numerical simulations, and compare the analytical predictions with an empirical dataset finding good agreements between them. The presented framework can be used to classify the dynamical features of real social networks and to gather new insights about the effects of social dynamics on ongoing spreading processes.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.