Analytically solvable processes on networks

Details Analytically solvable processes on networks Analytically solvable processes on networks

2011-03-11

arxiv.org/abs/1103.2252v2

Physics

Physics and Society

10 pages, 3 figures

Scientific paper

10.1103/PhysRevE.84.016104

We introduce a broad class of analytically solvable processes on networks. In the special case, they reduce to random walk and consensus process - two most basic processes on networks. Our class differs from previous models of interactions (such as stochastic Ising model, cellular automata, infinite particle system, and voter model) in several ways, two most important being: (i) the model is analytically solvable even when the dynamical equation for each node may be different and the network may have an arbitrary finite graph and influence structure; and (ii) in addition, when local dynamic is described by the same evolution equation, the model is decomposable: the equilibrium behavior of the system can be expressed as an explicit function of network topology and node dynamics

Affiliated with

Also associated with

No associations

Rating

Analytically solvable processes on networks 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 Analytically solvable processes on networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Analytically solvable processes on networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-430302