Semi-Markov Graph Dynamics

  title={Semi-Markov Graph Dynamics},
  author={Marco Raberto and Fabio Rapallo and Enrico Scalas},
  journal={PLoS ONE},
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… 

Figures and Tables from this paper

On discrete-time semi-Markov processes

In the last years many authors studied a class of continuous time semi-Markov processes obtained by time-changing Markov processes by hitting times of independent subordinators. Such processes are

Bounds for mixing times for finite semi-Markov processes with heavy-tail jump distribution

Consider a Markov chain with finite state space and suppose you wish to change time replacing the integer step index n with a random counting process N ( t ). What happens to the mixing time of the

Max-Plus Objects to Study the Complexity of Graphs

This work defines a new object HG, called the mp-chart of G, in the max-plus algebra and shows how to compute the mean and the variance of HG in terms of the adjacency matrix of G and gives a central limit theorem for HG.

Relaxation patterns and semi-Markov dynamics

On semi-Markov processes and their Kolmogorov's integro-differential equations

Semi-Markov processes, integro-differential equations and anomalous diffusion-aggregation

In this article integro-differential Volterra equations whose convolution kernel depends on the vector variable are considered and a connection of these equations with a class of semi-Markov

Banking Networks and Leverage Dependence: Evidence from Selected Emerging Countries

We use bank-level balance sheet data from 2005 to 2010 to study interactions within the banking system of five emerging countries: Argentina, Brazil, Mexico, South Africa, and Taiwan. For each

Banking Networks and Leverage Dependence in Emerging Countries

This work constructs banking networks using bank-level balance sheet data from 2005 to 2010 from five emerging countries and simulates the banking system through a model of corporate and interbank loans with credit shocks, where links between banks arise due to insufficient liquidity.



Closed-form solutions for continuous time random walks on finite chains.

A technique of counting all possible trajectories is introduced and closed-form solutions in Laplace space for the Green's function (propagator) and for the first passage time probability density function (PDF) for nearest neighbor CTRWs in terms of the input waiting time PDFs are derived.

Ergodic transitions in continuous-time random walks.

The distribution of time-averaged observables for continuous-time random walk models described by arbitrary sojourn time probability density functions reveals that such systems are typically nonergodic, in agreement with some recent experimental evidences on the statistics of blinking quantum dots.

Path-probability density functions for semi-Markovian random walks.

  • O. FlomenbomR. Silbey
  • Mathematics
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2007
Here, the recursion relation for the n order path PDF for the same system is derived and solved and these expressions give the most detailed description of arbitrarily inhomogeneous semi-Markovian random walks in 1D.

A fractional generalization of the Poisson processes

It is our intention to provide via fractional calculus a generalization of the pure and compound Poisson processes, which are known to play a fundamental role in renewal theory, without and with

Emergence of scaling in random networks

A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.

Collective dynamics of ‘small-world’ networks

Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs.

Stochastic calculus for uncoupled continuous-time random walks.

It is shown how the definition of the stochastic integrals can be used to easily compute them by Monte Carlo simulation and it is proved that, as a consequence of the martingale transform theorem, if the CTRW is aMartingale, the Itō integral is a Martingale too.

Markov bases and structural zeros

Algebraic Graph Theory

The Laplacian of a Graph and Cuts and Flows are compared to the Rank Polynomial.

Monte Carlo simulation of uncoupled continuous-time random walks yielding a stochastic solution of the space-time fractional diffusion equation.

A numerical method is presented for the Monte Carlo simulation of uncoupled continuous-time random walks with a Lévy alpha -stable distribution of jumps in space and a Mittag-Leffler distribution of waiting times to obtain an accurate approximation of space- and time-fractional diffusion processes.