Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2004.01259

Finding the fixed points of a Boolean network from a positive feedback vertex set

Julio Aracena·Luis Cabreras-Crot·Lilian Salinas
View original source ↗Read source document ↗Export metadata ↓

Abstract

In the modeling of biological systems by Boolean networks a key problem is finding the set of fixed points of a given network. Some constructed algorithms consider certain structural properties of the interaction graph like those proposed by Akutsu et al. in \cite{akutsu1998system,zhang2007algorithms} which consider a feedback vertex set of the graph. However, these methods do not take into account the type of action (activation, inhibition) between its components. In this paper we propose a new algorithm for finding the set of fixed points of a Boolean network, based on a positive feedback vertex set $P$ of its interaction graph and which works, by applying a sequential update schedule, in time $O(2^{|P|} \cdot n^2)$, where $n$ is the number of components. The theoretical foundation of this algorithm is due a nice characterization, that we give, of the dynamical behavior of the Boolean networks without positive cycles and with a fixed point. An executable file of \Afp made in Java and some examples of input files are available at: \href{http://www.inf.udec.cl/~lilian/FPCollector/}{\url{www.inf.udec.cl/~lilian/FPCollector/}}

Explore related subjects

cs.DMmath.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Julio Aracena, Luis Cabreras-Crot, Lilian Salinas. 2020-04-01. Finding the fixed points of a Boolean network from a positive feedback vertex set. https://arxiv.org/abs/2004.01259

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Warshall algorithm for matrix-weighted graphs

This paper proposes Warshall-type algorithms for determining connectedness and clustering in an undirected matrix-weighted graphs. While a path between two vertices guarantees their connectedness in a scalar-weighted graph, the existence of one or more paths between them does not necessarily guarantee that they belong to the same cluster in a matrix-weighted graph. First, a sufficient condition for pairwise connectedness is established via aggregating path kernels between them. Second, we introduce three block matrix logic operators that enables the connectedness condition to be compactly represented and manipulated with positive semidefinite matrices. The proposed Warshall algorithm simultaneously determines connectivity between every pair of vertices in the graph and provides an approximated graph partition. Third, a distributed version of the Warshall algorithm is developed. Proofs of correctness, together with computational complexity analysis and numerical examples, are provided to establish the validity of the proposed algorithms.

cs.DM↗
arXiv2026

Fault-tolerant Hamiltonian connectivity of Johnson graphs

Johnson graphs $J(n,k)$ are a classical family of highly symmetric networks known to be Hamiltonian-connected in the fault-free setting. In this paper, we investigate their Hamiltonian connectivity under three failure models, namely general edge faults, matching faults, and vertex faults. For general edge faults, we prove that $J(n,k)$ remains Hamiltonian-connected after the deletion of any set of at most $k(n-k)-3$ edges for $n\geq4$. Since $J(n,k)$ is $k(n-k)$-regular, this attains the natural degree-based upper bound for Hamiltonian connectivity. We then consider matching faults, which exclude the concentration of multiple faulty links at a single vertex and permit substantially larger fault sets. We show that $J(n,k)$ remains Hamiltonian-connected after the deletion of an arbitrary matching for $n\geq5$, including a perfect matching whenever one exists. For vertex failures, we prove that $J(n,k)$ is $(n-2)$-vertex-fault-tolerant Hamiltonian-connected for $n\geq5$. All three results are constructive and lead to recursive fault-tolerant Hamiltonian routing algorithms. Simulation results on Johnson graphs with up to $12{,}870$ vertices further show that the routing algorithms successfully construct fault-free Hamiltonian paths for all tested source-destination pairs, with measured execution times exhibiting near-linear growth with network size. These results establish a unified fault-tolerant Hamiltonian-connectivity framework for Johnson graphs under different failure patterns.

cs.DM↗
arXiv2026

Multiparameter counting of numerical semigroups: recurrences and leaf-discriminating trees

A numerical semigroup is a subset of the nonnegative integers, closed under addition and with finite complement. The size of the complement is its genus. The problem of counting semigroups by the largest gap got very important through the so-called Frobenius problem, first documented in 1884. Accordingly, the largest gap is called the Frobenius number. In the last two decades, counting by the genus has become a subject of even more intense study, mostly because of the non-solved conjectures on its monotonic and super-Fibonacci growth. We propose a new approach to counting semigroups by the Frobenius number and by the genus, by introducing two ad-hoc trees. Those are leaf-discriminating trees in the sense that their leaves correspond exactly to the objects we want to count and, so, exploring these trees is optimal. On the theoretical side, it is known that the number of semigroups of each genus grows asymptotically with the genus as the Fibonacci numbers and that the number of semigroups of each Frobenius number grows asymptotically as a two-step doubling sequence. We prove a formula for the number of numerical semigroups of each Frobenius number $F$, genus $g$, and multiplicity $m$ (first nonzero nongap), for $m\geq(F+1)/3$. It is known that asymptotically almost all semigroups satisfy this inequality. This formula gives a multiparameter exact version of the increasing behaviours just mentioned. On the computational side, we implemented a recursive descending algorithm based on the so-called seeds structure, trimming the general semigroup tree exactly at those nodes with no descendants with a given genus, in the first case, or with no descendants with a given Frobenius number, in the second case. We refined the parallelizing strategies and we overcame the previous limitation of the length of integers in the bitwise representation of the gap sequence and the seed sequence.

cs.DM↗