University of Sussex
Browse
raberto11.pdf (433.93 kB)

Semi-Markov graph dynamics

Download (433.93 kB)
journal contribution
posted on 2023-06-08, 18:24 authored by Marco Raberto, Fabio Rapallo, Enrico Scalas
In this paper, we outline a model of graph (or network) dynamics based on two ingredients. The first ingredient is a Markov chain on the space of possible graphs. The second ingredient is a semi-Markov counting process of renewal type. The model consists in subordinating the Markov chain to the semi-Markov counting process. In simple words, this means that the chain transitions occur at random time instants called epochs. The model is quite rich and its possible connections with algebraic geometry are briefly discussed. Moreover, for the sake of simplicity, we focus on the space of undirected graphs with a fixed number of nodes. However, in an example, we present an interbank market model where it is meaningful to use directed graphs or even weighted graphs.

History

Publication status

  • Published

File Version

  • Published version

Journal

PLoS ONE

ISSN

1932-6203

Publisher

Public Library of Science

Issue

8

Volume

6

Article number

e23370

Department affiliated with

  • Mathematics Publications

Full text available

  • Yes

Peer reviewed?

  • Yes

Legacy Posted Date

2014-09-24

First Open Access (FOA) Date

2014-09-24

First Compliant Deposit (FCD) Date

2014-09-23

Usage metrics

    University of Sussex (Publications)

    Categories

    No categories selected

    Licence

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC