Dynamical attraction in disjunctive Boolean networks with strongly connected dependency graph

In this paper, we characterize the attractors of disjunctive Boolean networks with strongly connected dependency graphs and present a method for computing their basins of attraction. Additionally, we investigate the height of such networks — defined as the maximum number of iterations required to reach a periodic orbit.

Institutions

Publication Details

Journal
Discrete Mathematics Algorithms and Applications
Published
2025-11-28
DOI
https://doi.org/10.1142/s1793830925501757
Primary Topic
Gene Regulatory Network Analysis
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Dynamical attraction in disjunctive Boolean networks with strongly connected dependency graph

Discrete Mathematics Algorithms and Applications
Gene Regulatory Network Analysis
article

Dynamical attraction in disjunctive Boolean networks with strongly connected dependency graph

article en

Abstract

In this paper, we characterize the attractors of disjunctive Boolean networks with strongly connected dependency graphs and present a method for computing their basins of attraction. Additionally, we investigate the height of such networks — defined as the maximum number of iterations required to reach a periodic orbit.

Discrete Mathematics Algorithms and Applications
Hakim Sabzevari University (IR)
Reduced inequalities
Openalex Percentile: Top 42%
Gene Regulatory Network Analysis
DOISourceOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Dynamical attraction in disjunctive Boolean networks with strongly connected dependency graph · Discrete Mathematics Algorithms and Applications (2025) | TGRS Research Map | TGRS