ترغب بنشر مسار تعليمي؟ اضغط هنا

Critical Line in Random Threshold Networks with Inhomogeneous Thresholds

191   0   0.0 ( 0 )
 نشر من قبل Thimo Rohlf
 تاريخ النشر 2008
  مجال البحث فيزياء
والبحث باللغة English
 تأليف Thimo Rohlf




اسأل ChatGPT حول البحث

We calculate analytically the critical connectivity $K_c$ of Random Threshold Networks (RTN) for homogeneous and inhomogeneous thresholds, and confirm the results by numerical simulations. We find a super-linear increase of $K_c$ with the (average) absolute threshold $|h|$, which approaches $K_c(|h|) sim h^2/(2ln{|h|})$ for large $|h|$, and show that this asymptotic scaling is universal for RTN 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 cross-over point yields a novel, characteristic connectivity $K_d$, that has no counterpart in Boolean networks. 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. It is shown that the naive mean-field assumption typical for the annealed approximation leads to false predictions in this case, since correlations between thresholds and out-degree that emerge as a side-effect strongly modify damage propagation behavior.



قيم البحث

اقرأ أيضاً

119 - D. Bolle , R. Heylen 2007
The inclusion of a macroscopic adaptive threshold is studied for the retrieval dynamics of both layered feedforward and fully connected neural network models with synaptic noise. These two types of architectures require a different method to be solve d numerically. In both cases it is shown that, if the threshold is chosen appropriately as a function of the cross-talk noise and of the activity of the stored patterns, adapting itself automatically in the course of the recall process, an autonomous functioning of the network is guaranteed. This self-control mechanism considerably improves the quality of retrieval, in particular the storage capacity, the basins of attraction and the mutual information content.
63 - D. Bolle , R. Heylen 2006
The inclusion of a macroscopic adaptive threshold is studied for the retrieval dynamics of layered feedforward neural network models with synaptic noise. It is shown that if the threshold is chosen appropriately as a function of the cross-talk noise and of the activity of the stored patterns, adapting itself automatically in the course of the recall process, an autonomous functioning of the network is guaranteed.This self-control mechanism considerably improves the quality of retrieval, in particular the storage capacity, the basins of attraction and the mutual information content.
We systematically study and compare damage spreading at the sparse percolation (SP) limit for random boolean and threshold networks with perturbations that are independent of the network size $N$. This limit is relevant to information and damage prop agation in many technological and natural networks. Using finite size scaling, we identify a new characteristic connectivity $K_s$, at which the average number of damaged nodes $bar d$, after a large number of dynamical updates, is independent of $N$. Based on marginal damage spreading, we determine the critical connectivity $K_c^{sparse}(N)$ for finite $N$ at the SP limit and show that it systematically deviates from $K_c$, established by the annealed approximation, even for large system sizes. Our findings can potentially explain the results recently obtained for gene regulatory networks and have important implications for the evolution of dynamical networks that solve specific computational or functional tasks.
We study a model for a random walk of two classes of particles (A and B). Where both species are present in the same site, the motion of As takes precedence over that of Bs. The model was originally proposed and analyzed in Maragakis et al., Phys. Re v. E 77, 020103 (2008); here we provide additional results. We solve analytically the diffusion coefficients of the two species in lattices for a number of protocols. In networks, we find that the probability of a B particle to be free decreases exponentially with the node degree. In scale-free networks, this leads to localization of the Bs at the hubs and arrest of their motion. To remedy this, we investigate several strategies to avoid trapping of the Bs: moving an A instead of the hindered B; allowing a trapped B to hop with a small probability; biased walk towards non-hub nodes; and limiting the capacity of nodes. We obtain analytic results for lattices and networks, and discuss the advantages and shortcomings of the possible strategies.
Monte Carlo techniques are used to investigate the equilibrium threshold concentration, xe, in the dilute anisotropic antiferromagnet Fe(x)Zn(1-x)F2 in an applied magnetic field, considered to be an ideal random-field Ising model system. Above xe equ ilibrium behavior is observed whereas below xe metastability and domain formation dominate. Monte Carlo results agree very well with experimental data obtained using this system.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا