Location of Repository

Evolving graphs: dynamical models, inverse\ud problems and propagation

By Peter Grindrod and Desmond J Higham

Abstract

Applications such as neuroscience, telecommunication, online social networking,\ud transport and retail trading give rise to connectivity patterns that change over time.\ud In this work, we address the resulting need for network models and computational\ud algorithms that deal with dynamic links. We introduce a new class of evolving\ud range-dependent random graphs that gives a tractable framework for modelling and\ud simulation. We develop a spectral algorithm for calibrating a set of edge ranges from\ud a sequence of network snapshots and give a proof of principle illustration on some\ud neuroscience data. We also show how the model can be used computationally and\ud analytically to investigate the scenario where an evolutionary process, such as an\ud epidemic, takes place on an evolving network. This allows us to study the cumulative\ud effect of two distinct types of dynamics

Topics: 519
Publisher: Royal Society Publishing
Year: 2010
OAI identifier: oai:centaur.reading.ac.uk:2052

Suggested articles

Preview

Citations

  1. (2001). A min-max cut algorithm for graph partitioning and data clustering,
  2. (2007). A small world phenomenon for Markov chains,
  3. (1997). An analysis of spectral envelopereduction via quadratic assignment problems,
  4. (1995). An improved spectral bisection algorithm and its application to dynamic load balancing, doi
  5. (1998). Collective dynamics of ‘smallworld’ networks,
  6. (2008). Computational Science and Engineering,
  7. (2009). Detection of neural correlates of self-paced motor activity using empirical mode decomposition phase locking analysis, doi
  8. Evolving networks,
  9. (2008). Flooding time in edge-Markovian dynamic graphs,
  10. Geometric de-noising of protein-protein interaction networks, PLoS Computational Biology,
  11. (2008). How to explore a fastchanging world (cover time of a simple random walk on evolving graphs),
  12. (2009). Information spreading in stationary Markovian evolving graphs,
  13. (2000). Mean-field solution of the small-world network model,
  14. (2009). Microdynamics in stationary complex networks,
  15. (2004). Modeling interactome: scale-free or geometric?,
  16. (2000). Navigation in a small world,
  17. Periodic reordering,
  18. (2008). Random Networks for Communication: From Statistical Physics to Information Systems,
  19. (2002). Range-dependent random graphs and their application to modeling large small-world proteome datasets, Physical Review E,
  20. (2005). Spectral reordering of a range-dependent weighted random graph,
  21. (2000). The small-world phenomenon: An algorithmic perspective,
  22. (2003). Unravelling small world networks,

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