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

Authors

155

  1. FG
    Florian Greil

    Technische Universität Darmstadt, Germany

    3 publications · 135 citations

    3

    h-index

  2. SS
    Stefan Schmid

    Technische Universität Berlin, Germany

    3 publications · 139 citations

    3

    h-index

  3. JW
    Jie Wu

    Temple University, United States

    2 publications · 53 citations

    2

    h-index

  4. MH
    Mingyi Hong

    University of Minnesota, United States

    2 publications · 129 citations

    2

    h-index

  5. XW
    Xingyuan Wang

    Dalian University of Technology, China

    2 publications · 70 citations

    2

    h-index

1–5 of 155

Venues

  1. Physical Review E

    PRE · 5 publications · 99 citations

    5

    h-index

  2. arXiv (Cornell University)

    Repository · 3 publications · 101 citations

    3

    h-index

  3. IEEE Transactions on Automatic Control

    3 publications · 129 citations

    3

    h-index

  4. Scientific Reports

    2 publications · 54 citations

    2

    h-index

  5. 2

    h-index

1–5