Related papers: Asynchronous dynamics of isomorphic Boolean networ…
Consider a dynamic random geometric social network identified by $s_t$ independent points $x_t^1,\ldots,x_t^{s_t}$ in the unit square $[0,1]^2$ that interact in continuous time $t\geq 0$. The generative model of the random points is a…
A conjunctive Boolean network (CBN) is a finite state dynamical system, whose variables take values from a binary set, and the value update rule for each variable is a Boolean function consisting only of logic AND operations. We investigate…
Pecora and Carroll presented a notion of synchronization where an (n-1)-dimensional nonautonomous system is constructed from a given $n$-dimensional dynamical system by imposing the evolution of one coordinate. They noticed that the…
Empirical studies of graphs have contributed enormously to our understanding of complex systems. Known today as network science, what was originally a theoretical study of graphs has grown into a more scientific exploration of communities…
This paper presents a framework for the study of convergence when the nodes' dynamics may be both piecewise smooth and/or nonidentical across the network. Specifically, we derive sufficient conditions for global convergence of all node…
We study expanding circle maps interacting in a heterogeneous random network. Heterogeneity means that some nodes in the network are massively connected, while the remaining nodes are only poorly connected. We provide a probabilistic…
Many practical systems can be described by dynamic networks, for which modern technique can measure their output signals, and accumulate extremely rich data. Nevertheless, the network structures producing these data are often deeply hidden…
Biological networks have two modes. The first mode is static: a network is a passage on which something flows. The second mode is dynamic: a network is a pattern constructed by gluing functions of entities constituting the network. In this…
We evaluate the probability that a Boolean network returns to an attractor after perturbing h nodes. We find that the return probability as function of h can display a variety of different behaviours, which yields insights into the…
Graph isomorphism is a problem for which there is no known polynomial-time solution. Nevertheless, assessing (dis)similarity between two or more networks is a key task in many areas, such as image recognition, biology, chemistry, computer…
We study synchronization and consensus in a group of dynamical systems coupled via multiple directed networks. We show that even though the coupling in a single network may not be sufficient to synchronize the systems, combination of…
In these notes we study synchronizability of dynamical processes defined on complex networks as well as its interplay with network topology. Building from a recent work by Barahona and Pecora [Phys. Rev. Lett. 89, 054101 (2002)], we use a…
The collective dynamics of interacting dynamical units on a network crucially depends on the properties of the network structure. Rather than considering large but finite graphs to capture the network, one often resorts to graph limits and…
Networks of coupled degrade-and-fire (DF) oscillators are simple dynamical models of assemblies of interacting self-repressing genes. For mean-field interactions, which most mathematical studies have assumed so far, every trajectory must…
A coupled cell network is a type of ordinary differential equation $\dot x(t)=f(x(t))$, with structural constraints on the vector field $f$, encoded in a directed graph, whose cells and arrows are labeled by type. The generated dynamics can…
We consider a family of inverse limits of inverse sequences of closed unit intervals with a single upper semi-continuous set-valued bonding function whose graph is an arc; it is the union of two line segments in $[0,1]^2$, both of them…
The dynamics of noise-resilient Boolean networks with majority functions and diverse topologies is investigated. A wide class of possible topological configurations is parametrized as a stochastic blockmodel. For this class of networks, the…
Dynamical features of tagged particles are studied in a one dimensional $A+A \rightarrow kA$ system for $k=0$ and 1, where the particles $A$ have a bias $\epsilon$ $(0 \leq \epsilon \leq 0.5)$ to hop one step in the direction of their…
Dynamical properties of complex networks are related to the spectral properties of the Laplacian matrix that describes the pattern of connectivity of the network. In particular we compute the synchronization time for different types of…
An Automata Network is a map ${f:Q^n\rightarrow Q^n}$ where $Q$ is a finite alphabet. It can be viewed as a network of $n$ entities, each holding a state from $Q$, and evolving according to a deterministic synchronous update rule in such a…