• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 24
Next 10 →

Dynamics of scalefree semi-synchronous boolean networks

by M. Giacobini, M. Tomassini, P. De, Los Rios, E. Pestelacci - in Artificial Life X, eds.Rocha,L.M.et al , 2006
"... Random Boolean Networks have been introduced by Kauffman more than thirty years ago as a highly simplified model of genetic regulatory networks. These models are interesting in their own as complex dynamical systems and have been throughly studied as such. We believe that the original view of Kauffm ..."
Abstract - Cited by 2 (2 self) - Add to MetaCart
at the time. In particular, we will present a method for generating networks with given degree distributions, together with a new semi-synchronous updating scheme. Simulations of statistical ensembles of networks behaving according to the new model will be presented and discussed.

Boolean Game on Scale-free Networks

by Jing Ma , Wen-jie Bai , Shi-min Cai , et al. , 2006
"... Inspired by the local minority game, we propose a network Boolean game and investigate its dynamical properties on scale-free networks. The system can self-organize to a stable state with better performance than random choice game, although only the local information is available to the agent. By in ..."
Abstract - Add to MetaCart
Inspired by the local minority game, we propose a network Boolean game and investigate its dynamical properties on scale-free networks. The system can self-organize to a stable state with better performance than random choice game, although only the local information is available to the agent

From heavy-tailed Boolean models to scale-free Gilbert graphs

by Christian Hirsch
"... Abstract. Define the scale-free Gilbert graph based on a Boolean model with heavy-tailed radius distribution on the d-dimensional torus by connecting two centers of balls by an edge if at least one of the balls contains the center of the other. We investigate two asymptotic properties of this graph ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract. Define the scale-free Gilbert graph based on a Boolean model with heavy-tailed radius distribution on the d-dimensional torus by connecting two centers of balls by an edge if at least one of the balls contains the center of the other. We investigate two asymptotic properties of this graph

Physica D 185 (2003) 45–66 Boolean dynamics of networks with scale-free topology

by Maximino Aldana , 2003
"... The dynamics of Boolean networks with scale-free topology are studied. The existence of a phase transition from ordered to chaotic dynamics, governed by the value of the scale-free exponent of the network, is shown analytically by analyzing the overlap between two distinct trajectories. The phase di ..."
Abstract - Add to MetaCart
The dynamics of Boolean networks with scale-free topology are studied. The existence of a phase transition from ordered to chaotic dynamics, governed by the value of the scale-free exponent of the network, is shown analytically by analyzing the overlap between two distinct trajectories. The phase

Fixed-points in Random Boolean Networks: The impact of parallelism in the scale-free topology case ∗

by Pablo Moisset De Espanés, Axel Osses, Ivan Rapaport
"... 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 Boolean networks (RBNs). We start this paper by proving that ..."
Abstract - Add to MetaCart
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 Boolean networks (RBNs). We start this paper by proving

Phase transitions in random Boolean networks with different updating schemes

by Carlos Gershenson, Centrum Leo Apostel, Brussel Krijgskundestraat B, Brussel Belgium , 2004
"... In this paper we study the phase transitions of different types of Random Boolean networks. These differ in their updating scheme: synchronous, semi-synchronous, or asynchronous, and deterministic or non-deterministic. It has been shown that the statistical properties of Random Boolean networks chan ..."
Abstract - Cited by 7 (3 self) - Add to MetaCart
In this paper we study the phase transitions of different types of Random Boolean networks. These differ in their updating scheme: synchronous, semi-synchronous, or asynchronous, and deterministic or non-deterministic. It has been shown that the statistical properties of Random Boolean networks

Robustness of Attractor in Complex Networks with Scale-free Topology III

by Shu-ichi Kinoshita, Kazumoto Iguchi, Hiroaki S. Yamada
"... Dynamics of gene interactions in cell and robustness of cell are still open problems. One of the most simplified model for such gene interactions is known as the Kauffman’s random Boolean network (RBN) model. In this model we assume that a gene is regulated by a certain fixed number of other input g ..."
Abstract - Add to MetaCart
Dynamics of gene interactions in cell and robustness of cell are still open problems. One of the most simplified model for such gene interactions is known as the Kauffman’s random Boolean network (RBN) model. In this model we assume that a gene is regulated by a certain fixed number of other input

Robustness of Attractor States in Complex Networks with Scale-free Topology

by Shu-ichi Kinoshita A , 708
"... We study the intrinsic properties of attractors in the Boolean dynamics in complex network with scale-free topology, comparing with those of the so-called random Kauffman networks. We have numerically investigated the frozen and relevant nodes for each attractor, and the robustness of the attractors ..."
Abstract - Add to MetaCart
We study the intrinsic properties of attractors in the Boolean dynamics in complex network with scale-free topology, comparing with those of the so-called random Kauffman networks. We have numerically investigated the frozen and relevant nodes for each attractor, and the robustness

Intrinsic Properties of Boolean Dynamics in Complex Networks

by Shu-ichi Kinoshita A
"... We study intrinsic properties of attractor in Boolean dynamics of complex networks with scale-free topology, comparing with those of the so-called Kauffman’s random Boolean networks. We numerically study both frozen and relevant nodes in each attractor in the dynamics of relatively small networks (2 ..."
Abstract - Add to MetaCart
We study intrinsic properties of attractor in Boolean dynamics of complex networks with scale-free topology, comparing with those of the so-called Kauffman’s random Boolean networks. We numerically study both frozen and relevant nodes in each attractor in the dynamics of relatively small networks

Optimal intervention in asynchronous genetic regulatory networks

by Babak Faryabi, Student Member, Jean-françois Chamberl, Golnaz Vahedi, Student Member, Aniruddha Datta, Senior Member, Edward R. Dougherty - IEEE J. Sel. Topics Signal Process
"... Abstract—There is an ongoing effort to design optimal inter-vention strategies for discrete state-space synchronous genetic regulatory networks in the context of probabilistic Boolean net-works; however, to date, there has been no corresponding effort for asynchronous networks. This paper addresses ..."
Abstract - Cited by 11 (9 self) - Add to MetaCart
Abstract—There is an ongoing effort to design optimal inter-vention strategies for discrete state-space synchronous genetic regulatory networks in the context of probabilistic Boolean net-works; however, to date, there has been no corresponding effort for asynchronous networks. This paper addresses
Next 10 →
Results 1 - 10 of 24
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University