1202.6526 (Shun-ichi Amari et al.)

State concentration measure of quickness in Kauffman-type networks    [PDF]

Shun-ichi Amari, Hiroyasu Ando, Taro Toyoizumi, Naoki Masuda

The quickness of large network dynamics is quantified by the length of transient paths, an analytically intractable measure. We address this dilemma with a unified framework termed state concentration, defined as the exponent of the average number of t-step ancestors in state transition graphs, where nodes represent states and directed links are transitions. Using this exponent to interrogate random Boolean and majority vote networks, we find that dense majority vote networks can achieve both quickness and robustness, owing in part to long-tailed indegree distributions.

View original: http://arxiv.org/abs/1202.6526