Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
110 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Random walks on activity-driven networks with attractiveness (1701.06449v2)

Published 23 Jan 2017 in physics.soc-ph, cond-mat.stat-mech, and cs.SI

Abstract: Virtually all real-world networks are dynamical entities. In social networks, the propensity of nodes to engage in social interactions (activity) and their chances to be selected by active nodes (attractiveness) are heterogeneously distributed. Here, we present a time-varying network model where each node and the dynamical formation of ties are characterised by these two features. We study how these properties affect random walk processes unfolding on the network when the time scales describing the process and the network evolution are comparable. We derive analytical solutions for the stationary state and the mean first passage time of the process and we study cases informed by empirical observations of social networks. Our work shows that previously disregarded properties of real social systems such heterogeneous distributions of activity and attractiveness as well as the correlations between them, substantially affect the dynamical process unfolding on the network.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (4)
  1. Laura Alessandretti (26 papers)
  2. Kaiyuan Sun (6 papers)
  3. Andrea Baronchelli (82 papers)
  4. Nicola Perra (44 papers)
Citations (11)

Summary

We haven't generated a summary for this paper yet.