arXiv · 1711.02721
Exact analytical solution of irreversible binary dynamics on networks
Abstract
In binary cascade dynamics, the nodes of a graph are in one of two possible states (inactive, active), and nodes in the inactive state make an irreversible transition to the active state, as soon as their precursors satisfy a predetermined condition. We introduce a set of recursive equations to compute the probability of reaching any final state, given an initial state, and a specification of the transition probability function of each node. Because the naive recursive approach for solving these equations takes factorial time in the number of nodes, we also introduce an accelerated algorithm, built around a breath-first search procedure. This algorithm solves the equations as efficiently as possible, in exponential time.
Explore related subjects
Keep this discovery
Edward Laurence, Jean-Gabriel Young, Sergey Melnik, Louis J. Dubé. 2018-03-13. Exact analytical solution of irreversible binary dynamics on networks. https://doi.org/10.1103/physreve.97.032302
Cite the original work for its findings. Save a collection to share your selection of sources.