Department of Mathematics
 Search | Help | Login | pdf version | printable version

Math @ Duke



Publications [#243604] of John Harer


  1. Fink, T; Ahnert, S; Bar On, R; Harer, J, Exact dynamics of Boolean networks with connectivity one, PRL (2009)
    (last updated on 2017/11/23)

    We study boolean dynamics on the simplest class of network topologies: those in which each node has a single input (K = 1). Despite their simplicity, they exhibit highly intricate bahaviour. We give the exact solution for the size and number of attractors on a loop and multiple loops of the same size. By expressing the dynamics of a network as a composition of the dynamics of its modules, we give a detailed solution to the critical K = 1 Kauffman model, and show that the minimum number of attractors scales as 2n−√2n log2 √2n , where n is the number of nodes in loops.
ph: 919.660.2800
fax: 919.660.2821

Mathematics Department
Duke University, Box 90320
Durham, NC 27708-0320