Asynchronous Updating
Asynchronous Updating is a deterministic update scheme in Boolean network models where, at each time step, a single node is selected according to a prespecified or stochastic rule to update its state based on the current states of its regulators, thereby distinguishing it from synchronous schemes that update all nodes simultaneously.
62
Publications
3.4K
Citations
155
Authors
98
Institutions
Publications per year
2017–2026
18
Parents
62
The H-index of a network node and its relation to degree and coreness
Linyuan Lü, Tao Zhou, Qian-Ming Zhang et al. · Nature Communications · 2016 · 689 citations · Full text
1–5 of 62
155
3
h-index
3
h-index
2
h-index
2
h-index
2
h-index
1–5 of 155
98

Technische Universität Darmstadt
Darmstadt, Germany
4 h-index
9 publications
365 citations
Politecnico di Torino
Turin, Italy
2 h-index
2 publications
81 citations
Princeton University
Princeton, United States
2 h-index
2 publications
29 citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
2 h-index
4 publications
426 citations

Sapienza University of Rome
Rome, Italy
2 h-index
3 publications
51 citations

KTH Royal Institute of Technology
Stockholm, Sweden
2 h-index
3 publications
98 citations
Nanjing University
Nanjing, China
2 h-index
6 publications
159 citations

University of Groningen
Groningen, The Netherlands
2 h-index
3 publications
94 citations
1–8 of 98
PRE · 5 publications · 99 citations
5
h-index
Repository · 3 publications · 101 citations
3
h-index
3 publications · 129 citations
3
h-index
2 publications · 54 citations
2
h-index
2 publications · 61 citations
2
h-index
1–5