Models for evolving networks: with applications in telecommunication and online activities

Peter Grindrod; Desmond J. Higham

doi:10.1093/imaman/dpr001

Models for evolving networks: with applications in telecommunication and online activities

Peter Grindrod, Desmond J. Higham

Mathematics And Statistics

Research output: Contribution to journal › Article › peer-review

5 Citations (Scopus)

Abstract

Driven by a range of modern applications that includes telecommunications, e-business and online social interaction, recent ideas in complex networks can be extended to the case of time-varying connectivity. Here, we propose a general framework for modelling and simulating such dynamic networks, and we explain how the long-time behaviour may reveal important information about the mechanisms underlying the evolution.

Original language	English
Pages (from-to)	1-15
Number of pages	15
Journal	IMA Journal of Management Mathematics
Volume	23
Issue number	1
Early online date	14 Feb 2011
DOIs	https://doi.org/10.1093/imaman/dpr001
Publication status	Published - Jan 2012

Keywords

birth and death process
graph theory
random graph
range-dependent edge

Access to Document

10.1093/imaman/dpr001

Commercial advantage through computational discovery of dynamic communicators in large digital networks
Higham, D. (Participant), Estrada, E. (Participant) & Grindrod, P. (Participant)
Impact: Impact - for External Portal › Economic and commerce

File

Cite this

@article{c2748057efbd4284a2e5657ccba549be,

title = "Models for evolving networks: with applications in telecommunication and online activities",

abstract = "Driven by a range of modern applications that includes telecommunications, e-business and online social interaction, recent ideas in complex networks can be extended to the case of time-varying connectivity. Here, we propose a general framework for modelling and simulating such dynamic networks, and we explain how the long-time behaviour may reveal important information about the mechanisms underlying the evolution. ",

keywords = "birth and death process , graph theory , random graph , range-dependent edge ",

author = "Peter Grindrod and Higham, \{Desmond J.\}",

note = "Date changed",

year = "2012",

month = jan,

doi = "10.1093/imaman/dpr001",

language = "English",

volume = "23",

pages = "1--15",

journal = "IMA Journal of Management Mathematics",

issn = "1471-678X",

publisher = "Oxford University Press",

number = "1",

}

TY - JOUR

T1 - Models for evolving networks

T2 - with applications in telecommunication and online activities

AU - Grindrod, Peter

AU - Higham, Desmond J.

N1 - Date changed

PY - 2012/1

Y1 - 2012/1

N2 - Driven by a range of modern applications that includes telecommunications, e-business and online social interaction, recent ideas in complex networks can be extended to the case of time-varying connectivity. Here, we propose a general framework for modelling and simulating such dynamic networks, and we explain how the long-time behaviour may reveal important information about the mechanisms underlying the evolution.

AB - Driven by a range of modern applications that includes telecommunications, e-business and online social interaction, recent ideas in complex networks can be extended to the case of time-varying connectivity. Here, we propose a general framework for modelling and simulating such dynamic networks, and we explain how the long-time behaviour may reveal important information about the mechanisms underlying the evolution.

KW - birth and death process

KW - graph theory

KW - random graph

KW - range-dependent edge

U2 - 10.1093/imaman/dpr001

DO - 10.1093/imaman/dpr001

M3 - Article

SN - 1471-678X

VL - 23

SP - 1

EP - 15

JO - IMA Journal of Management Mathematics

JF - IMA Journal of Management Mathematics

IS - 1

ER -

Models for evolving networks: with applications in telecommunication and online activities

Abstract

Keywords

Access to Document

Fingerprint

Impacts

Commercial advantage through computational discovery of dynamic communicators in large digital networks

Cite this