Semi-Markov Graph Dynamics

Details Semi-Markov Graph Dynamics Semi-Markov Graph Dynamics

2011-05-11

arxiv.org/abs/1105.2137v1

Mathematics

Probability

25 pages, 4 figures, submitted to PLoS-ONE

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Semi-Markov Graph Dynamics does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Semi-Markov Graph Dynamics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Semi-Markov Graph Dynamics will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-611175