Literature DB >> 19256916

Critical line in random-threshold networks with inhomogeneous thresholds.

Thimo Rohlf1.   

Abstract

We calculate analytically the critical connectivity K_{c} of random-threshold networks (RTNs) for homogeneous and inhomogeneous thresholds, and confirm the results by numerical simulations. We find a superlinear increase of K_{c} with the (average) absolute threshold mid R:hmid R: , which approaches K_{c}(mid R:hmid R:) approximately h;{2}(2lnmid R:hmid R:) for large mid R:hmid R: , and show that this asymptotic scaling is universal for RTNs with Poissonian distributed connectivity and threshold distributions with a variance that grows slower than h;{2} . Interestingly, we find that inhomogeneous distribution of thresholds leads to increased propagation of perturbations for sparsely connected networks, while for densely connected networks damage is reduced; the crossover point yields a characteristic connectivity K_{d} , that has no counterpart in Boolean networks with transition functions not restricted to threshold-dependent switching. Last, local correlations between node thresholds and in-degree are introduced. Here, numerical simulations show that even weak (anti)correlations can lead to a transition from ordered to chaotic dynamics, and vice versa.

Year:  2008        PMID: 19256916     DOI: 10.1103/PhysRevE.78.066118

Source DB:  PubMed          Journal:  Phys Rev E Stat Nonlin Soft Matter Phys        ISSN: 1539-3755


  1 in total

1.  Hodge Decomposition of Information Flow on Small-World Networks.

Authors:  Taichi Haruna; Yuuya Fujiki
Journal:  Front Neural Circuits       Date:  2016-09-28       Impact factor: 3.492

  1 in total

北京卡尤迪生物科技股份有限公司 © 2022-2023.