Abstract
We consider the supercritical oriented percolation model. Let ${\fK}$ be all the percolation points. For each $u\in {\fK}$, we write as its right-most path. Let . In this paper, we show that is a single tree with only one topological end. We also present a relationship between ${\fK}$ and and construct a bijection between ${\fK}$ 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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.