Evolving graphs: Dynamical models, inverse problems and propagation

Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences

Volumn 466, Issue 2115, 2010, Pages 753-770

  Grindrod, Peter ^a   Higham, Desmond J ^b  

^a UNIVERSITY OF READING   (United Kingdom)

^b UNIVERSITY OF STRATHCLYDE   (United Kingdom)

Author keywords

Birth and death process; Epidemiology; Network; Neuroscience; Random graph; Reproduction rate

Indexed keywords

COMPUTATION THEORY; DIFFERENTIAL EQUATIONS; EPIDEMIOLOGY; INVERSE PROBLEMS; SOCIAL NETWORKING (ONLINE);

BIRTH AND DEATH PROCESS; COMPUTATIONAL ALGORITHM; CONNECTIVITY PATTERN; CUMULATIVE EFFECTS; DYNAMIC LINKS; DYNAMICAL MODEL; EVOLUTIONARY PROCESS; EVOLVING GRAPHS; EVOLVING NETWORKS; MODELLING AND SIMULATIONS; NETWORK MODELS; PROOF OF PRINCIPLES; RANDOM GRAPHS; SOCIAL NETWORKING; SPECTRAL ALGORITHM;

GRAPH THEORY;

EID: 77749304066     PISSN: 13645021     EISSN: 14712946     Source Type: Journal    
DOI: 10.1098/rspa.2009.0456     Document Type: Article

References (26)

1. Avin, C., Koucký, M. & Lotker, Z. 2008 How to explore a fast-changing world (cover time of a simple random walk on evolving graphs). In ICALP '08: Proc. of the 35th Int. colloquium on automata, languages and programming, Part I, pp. 121-132. Berlin, Germany: Springer-Verlag.
2. Borgnat, P., Fleury, E., Guillaume, J.-L., Robardet, C. & Scherrer, A. 2008 Description and simulation of dynamic mobility networks. Comp. Netw. 52, 2842-2858. (doi:10.1061/j.comnet.2008.06.077)
3. Clementi, A. E., Macci, C., Monti, A., Pasquale, F. & Silvestri, R. 2008 Flooding time in edge-Markovian dynamic graphs. In Proc. of the 27th Annual ACM SIGACT-SIGOPS Symp. on principles of distributed computing (PODC'08), pp. 213-222. New York, NY: ACM Press.
4. Clementi, A. E., Monti, A., Pasquale, F. & Silvestri, R. In press. Information spreading in stationary Markovian evolving graphs. In Proc. of the 23rd IEEE Int. Parallel and Distributed Processing Symp. (IPDPS'09).
5. Diekmann, O., Heesterbeek, J. A. P. & Metz, J. A. J. 1990 On the definition and the computation of the basic reproduction ratio R0 in models for infectious diseases in heterogeneous populations. J. Math. Biol. 28, 365-382. (doi:10.1007/BF00178324)
6. Ding, C. H. Q., He, X., Zha, H., Gu, M. & Simon, H. D. 2001 A min-max cut algorithm for graph partitioning and data clustering. In Proc. of the 1st IEEE Conf. on data mining. pp. 107-114. Washington, DC: IEEE Computer Society.
7. Franceschetti, M. & Meester, R. 2008 Random networks for communication: from statistical physics to information systems. Cambridge Series in Statistical and Probabilistic Mathematics. Cambridge, UK: Cambridge University Press.
8. Gautreau, A., Barrat, A. & Barthelemy, M. 2009 Microdynamics in stationary complex networks. Proc. Natl Acad. Sci. USA 106, 8847-8852. (doi:10.1073/pnas.0811113106)
9. George, A. & Pothen, A. 1997 An analysis of spectral envelope reduction via quadratic assignment problems. SIAM J. Matrix Anal. Appl. 18, 706-732. (doi:10.1137/S089547989427470X)
10. Grindrod, P. 2002 Range-dependent random graphs and their application to modeling large small-world proteome datasets. Phys. Rev. E 66, 066 702-1-066 702-7. (doi:10.1103/PhysRevE.66.066702)
11. Grindrod, P., Higham, D. J. & Kalna, G. Submitted. Periodic reordering, IMA J. Numer. Anal.
12. Higham, D. J. 2003 Unravelling small world networks. J. Comp. Appl. Math. 158, 61-74. (doi:10.1016/S0377-0427(03)00471-0)
13. Higham, D. J. 2005 Spectral reordering of a range-dependent weighted random graph. IMA J. Numer. Anal. 25, 443-457. (doi:10.1093/imanum/dri003)
14. Higham, D. J. 2007 A small world phenomenon for Markov chains. SIAM Rev. 49, 91-108. (doi:10.1137/060664987)
15. Kao, R. R., Green, D. M., Johnson, J. & Kiss, I. Z. 2007 Disease dynamics over very different time-scales: foot-and-mouth disease and scrapie on the network of livestock movements in the UK. J. R. Soc. Interface 4, 907-916. (doi:10.1098/rsif.2007.1129)
16. Kleinberg, J. 2000a Navigation in a small world. Nature 406, 845. (doi:10.1038/35022643)
17. Kleinberg, J. 2000b The small-world phenomenon: an algorithmic perspective. In Proc. 32nd ACM Symp. on theory of computing, pp. 163-170.
18. Kuchaiev, O., Rašajski, M., Higham, D. J. & Pr?zulj, N. 2009 Geometric de-noising of protein-protein interaction networks. PLoS Comput. Biol. 5, e1000454. (doi:10.1371/journal.pcbi.1000454)
19. Newman, M. E. J., Moore, C. & Watts, D. J. 2000 Mean-field solution of the small-world network model. Phys. Rev. Lett. 84, 3201-3204. (doi:10.1103/PhysRevLett.84.3201)
20. Pržulj, N., Corneil, D. G. & Jurisica, I. 2004 Modeling interactome: scale-free or geometric? Bioinformatics 20, 3508-3515. (doi:10.1093/bioinformatics/bth436)
21. Saramäki, J. & Kaski, K. 2005 Modeling epidemics with dynamic small-world networks. J. Theor. Biol. 234, 413-421. (doi:10.1016/j.jtbi.2004.12.003)
22. Strang, G. 2008 Computational science and engineering.Wellesley, MA:Wellesley-Cambridge Press.
23. Sweeney-Reed, C. M. & Nasuto, S. J. In press. Detection of neural correlates of self-paced motor activity using empirical mode decomposition phase locking analysis. J. Neurosci. Methods 184, 54-70.
24. Van Driessche, R. & Roose, D. 1995 An improved spectral bisection algorithm and its application to dynamic load balancing, Parallel Comput. 21, 29-48. (doi:10.1016/0167-8191(94)00059-J)
25. Vernon, M. C. & Keeling, M. J. 2009 Representing the UK's cattle herd as static and dynamic networks. Proc. R. Soc. B 276, 469-476. (doi:10.1098/rspb.2008.1009)
26. Watts, D. J. & Strogatz, S. H. 1998 Collective dynamics of 'small-world' networks. Nature 393, 440-442. (doi:10.1038/30918)