SearcharxivSearch

arXiv subjects

Don Yin

Publications and source records attributed to Don Yin.

2 recordsLinked to original sources

The Self-Replication Phase Diagram: Mapping Where Life Becomes Possible in Cellular Automata Rule Space

What substrate features allow life? We exhaustively classify all 262,144 outer-totalistic binary cellular automata rules with Moore neighbourhood for self-replication and produce phase diagrams in the $(\lambda, F)$ plane, where $\lambda$ is Langton's rule density and $F$ is a background-stability parameter. Of these rules, 20,152 (7.69%) support pattern proliferation, concentrated at low rule density ($\lambda \approx 0.15$--$0.25$) and low-to-moderate background stability ($F \approx 0.2$--$0.3$), in the weakly supercritical regime (Derrida coefficient $\mu = 1.81$ for replicators vs. $1.39$ for non-replicators). Self-replicating rules are more approximately mass-conserving (mass-balance 0.21 vs. 0.34), and this generalises to $k{=}3$ Moore rules. A three-tier detection hierarchy (pattern proliferation, extended-length confirmation, and causal perturbation) yields an estimated 1.56% causal self-replication rate. Self-replication rate increases monotonically with neighbourhood size under equalised detection: von Neumann 4.79%, Moore 7.69%, extended Moore 16.69%. These results identify background stability and approximate mass conservation as the primary axes of the self-replication phase boundary.

q-bio.PE

Hybrid eTFCE-GRF: Exact Cluster-Size Retrieval with Analytical p-Values for Voxel-Based Morphometry

Threshold-free cluster enhancement (TFCE) integrates cluster extent across thresholds to improve voxel-wise neuroimaging inference, but permutation testing makes it prohibitively slow for large datasets. Probabilistic TFCE (pTFCE) uses analytical Gaussian random field (GRF) p-values but discretises the threshold grid. Exact TFCE (eTFCE) eliminates discretisation via a union-find data structure but still requires permutations. We combine eTFCE's union-find for exact cluster-size retrieval with pTFCE's analytical GRF inference. The union-find builds the cluster hierarchy in one pass over sorted voxels and enables exact size queries at any threshold; GRF theory then converts these sizes to analytical p-values without permutations. Validation on synthetic phantoms (64^3, 80 subjects): FWER controlled at nominal level (0/200 null rejections, 95% CI [0.0%, 1.9%]); power matches baseline pTFCE (Dice >= 0.999); smoothness error below 1%; concordance r > 0.99. On UK Biobank (N=500) and IXI (N=563), significance maps form strict subsets of reference R pTFCE, which supports conservative error control. Implemented in pytfce (pip install pytfce): baseline completes whole-brain VBM in ~5s (75x faster than R pTFCE), hybrid in ~85s (4.6x faster) with exact cluster sizes; both >1000x faster than permutation TFCE.

eess.IV