An upper bound for the critical probability on the Cartesian product graph of a regular tree and a line
Abstract
In Bernoulli bond percolation on the Cartesian product graph of a d-regular tree and a line, we give an upper bound for the critical probability pc.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.