#### Filter Results:

#### Publication Year

2002

2014

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

This study considers a simple Boolean network with N nodes, each node's state at time t being determined by a certain number of parent nodes. The network is analyzed when the connectivity k is fixed or variable. Making use of a Boolean rule that is a generalization of Rule 22 of elementary cellular automata, a generalized formula for providing the… (More)

An asynchronous Boolean network with N nodes whose states at each time point are determined by certain parent nodes is considered. We make use of the models developed by Matache and Heidel [Matache, M.T., Heidel, J., 2005. Asynchronous random Boolean network model based on elementary cellular automata rule 126. Phys. Rev. E 71, 026232] for a constant number… (More)

In this paper we provide a mean-field Boolean network model for a signal transduction network of a generic fibroblast cell. The network consists of several main signaling pathways, including the receptor tyrosine kinase, the G-protein coupled receptor, and the Integrin signaling pathway. The network consists of 130 nodes, each representing a signaling… (More)

- Ray Goodman, Mihaela T. Matache, M. T. Matache
- 2008

This study provides an analysis of the dynamics of fixed-size directed Boolean networks governed by generalizations of elementary cellular au-tomata rules 22 and 126, under a power-law distribution of parent nodes and a popularity parent assignment. The analysis shows the existence of a two-piece chaotic attractor for smaller values of the power-law… (More)

We consider the reproducing kernel Hilbert space H µ induced by a kernel which is obtained using the Fourier-Stieltjes transform of a regular, positive, finite Borel measure µ on a locally compact abelian topological group Γ. Denote by G the dual of Γ. We determine H µ as a certain subspace of the space C 0 (G) of all continuous function on G vanishing at… (More)

An algebraic method for information fusion based on nonadditive set functions is used to assess the joint contribution of Boolean network attributes to the sensitivity of the network to individual node mutations. The node attributes or characteristics under consideration are: in-degree, out-degree, minimum and average path lengths, bias, average sensitivity… (More)

In this paper we generate upper and lower bounds for the sensitivity to noise of a Boolean function using relaxed assumptions on input choices and noise. The robustness of a Boolean network to noisy inputs is related to the average sensitivity of that function. The average sensitivity measures how sensitive to changes in the inputs the output of the… (More)

A multiple Fractional Brownian Motion (FBM) based traffic model of the following form is considered A(t) = mt + M j=1 σ j B Hj (t) + τ W (t). Here B H j (t) are independent FBMs with Hurst parameters 1/2 < H j < 1 and W (t) is a Brownian Motion independent of the FBMs. Various lower bounds for the overflow probability of the associated queuing system are… (More)

Operator Self-Similar (OSS) stochastic processes on arbitrary Ba-nach spaces are considered. If the family of expectations of such a process is a spanning subset of the space it is proved that the scaling family of operators of the process under consideration is a uniquely determined multiplicative group of operators. If the expectation-function of the… (More)

- ‹
- 1
- ›