Bistability Through Triadic Closure

Internet Mathematics

Volumn 8, Issue 4, 2012, Pages 402-423

  Grindrod, Peter ^a   Higham, Desmond J ^b   Parsons, Mark C ^a  

^a UNIVERSITY OF READING   (United Kingdom)

^b UNIVERSITY OF STRATHCLYDE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84896909773     PISSN: 15427951     EISSN: None     Source Type: Journal    
DOI: 10.1080/15427951.2012.714718     Document Type: Article

References (32)

1. C. Avin, M. Koucky, and Z. Lotker. “How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs).” In ICALP’08: Proceedings of the 35th International Colloquium on Automata, Languages and Programming, part I, pp. 121–132. Springer, 2008.
2. A.-L. Barabasi. “The Origin of Bursts and Heavy Tails in Human Dynamics.” Nature 435 (2005), 207–211.
3. A.-L. Barabasi and R. Albert. “Emergence of Scaling in Random Networks.” Science 286 (1999), 509–512.
4. D. S. Bassett, N. F. Wymbs, M. A. Porter, P. J. Mucha, J. M. Carlson, and S. T. Grafton. “Dynamic Reconfiguration of Human Brain Networks during Learning.” Proc. Nat. Acad. Sci. 108 (2011), doi: 10.1073/pnas.1018985108.
5. K. Berman. “Vulnerability of Scheduled Networks and a Generalization of Menger’s Theorem.” Networks 28 (1996), 125–134.
6. E. Bullmore and O. Sporns. “Complex Brain Networks: Graph Theoretical Analysis of Structural and Functional Systems.” Nature Reviews Neuroscience 10 (2009), 186–198.
7. A. E. Clementi, C. Macci, A. Monti, F. Pasquale, and R. Silvestri. “Flooding Time in Edge-Markovian Dynamic Graphs.” In Proceedings of the 27th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC’08), pp. 213–222. ACM Press, 2008.
8. A. E. F. Clementi, F. Pasquale, A. Monti, and R. Silvestri. “Information Spreading in Stationary Markovian Evolving Graphs.” In Proceedings of the 2009 IEEE International Symposium on Parallel and Distributed Processing, Washington, DC, USA, pp. 1–12. IEEE Computer Society, 2009.
9. N. Eagle, A. S. Pentland, and D. Lazer. “Inferring Friendship Network Structure by Using Mobile Phone Data.” Proceedings of the National Academy of Sciences 106 (2009), 15274–15278.
10. P. Esfandiar, F. Bonchi, D. Gleich, C. Greif, L. Lakshmanan, and B.-W. On. “Fast Katz and Commuters: Efficient Estimation of Social Relatedness in Large Networks.” In Algorithms and Models for the Web-Graph, edited by R. Kumar and D. Sivakumar, Lecture Notes in Computer Science 6516, pp. 132–145. Springer, 2010.
11. S. Goodreau, J. A. Kitts, and M. Morris. “Birds of a Feather or Friend of a Friend? Using Exponential Random Graph Models to Investigate Adolescent Friendship Networks.” Demography 46 (2009), 103–126.
12. P. Grindrod and D. J. Higham. “Evolving Graphs: Dynamical Models, Inverse Problems and Propagation.” Proceedings of the Royal Society, Series A 466 (2010), 753–770.
13. P. Grindrod, M. C. Parsons, D. J. Higham, and E. Estrada. “Communicability across Evolving Networks.” Phys. Rev. E 83 (2011), 046120.
14. T. Gross and B. Blasius. “Adaptive Coevolutionary Networks: A Review.” J. Royal Society Interface 5 (2008), 259–271.
15. Y. He, Z. J. Chen, and A. C. Evans. “Small-World Anatomical Networks in the Human Brain Revealed by Cortical Thickness from MRI.” Cerebral Cortex 17 (2007), 2407–2419.
16. P. Holme. “Network Reachability of Real-World Contact Sequences.” Physical Review E 71 (2005), 046119.
17. P. Holme and J. Saramäki. “Temporal Networks.” Physics Reports 519 (2012), 97–125.
18. G. Kossinets and D. J. Watts. “Empirical Analysis of an Evolving Social Network.” Science 311 (2006), 88–90.
19. G. Kossinets, J. Kleinberg, and D. Watts. “The Structure of Information Pathways in a Social Communication Network.” In Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD’08, New York, NY, USA, pp. 435–443. ACM, 2008.
20. D. Liben-Nowell and J. Kleinberg. “The Link- Prediction Problem for Social Networks.” Journal of the American Society for Information Science and Technology 58 (2007), 1019–1031.
21. Y. Liu, M. Liang, Y. Zhou, Y. He, Y. Hao, M. Song, C. Yu, H. Liu, Z. Liu, and T. Jiang. “Disrupted Small-World Networks in Schizophrenia.” Brain 131 (2008), 945–961.
22. Z. Lu, B. Savas, W. Tang, and I. Dhillon. “Supervised Link Prediction Using Multiple Sources.” In IEEE 10th International Conference on Data Mining (ICDM), December 2010, pp. 923–928, 2010.
23. P. J. Mucha, T. Richardson, K. Macon, M. A. Porter, and J.-P. Onnela. “Community Structure in Time-Dependent, Multiscale, and Multiplex Networks.” Science 328 (2010), 876–878.
24. M. E. J. Newman. Networks: An Introduction. Oxford University Press, 2010.
25. M. E. J. Newman, C. Moore, and D. J. Watts. “Mean-Field Solution of the Small-World Network Model.” Physical Review Letters 84 (2000), 3201–3204.
26. G. Strang. Computational Science and Engineering. Wellesley–Cambridge Press, 2008.
27. M. Szell and S. Thurner. “Measuring Social Dynamics in a Massive Multiplayer Online Game.” Social Networks 39 (2010), 313–329.
28. J. Tang, S. Scellato, M. Musolesi, C. Mascolo, and V. Latora. “Small- World Behavior in Time-Varying Graphs.” Physical Review E 81 (2010), 05510.
29. J. Tang, M. Musolesi, C. Mascolo, V. Latora, and V. Nicosia. “Analysing Information Flows and Key Mediators through Temporal Centrality Metrics.” In SNS’10: Proceedings of the 3rd Workshop on Social Network Systems, New York, NY, USA, pp. 1–6. ACM, 2010.
30. A. Wagner. “How the Global Structure of Protein Interaction Networks Evolves.” Proceedings of the Royal Society of London. Series B, Biological Sciences 270 (2003), 457–466.
31. D. J. Watts and S. H. Strogatz. “Collective Dynamics of ‘Small-World’ Networks.” Nature 393 (1998), 440–442.
32. K. Zhao, J. Stehlé, G. Bianconi, and A. Barrat. “Social Network Dynamics of Face-to-Face Interactions.” Physical Review E 83 (2011), 056109+.