Evolving graphs: Dynamical models, inverse problems and propagation
Applications such as neuroscience, telecommunication, online 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 introduc...
| Main Authors: | , |
|---|---|
| Formato: | Journal article |
| Idioma: | English |
| Publicado: |
2010
|
| _version_ | 1826298343436845056 |
|---|---|
| author | Grindrod, P Higham, D |
| author_facet | Grindrod, P Higham, D |
| author_sort | Grindrod, P |
| collection | OXFORD |
| description | Applications such as neuroscience, telecommunication, online 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 tractable framework for modelling 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. © 2010 The Royal Society. |
| first_indexed | 2024-03-07T04:45:24Z |
| format | Journal article |
| id | oxford-uuid:d312555c-14b0-4a7b-85cd-e6f3b38d942c |
| institution | University of Oxford |
| language | English |
| last_indexed | 2024-03-07T04:45:24Z |
| publishDate | 2010 |
| record_format | dspace |
| spelling | oxford-uuid:d312555c-14b0-4a7b-85cd-e6f3b38d942c2022-03-27T08:08:45ZEvolving graphs: Dynamical models, inverse problems and propagationJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:d312555c-14b0-4a7b-85cd-e6f3b38d942cEnglishSymplectic Elements at Oxford2010Grindrod, PHigham, DApplications such as neuroscience, telecommunication, online 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 tractable framework for modelling 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. © 2010 The Royal Society. |
| spellingShingle | Grindrod, P Higham, D Evolving graphs: Dynamical models, inverse problems and propagation |
| title | Evolving graphs: Dynamical models, inverse problems and propagation |
| title_full | Evolving graphs: Dynamical models, inverse problems and propagation |
| title_fullStr | Evolving graphs: Dynamical models, inverse problems and propagation |
| title_full_unstemmed | Evolving graphs: Dynamical models, inverse problems and propagation |
| title_short | Evolving graphs: Dynamical models, inverse problems and propagation |
| title_sort | evolving graphs dynamical models inverse problems and propagation |
| work_keys_str_mv | AT grindrodp evolvinggraphsdynamicalmodelsinverseproblemsandpropagation AT highamd evolvinggraphsdynamicalmodelsinverseproblemsandpropagation |