Predicting attractors from spectral properties of stylized gene regulatory networks
원문 초록
How the architecture of gene regulatory networks ultimately shapes gene expression patterns is an open question, which has been approached from a multitude of angles. The dominant strategy has been to identify non-random features in these networks and then argue for the function of these features using mechanistic modelling. Here we establish the foundation of an alternative approach by studying the correlation of eigenvectors with synthetic gene expression data simulated with a basic and popular model of gene expression dynamics -- attractors of Boolean threshold dynamics in signed directed graphs. Eigenvectors of the graph Laplacian are known to explain collective dynamical states (stationary patterns) in Turing dynamics on graphs. In this study, we show that eigenvectors can also predict collective states (attractors) for a markedly different type of dynamics, Boolean threshold dynamics, and category of graphs, signed directed graphs. However, the overall predictive power depends on details of the network architecture, in a predictable fashion. Our results are a set of statistical observations, providing the first systematic step towards a further theoretical understanding of the role of eigenvectors in dynamics on graphs.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
CulFiT: A Fine-grained Cultural-aware LLM Training Paradigm via Multilingual Critique Data Synthesis
O$^2$-Searcher: A Searching-based Agent Model for Open-Domain Open-Ended Question Answering
Ranked Voting based Self-Consistency of Large Language Models
Neptune: The Long Orbit to Benchmarking Long Video Understanding
Utilize the Flow before Stepping into the Same River Twice: Certainty Represented Knowledge Flow for Refusal-Aware Instruction Tuning
Ranking Generated Answers: On the Agreement of Retrieval Models with Humans on Consumer Health Questions
토론
이 논문과 연결된 포럼 글이 아직 없습니다.