Metraipolis › archive › dc_7e3e4888aa85
Shape irregularity of Life-Like Network Automaton rules as an indicator of classification performance — arXiv:2610.10867
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.10867
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-09T06:20:59.523Z
- SHA-256 of the archived text
f04c710ce57c18ebdc5ef1e9dd65189f184b093300814dbf800faa7f7829218b- Stable URL of this page
https://metraipolis.com/documento/dc_7e3e4888aa85
How to cite
Shape irregularity of Life-Like Network Automaton rules as an indicator of classification performance — arXiv:2610.10867 — arXiv (en), https://arxiv.org/abs/2610.10867 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7e3e4888aa85 (Metraipolis archive dc_7e3e4888aa85, sha256 f04c710ce57c18ebdc5ef1e9dd65189f184b093300814dbf800faa7f7829218b)
BibTeX
@misc{dc7e3e4888aa85,
title = {Shape irregularity of Life-Like Network Automaton rules as an indicator of classification performance — arXiv:2610.10867},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.10867},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7e3e4888aa85; sha256 f04c710ce57c18ebdc5ef1e9dd65189f184b093300814dbf800faa7f7829218b},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.10867. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Complex Network (CN) classification requires high-level structural characterizations that are both scale-invariant and computationally efficient. Methods based on Life-Like Network Automata (LLNA) offer an interesting way to extract network descriptors by leveraging emergent temporal patterns without requiring provided features, but their efficacy is bottlenecked by a high-cost combinatorial optimization problem: the selection of the automaton transition rule. While current literature relies on exhaustive searches that are unfeasible for large-scale applications, this work reveals that the rule space is fundamentally structured by a property we term ``jaggedness'', that quantifies the resemblance of a LLNA transition function with a sawtooth shape. We demonstrate that this metric acts as a theoretical proxy for chaoticity and sensitivity -- properties essential for generating discriminative dynamic behaviors among network categories. Moreover, we introduce a heuristic search strategy that uses jaggedness to guide the rule selection. Experimental results show that our approach achieves classification accuracies within 5% of the global optimum while reducing computational overhead by 90% compared to exhaustive approach. Our findings provide a novel, efficient, framework for optimizing automata-based methods for pattern recognition. Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno). Categorie arXiv: Machine Learning (cs.LG) ; Cellular Automata and Lattice Gases (nlin.CG). Pagina del lavoro: https://arxiv.org/abs/2610.10867 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-09T05:50:30.995Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).