Related papers: Bifurcations in Boolean Networks
We study the geometric and topological properties of strange non-chaotic attractors created in non-smooth saddle-node bifurcations of quasiperiodically forced interval maps. By interpreting the attractors as limit objects of the iterates of…
In this paper, an interesting and new bifurcation phenomenon that limit cycles could be bifurcated from nilpotent node (focus) by changing its stability was investigated. It is different from lowing its multiplicity in order to get limit…
Real-world networks in technology, engineering and biology often exhibit dynamics that cannot be adequately reproduced using network models given by smooth dynamical systems and a fixed network topology. Asynchronous networks give a…
We study the target control problem of asynchronous Boolean networks, to identify a set of nodes, the perturbation of which can drive the dynamics of the network from any initial state to the desired steady state (or attractor). We are…
Interconnected networks are mathematical representation of systems where two or more simple networks are coupled to each other. Depending on the coupling weight between the two components, the interconnected network can function in two…
We prove that cooperativity in Boolean networks precludes a strong notion of sensitive dependence on initial conditions. Weaker notions of sensitive dependence are shown to be consistent with cooperativity, but if each regulatory functions…
The scaling of the time delay near a "bottleneck" of a generic saddle-node bifurcation is well-known to be given by an inverse square-root law. We extend the analysis to several non-generic cases for smooth vector fields. We proceed to…
Circle maps frequently arise in mathematical models of physical or biological systems. Motivated by Cherry flows and `threshold' systems such as integrate and fire neuronal models, models of cardiac arrhythmias, and models of sleep/wake…
We investigate classical and semiclassical aspects of codimension--two bifurcations of periodic orbits in Hamiltonian systems. A classification of these bifurcations in autonomous systems with two degrees of freedom or time-periodic systems…
The main objective of this article is to study the three-dimensional Rayleigh-Benard convection in a rectangular domain from a pattern formation perspective. It is well known that as the Rayleigh number crosses a critical threshold, the…
Lienard systems of the form $\ddot{x}+\epsilon f(x)\dot{x}+x=0$, with f(x) an even continous function, are considered. The bifurcation curves of limit cycles are calculated exactly in the weak ($\epsilon\to 0$) and in the strongly…
In epidemiological modelling, dynamics on networks, and in particular adaptive and heterogeneous networks have recently received much interest. Here we present a detailed analysis of a previously proposed model that combines heterogeneity…
We study how the dynamics of a class of discrete dynamical system models for neuronal networks depends on the connectivity of the network. Specifically, we assume that the network is an Erd\H{o}s-R\'{enyi} random graph and analytically…
Methods for determining the percolation threshold usually study the behavior of network ensembles and are often restricted to a particular type of probabilistic node/link removal strategy. We propose a network-specific method to determine…
Higher-order interaction networks are typically modeled using hypergraphs or simplicial complexes, where interactions explicitly involve more than two nodes. Here we demonstrate that effective higher-order dynamical constraints emerge…
We study the presence in the Lozi map of a type of abrupt order-to-order and order-to-chaos transitions which are mediated by an attractor made of a continuum of neutrally stable limit cycles, all with the same period.
We present a path - integral approach to treat a 2D model of a quantum bifurcation. The model potential has two equivalent minima separated by one or two saddle points, depending on the value of a continuous parameter. Tunneling is…
We investigated the properties of Boolean networks that follow a given reliable trajectory in state space. A reliable trajectory is defined as a sequence of states which is independent of the order in which the nodes are updated. We…
We consider a model for gene regulatory networks that is a modification of Kauffmann's (1969) random Boolean networks. There are three parameters: $n =$ the number of nodes, $r =$ the number of inputs to each node, and $p =$ the expected…
Fixed points are fundamental states in any dynamical system. In the case of gene regulatory networks (GRNs) they correspond to stable genes profiles associated to the various cell types. We use Kauffman's approach to model GRNs with random…