Article thumbnail

Bistability through triadic closure

By Peter Grindrod, Desmond Higham and Mark C. Parsons


We propose and analyse a class of evolving network models suitable for describing a dynamic topological structure. Applications include telecommunication, on-line social behaviour and information processing in neuroscience. We model the evolving network as a discrete time Markov chain, and study a very general framework where, conditioned on the current state, edges appear or disappear independently at the next timestep. We show how to exploit symmetries in the microscopic, localized rules in order to obtain conjugate classes of random graphs that simplify analysis and calibration of a model. Further, we develop a mean field theory for describing network evolution. For a simple but realistic scenario incorporating the triadic closure effect that has been empirically observed by social scientists (friends of friends tend to become friends), the mean field theory predicts bistable dynamics, and computational results confirm this prediction. We also discuss the calibration issue for a set of real cell phone data, and find support for a stratified model, where individuals are assigned to one of two distinct groups having different within-group and across-group dynamic

Topics: QA
Publisher: 'Informa UK Limited'
Year: 2012
DOI identifier: 10.1080/15427951.2012.714718
OAI identifier:

Suggested articles


  1. (2008). Adaptive coevolutionary networks: a review, doi
  2. (2010). Analysing information flows and key mediators through temporal centrality metrics, doi
  3. (2005). asi, The origin of bursts and heavy tails in human dynamics, doi
  4. (2009). Birds of a feather or friend of a friend? Using exponential random graph models to investigate adolescent friendship networks, doi
  5. (1998). Collective dynamics of ‘small-world’ networks,
  6. (2011). Communicability across evolving networks, doi
  7. (2010). Community structure in time-dependent, multiscale, and multiplex networks, doi
  8. (2009). Complex brain networks: graph theoretical analysis of structural and functional systems, doi
  9. (2008). Computational Science and Engineering,
  10. (2008). Disrupted small-world networks in schizophrenia, doi
  11. (2011). Dynamic reconfiguration of human brain networks during learning, doi
  12. (1999). Emergence of scaling in random networks, doi
  13. (2006). Empirical analysis of an evolving social network, doi
  14. (2010). Evolving graphs: Dynamical models, inverse problems and propagation, doi
  15. (2010). Fast Katz and commuters: Efficient estimation of social relatedness in large networks, doi
  16. (2008). Flooding time in edge-Markovian dynamic graphs, doi
  17. (2003). How the global structure of protein interaction networks evolves, doi
  18. (2008). How to explore a fast-changing world (cover time of a simple random walk on evolving graphs), doi
  19. (2009). Inferring friendship network structure by using mobile phone data, doi
  20. (2009). Information spreading in stationary Markovian evolving graphs, doi
  21. (2000). Mean-field solution of the small-world network model, doi
  22. (2010). Measuring social dynamics in a massive multiplayer online game, doi
  23. (2005). Network reachability of real-world contact sequences, Physical Review E, doi
  24. (2010). Networks: An Introduction, doi
  25. (2007). Small-world anatomical networks in the human brain revealed by cortical thickness from MRI, doi
  26. (2010). Smallworld behavior in time-varying graphs, Physical Review E, doi
  27. (2011). Social network dynamics of face-to-face interactions, doi
  28. (2011). Social network dynamics of face-to-face interactions, Physical Review E, doi
  29. (2010). Supervised link prediction using multiple sources, in Data Mining (ICDM), doi
  30. (2011). Temporal Networks, ArXiv e-prints,
  31. (2007). The link-prediction problem for social networks, doi
  32. (2005). The origin of bursts and heavy tails in human dynamics, doi
  33. (2008). The structure of information pathways in a social communication network, doi
  34. (1996). Vulnerability of scheduled networks and a generalization of Menger’s Theorem, doi

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.