Paper List
-
GOPHER: Optimization-based Phenotype Randomization for Genome-Wide Association Studies with Differential Privacy
This paper addresses the core challenge of balancing rigorous privacy protection with data utility when releasing full GWAS summary statistics, overco...
-
Real-time Cricket Sorting By Sex A low-cost embedded solution using YOLOv8 and Raspberry Pi
This paper addresses the critical bottleneck in industrial insect farming: the lack of automated, real-time sex sorting systems for Acheta domesticus ...
-
Training Dynamics of Learning 3D-Rotational Equivariance
This work addresses the core dilemma of whether to use computationally expensive equivariant architectures or faster symmetry-agnostic models with dat...
-
Fast and Accurate Node-Age Estimation Under Fossil Calibration Uncertainty Using the Adjusted Pairwise Likelihood
This paper addresses the dual challenge of computational inefficiency and sensitivity to fossil calibration errors in Bayesian divergence time estimat...
-
Few-shot Protein Fitness Prediction via In-context Learning and Test-time Training
This paper addresses the core challenge of accurately predicting protein fitness with only a handful of experimental observations, where data collecti...
-
scCluBench: Comprehensive Benchmarking of Clustering Algorithms for Single-Cell RNA Sequencing
This paper addresses the critical gap of fragmented and non-standardized benchmarking in single-cell RNA-seq clustering, which hinders objective compa...
-
Simulation and inference methods for non-Markovian stochastic biochemical reaction networks
This paper addresses the computational bottleneck of simulating and performing Bayesian inference for non-Markovian biochemical systems with history-d...
-
Assessment of Simulation-based Inference Methods for Stochastic Compartmental Models
This paper addresses the core challenge of performing accurate Bayesian parameter inference for stochastic epidemic models when the likelihood functio...
Hierarchical pp-Adic Framework for Gene Regulatory Networks: Theory and Stability Analysis
SECIHTI-CIMAT, Unidad Mérida, Mérida, Yucatán, México | Universidad Autónoma del Estado de Hidalgo, Pachuca, Hidalgo, México
30秒速读
IN SHORT: This paper addresses the core challenge of mathematically capturing the inherent hierarchical organization and multi-scale stability of gene regulatory networks (GRNs) using a novel p-adic ultrametric framework.
核心创新
- Methodology Introduces a stability measure μ that quantifies how dynamics contract or expand across hierarchical resolution levels, computed solely from discrete network data (transition map and gene ordering).
- Methodology Proposes a ball-level classification of fixed points (contracting, expanding, isometric) within the p-adic framework, extending the classical point-wise attracting/repelling/indifferent trichotomy to hierarchical sets.
- Biology Defines an optimal regulatory hierarchy by minimizing μ over all N! gene orderings, which, in the A. thaliana floral network (N=13), successfully places known master regulators (UFO, EMF1, LFY, TFL1) in leading positions without prior biological knowledge.
主要结论
- The p-adic ultrametric provides a natural fractal framework (self-similar nested-ball structure) for embedding discrete GRN dynamics and modeling hierarchical organization across scales.
- The stability measure μ and ball-level fixed-point classification are fully determined by the discrete network data (f, ι), making them computationally accessible despite their foundation in the analytical field ℂp.
- Application to the A. thaliana floral development network (N=13, p=2) demonstrates that minimizing μ recovers a biologically meaningful hierarchy, placing master regulators (UFO, EMF1, LFY, TFL1) in leading positions and distinguishing floral organ attractors (e.g., IEAA vs. IEEE patterns).
摘要: Gene regulatory networks exhibit hierarchical organization across scales; capturing this structure mathematically requires a metric that distinguishes regulatory influence at each level. We show that the ultrametric of the p-adic integers ℤp—whose self-similar nested-ball structure is a natural fractal encoding of multi-scale organization—provides such a framework. Embedding the N-gene state space into ℤp and working over the complete, algebraically closed field ℂp, we prove the existence of rational functions that interpret the discrete dynamics and construct hierarchical approximations at each resolution level. These constructions yield a stability measure μ—aggregating how the dynamics contracts or expands across resolution levels—and a ball-level classification of fixed points—contracting, expanding, or isometric—extending the attracting/repelling/indifferent trichotomy of non-Archimedean dynamics from points to balls. A key result is that μ and the classification, although their definition and dynamical meaning require the analytical tools of ℂp, are fully determined by the discrete data. Minimizing μ over all N! gene orderings defines an optimal regulatory hierarchy; for the Arabidopsis thaliana floral development network (N=13, p=2), a μ-minimizing ordering places known master regulators—UFO, EMF1, LFY, TFL1—in the leading positions and recovers the accepted developmental hierarchy without biological input beyond the transition map.