Markovian Navigability on Self-Similar Graph Approximations: Sub-Markov Semigroups, p-Adic Dynamics, and Pisot-Type Numeration

We study a stochastic navigation model over path spaces associated with finite automata of Pisot-type substitutions. As a central example, we consider the Tribonacci substitution, whose prefix-suffix structure determines a directed graph with five transitions. We construct an injective topological encoding of admissible paths into the ring of $5$-adic integers and, independently, a contractive projection onto the complex geometric space associated with the substitution. On the graph, we introduce a discrete-time Markov chain with killing (absorption), governed by a substochastic transition matrix. For open symbolic targets, we define a hitting criterion based on the detection of cylinder sets contained within the target set. We prove that when the target is recognized by a deterministic finite automaton, the hitting probability prior to killing satisfies a finite linear system of harmonic equations. Furthermore, we study the approximation of open targets via finite unions of cylinders and establish conditions under which the corresponding hitting probabilities converge monotonically. Finally, we identify the analytical hypotheses required to extend the model to continuous-time processes and sub-Markovian semigroups on ultrametric spaces, providing an explicit structural example of fiber compatibility.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-18
DOI
https://doi.org/10.5281/zenodo.24355339
Primary Topic
p-Adic Analysis and Mathematical Physics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Markovian Navigability on Self-Similar Graph Approximations: Sub-Markov Semigroups, p-Adic Dynamics, and Pisot-Type Numeration

Sebastian Perdomo Leiva
Zenodo (CERN European Organization for Nuclear Research)
p-Adic Analysis and Mathematical Physics
preprint

Markovian Navigability on Self-Similar Graph Approximations: Sub-Markov Semigroups, p-Adic Dynamics, and Pisot-Type Numeration

Sebastian Perdomo Leiva
preprint en

Abstract

We study a stochastic navigation model over path spaces associated with finite automata of Pisot-type substitutions. As a central example, we consider the Tribonacci substitution, whose prefix-suffix structure determines a directed graph with five transitions. We construct an injective topological encoding of admissible paths into the ring of $5$-adic integers and, independently, a contractive projection onto the complex geometric space associated with the substitution. On the graph, we introduce a discrete-time Markov chain with killing (absorption), governed by a substochastic transition matrix. For open symbolic targets, we define a hitting criterion based on the detection of cylinder sets contained within the target set. We prove that when the target is recognized by a deterministic finite automaton, the hitting probability prior to killing satisfies a finite linear system of harmonic equations. Furthermore, we study the approximation of open targets via finite unions of cylinders and establish conditions under which the corresponding hitting probabilities converge monotonically. Finally, we identify the analytical hypotheses required to extend the model to continuous-time processes and sub-Markovian semigroups on ultrametric spaces, providing an explicit structural example of fiber compatibility.

Zenodo (CERN European Organization for Nuclear Research)
Universidad Nacional de Colombia (CO), Escuela Tecnológica Instituto Técnico Central (CO)
p-Adic Analysis and Mathematical Physics
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.

Laika access coming soon