Applications such as neuroscience, telecommunication, on-line social networking, transport and retail trading give rise to connectivity patterns that change over time. In this work we address the resulting need for network models and computational algorithms that deal with dynamic links. We introduce a new class of evolving range-dependent random graphs that gives a realistic but tractable framework for modeling and simulation. We develop a spectral algorithm for calibrating a set of edge ranges from a sequence of network snapshots, and give a proof of principle illustration on some neuroscience data. We also show how the model can be used computationally and analytically to investigate the scenario where an evolutionary process, such as an epidemic, takes place on an evolving network. This allows us to study the cumulative effect of two distinct types of dynamics.
|Number of pages||18|
|Journal||Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences|
|Publication status||Published - 8 Mar 2010|
- birth and death process
- random graph
- reproduction rate
Grindrod, P., & Higham, D. J. (2010). Evolving graphs: dynamical models, inverse problems and propagation. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences , 466(2115), 753-770. https://doi.org/10.1098/rspa.2009.0456