相关论文: The Boolean Functions Computed by Random Boolean F…
Finding the most powerful node in a dynamic random network, the largest set in a partition-valued stochastic process, or the largest family in an evolving population at a given time, can be a very difficult problem. This is particularly the…
Random Boolean networks, originally invented as models of genetic regulatory networks, are simple models for a broad class of complex systems that show rich dynamical structures. From a biological perspective, the most interesting networks…
Boolean networks model finite discrete dynamical systems with complex behaviours. The state of each component is determined by a Boolean function of the state of (a subset of) the components of the network. This paper addresses the…
We consider a population spreading across a finite number of sites. Individuals can move from one site to the other according to a network (oriented links between the sites) that vary periodically over time. On each site, the population…
We describe systems using Kauffman and similar networks. They are directed funct ioning networks consisting of finite number of nodes with finite number of discr ete states evaluated in synchronous mode of discrete time. In this paper we…
The level-$k$ $\ell_1$-Fourier weight of a Boolean function refers to the sum of absolute values of its level-$k$ Fourier coefficients. Fourier growth refers to the growth of these weights as $k$ grows. It has been extensively studied for…
Mathematical method based on a direct or indirect analysis of growth rates is described. It is shown how simple assumptions and a relatively easy analysis can be used to describe mathematically complicated trends and to predict growth. Only…
We develope a computationally efficient extension of the Dyson Brownian Motion (DBM) algorithm to generate random function in C2 locally. We further explain that random functions generated via DBM show an unstable growth as the traversed…
We consider a probability distribution on the set of Boolean functions in n variables which is induced by random Boolean expressions. Such an expression is a random rooted plane tree where the internal vertices are labelled with connectives…
This is the second in a series of articles aimed at exploring the relationship between the complexity classes of P and NP. The research in this article aims to find conditions of an algorithmic nature that are necessary and sufficient to…
In this paper, we investigate the growth error bound condition. By using the proximal point algorithm, we first provide a more accessible and elementary proof of the fact that Kurdyka-{\L}ojasiewicz conditions imply growth error bound…
The link between a particular class of growth processes and random matrices was established in the now famous 1999 article of Baik, Deift, and Johansson on the length of the longest increasing subsequence of a random permutation. During the…
The relationship between the properties of a dynamical system and the structure of its defining equations has long been studied in many contexts. Here we study this problem for the class of conjunctive (resp. disjunctive) Boolean networks,…
Networks are a powerful abstraction with applicability to a variety of scientific fields. Models explaining their morphology and growth processes permit a wide range of phenomena to be more systematically analysed and understood. At the…
It has been shown \citep{broeck90:physicalreview,patarnello87:europhys} that feedforward Boolean networks can learn to perform specific simple tasks and generalize well if only a subset of the learning examples is provided for learning.…
We provide sufficient density condition for a set of nonuniform samples to give rise to a set of sampling for multivariate bandlimited functions when the measurements consist of pointwise evaluations of a function and its first $k$…
The dynamical processes taking place on a network depend on its topology. Influencing the growth process of a network therefore has important implications on such dynamical processes. We formulate the problem of influencing the growth of a…
We consider the problem of searching for proofs in sequential presentations of logics with multiplicative (or intensional) connectives. Specifically, we start with the multiplicative fragment of linear logic and extend, on the one hand, to…
We propose conditions for the emergence of Turing patterns in a domain that changes in size by homogeneous growth/shrinkage. These conditions to determine the bifurcation are based on considering the geometric change of a potential function…
Using linearized elasticity as a convenient mechanical framework, we show that volumetric growth can be formulated as an optimization-driven process in which the growth tensor is determined implicitly by constrained optimization rather than…