Mihaela T. Matache

Learn More
This paper considers a simple Boolean network with N nodes, each node's state at time t being determined by a certain number of parent nodes, which may vary from one node to another. This is an extension of a model studied by Andrecut and Ali [Int. J. Mod. Phys. B 15, 17 (2001)]], who consider the same number of parents for all nodes. We make use of the(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)
CONTEXT The Liaison Committee on Medical Education (LCME) requires there to be: '...comparable educational experiences and equivalent methods of evaluation across all alternative instructional sites within a given discipline'. It is an LCME accreditation requirement that students encounter similar numbers of patients with similar diagnoses. However,(More)
This paper considers a simple Boolean network with N nodes, each node's state at time t being determined by a certain number k of parent nodes, which is fixed for all nodes. The nodes, with randomly assigned neighborhoods, are updated based on various asynchronous schemes. We make use of a Boolean rule that is a generalization of rule 126 of elementary(More)
This paper studies the spread of perturbations through networks composed of Boolean functions with special canalyzing properties. Canalyzing functions have the property that at least for one value of one of the inputs the output is fixed, irrespective of the values of the other inputs. In this paper the focus is on partially nested canalyzing functions, in(More)
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)
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)
Prediction markets have been shown to be a useful tool in forecasting the outcome of future events by aggregating public opinion about the events' outcome. Previous research on prediction markets has mostly analyzed the prediction markets by building complex analytical models. In this paper, we posit that simpler yet powerful Boolean rules can be used to(More)