scholarly journals Fast asynchronous updating algorithms for k-shell indices

2017 ◽  
Vol 482 ◽  
pp. 524-531 ◽  
Author(s):  
Yan-Li Lee ◽  
Tao Zhou
Author(s):  
Teijiro Isokawa ◽  
Ferdinand Peper ◽  
Shoji Ishibashi ◽  
Toshifumi Minemoto ◽  
Nobuyuki Matsui

2002 ◽  
Vol 12 (03) ◽  
pp. 663-669 ◽  
Author(s):  
SUDESHNA SINHA

It was observed in earlier studies, that the mean field of globally coupled maps evolving under synchronous updating rules violated the law of large numbers, and this remarkable result generated widespread research interest. In this work we demonstrate that incorporating increasing degrees of asynchronicity in the updating rules rapidly restores the statistical behavior of the mean field. This is clear from the decay of the mean square deviation of the mean field with respect to lattice size N, for varying degrees of asynchronicity, which shows 1/N behavior upto very large N even when the updating is far from fully asynchronous. This is also evidenced through increasing 1/f2 behavior regimes in the power spectrum of the mean field under increasing asynchronicity.


2019 ◽  
Vol 361 ◽  
pp. 377-388 ◽  
Author(s):  
Shi-Min Cai ◽  
Xuan-Hao Chen ◽  
Xi-Jun Ye ◽  
Ming Tang

Author(s):  
Souvik Roy ◽  
Sukanta Das

In the light of recent developments in the theory of reversibility for asynchronous cellular automata, we attempt to explore the dynamics of recurrent rules under fully asynchronous updating scheme. Depending on the reachability of the configurations for a communication class during the evolution of the system, we classify the recurrent rules into two classes — partially exposed recurrent system and fully exposed recurrent system.


2012 ◽  
Vol 18 (4) ◽  
pp. 385-397 ◽  
Author(s):  
Larry Bull

This short article presents an abstract, tunable model of genomic structural change within the cell life cycle and explores its use with simulated evolution. A well-known Boolean model of genetic regulatory networks is extended to include changes in node connectivity based upon the current cell state to begin to capture some of the effects of transposable elements. The evolvability of such networks is explored using a version of the NK model of fitness landscapes with both synchronous and asynchronous updating. Structural dynamism is found to be selected for in nonstationary environments with both update schemes and subsequently shown capable of providing a mechanism for evolutionary innovation when such reorganizations are inherited. This is also found to be the case in stationary environments with asynchronous updating.


Entropy ◽  
2021 ◽  
Vol 23 (11) ◽  
pp. 1376
Author(s):  
Yukio-Pegio Gunji ◽  
Daisuke Uragami

Asynchronously tuned elementary cellular automata (AT-ECA) are described with respect to the relationship between active and passive updating, and that spells out the relationship between synchronous and asynchronous updating. Mutual tuning between synchronous and asynchronous updating can be interpreted as the model for dissipative structure, and that can reveal the critical property in the phase transition from order to chaos. Since asynchronous tuning easily makes behavior at the edge of chaos, the property of AT-ECA is called the unfolded edge of chaos. The computational power of AT-ECA is evaluated by the quantitative measure of computational universality and efficiency. It shows that the computational efficiency of AT-ECA is much higher than that of synchronous ECA and asynchronous ECA.


Sign in / Sign up

Export Citation Format

Share Document