An upper bound for the critical probability on the Cartesian product graph of a regular tree and a line
classification
🧮 math.PR
keywords
boundcartesiancriticalgraphlineprobabilityproductregular
read the original 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 $p_c$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.