English
Related papers

Related papers: A reduction method for noisy Boolean networks

200 papers

Random boolean networks are a model of genetic regulatory networks that has proven able to describe experimental data in biology. They not only reproduce important phenomena in cell dynamics, but they are also extremely interesting from a…

Dynamical Systems · Mathematics 2015-02-26 Marco Villani , Davide Campioli , Chiara Damiani , Andrea Roli , Alessandro Filisetti , Roberto Serra

We investigate Threshold Random Boolean Networks with $K = 2$ inputs per node, which are equivalent to Kauffman networks, with only part of the canalyzing functions as update functions. According to the simplest consideration these networks…

Disordered Systems and Neural Networks · Physics 2007-07-16 Florian Greil , Barbara Drossel

Probabilistic Boolean Networks (PBNs) have been previously proposed so as to gain insights into complex dy- namical systems. However, identification of large networks and of the underlying discrete Markov Chain which describes their…

Machine Learning · Computer Science 2018-01-24 Ifigeneia Apostolopoulou , Diana Marculescu

Deterministic and stochastic Boolean network models are build for the dynamics of negative feedback loops of the p53 pathways. It is shown that the main function of the negative feedback in the p53 pathways is to keep p53 at a low steady…

Molecular Networks · Quantitative Biology 2009-04-16 Hao Ge , Min Qian

In this paper we study the Poisson Hypothesis, which is a device to analyze approximately the behavior of large queueing networks. We prove it in some simple limiting cases. We show in particular that the corresponding dynamical system,…

Probability · Mathematics 2007-05-23 A. Rybko , S. Shlosman

Stability is an important characteristic of network models that has implications for other desirable aspects such as controllability. The stability of a Boolean network depends on various factors, such as the topology of its wiring diagram…

Chaotic Dynamics · Physics 2024-07-09 Karthik Chandrasekhar , Claus Kadelka , Reinhard Laubenbacher , David Murrugarra

A method for the quantitative analysis of the degree and parameters of synchronization of the chaotic oscillations in two coupled oscillators is proposed, which makes it possible to reveal a change in the structure of attractors. The…

Chaotic Dynamics · Physics 2011-08-30 A. V. Makarenko

The evaluation of the number of attractors in Kauffman networks by Samuelsson and Troein is generalized to critical networks with one input per node and to networks with two inputs per node and different probability distributions for update…

Statistical Mechanics · Physics 2009-11-11 Barbara Drossel

In this paper, the problem of distributed optimization is studied via a network of agents. Each agent only has access to a noisy gradient of its own objective function, and can communicate with its neighbors via a network. To handle this…

Optimization and Control · Mathematics 2025-06-19 Yuchen Yang , Kaihong Lu , Long Wang

Stochastic optimization is a vital field in the realm of mathematical optimization, finding applications in diverse areas ranging from operations research to machine learning. In this paper, we introduce a novel first-order optimization…

Optimization and Control · Mathematics 2024-09-17 Vladimir Solodkin , Savelii Chezhegov , Ruslan Nazikov , Aleksandr Beznosikov , Alexander Gasnikov

Boolean networks are popular tools for the exploration of qualitative dynamical properties of biological systems. Several dynamical interpretations have been proposed based on the same logical structure that captures the interactions…

Discrete Mathematics · Computer Science 2022-03-04 Aurélien Naldi , Adrien Richard , Elisa Tonello

We analyze a distributed algorithm for estimation of scalar parameters belonging to nodes in a mobile network from noisy relative measurements. The motivation comes from the problem of clock skew and offset estimation for the purpose of…

Systems and Control · Computer Science 2013-02-20 Chenda Liao , Prabir Barooah

We propose a theory of unimodal maps perturbed by an heteroscedastic Markov chain noise and experiencing another heteroscedastic noise due to uncertain observation. We address and treat the filtering problem showing that by collecting more…

Statistics Theory · Mathematics 2024-11-26 Fabrizio Lillo , Stefano Marmi , Matteo Tanzi , Sandro Vaienti

Quantum supremacy poses that a realistic quantum computer can perform a calculation that classical computers cannot in any reasonable amount of time. It has become a topic of significant research interest since the birth of the field, and…

Quantum Physics · Physics 2023-01-10 Kabgyun Jeong

Existing studies on the degree correlation of evolving networks typically rely on differential equations and statistical analysis, resulting in only approximate solutions due to inherent randomness. To address this limitation, we propose an…

Computation · Statistics 2024-06-13 Yue Xiao , Xiaojun Zhang

This paper presents a comparison of several Convolutional Neural Network (CNN) models for extracting target signals in highly noisy measurement conditions. Four CNN architectures were investigated. The first comprises six consecutive…

Signal Processing · Electrical Eng. & Systems 2024-10-11 Andrea Faúndez Quezada , Salvatore La Cavera , Sidahmed A Abayzeed

This paper develops the first class of algorithms that enable unbiased estimation of steady-state expectations for multidimensional reflected Brownian motion. In order to explain our ideas, we first consider the case of compound Poisson…

Probability · Mathematics 2015-10-27 Jose Blanchet , Xinyun Chen

Random Boolean networks have been used widely to explore aspects of gene regulatory networks. A modified form of the model through which to systematically explore the effects of increasing the number of gene states has previously been…

Molecular Networks · Quantitative Biology 2023-02-06 Larry Bull

We consider a real-time communication system with noisy feedback consisting of a Markov source, a forward and a backward discrete memoryless channels, and a receiver with finite memory. The objective is to design an optimal communication…

Information Theory · Computer Science 2007-09-25 Aditya Mahajan , Demosthenis Teneketzis

Motivated by techniques developed in recent progress on lower bounds for sublinear time algorithms (Behnezhad, Roghani and Rubinstein, STOC 2023, FOCS 2023, and STOC 2024) we introduce and study a new class of randomized algorithmic…

Data Structures and Algorithms · Computer Science 2026-03-19 Amir Azarmehr , Soheil Behnezhad , Alma Ghafari , Madhu Sudan