semi-markov graph dynamics位图动态.pdfVIP

Semi-Markov Graph Dynamics 1 2 2,3 Marco Raberto , Fabio Rapallo , Enrico Scalas * ` ` 1 Dipartimento di Ingegneria Biofisica ed Elettronica, Universita degli Studi di Genova, Genova, Italy, 2 Dipartimento di Scienze e Tecnologie Avanzate, Universita del Piemonte Orientale ‘‘Amedeo Avogadro’’, Alessandria, Italy, 3 Basque Center for Applied Mathematics, Bizkaia Technology Park, Derio, Spain Abstract 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. Citation: Raberto M, Rapallo F, Scalas E (2011) Semi-Markov Graph Dynamics. PLoS ONE 6(8): e23370. doi:10.1371/journal.pone.0023370 Editor: Matjaz Perc, University of Maribor, Slovenia Received May 21, 2011; Accepted July 13, 2011; Published August 24, 2011 Copyright: 2011 Raberto et al. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in