A Geometrical Structure for an Infinite Oriented Cluster and its Uniqueness
Abstract
We consider the supercritical oriented percolation model. Let be all the percolation points. For each u∈ , we write γu as its right-most path. Let G=u γu. In this paper, we show that G is a single tree with only one topological end. We also present a relationship between and G and construct a bijection between and using the preorder traversal algorithm. Through applications of this fundamental graph property, we show the uniqueness of an infinite oriented cluster by ignoring finite vertices.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.