Sigeo Ihara | Searcharxiv

arXiv2017

Periodic orbit analysis for the deterministic path-preference traffic flow cellular automaton

The path-preference traffic flow cellular automaton is suggested to model the dynamics of transcription. The main difference from the simple traffic flow model is that it contains another preferential paths at some sites. In this paper, we propose an exact analysis for the simplest version of this model. We find that the number of particles is dominant to the dynamics of this cellular automaton and observed that there are not only expected phase shift but also several gaps as the number of particles increases. By considering the behavior of periodic orbits, we also determine the point where such gaps in the flow appear and the exact value of the flow.

nlin.CG↗

arXiv2008

Structural dependence of robustness and load tolerance in scale-free networks

The structure of complex networks in previous research has been widely described as scale-free networks generated by the preferential attachment model. However, the preferential attachment model does not take into account the detailed topological property observed in real networks. Here we propose the models of scale-free networks which can reproduce the topological assortativity of real networks. With an identical degree distribution and network size, we study the structural robustness and fragility as well as the dynamic change of load intensity when nodes are successively removed under random and various intentional attack strategies. We find that disassortative networks are structurally robust against random attacks and highly load-tolerant, while assortative networks are most resistant to intentional attacks yet significantly fragile against random attacks.

cond-mat.dis-nn↗