Answers are grounded in this paper and cite their sources.
This analysis uncovers recurrence and transience in directed graphs over non-Archimedean fields, indicating underlying random walk properties.
We introduce notions of recurrence and transience for graphs over a non‐Archimedean ordered field. To achieve this, we establish a connection between these graphs and random walks on directed graphs over the reals. In particular, we give a characterization of the real directed graphs which can arise in such a way. As a main result, we give characterization for recurrence and transience in terms of a quantity related to the capacity.
No takes yet. Share an insight, caveat, or question.
Keller et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: