An upper bound for the critical probability on the Cartesian product graph of a regular tree and a line

zbMath1442.05239arXiv1705.06873MaRDI QIDQ5219089

Kohei Yamamoto

Publication date: 6 March 2020

Full work available at URL: https://arxiv.org/abs/1705.06873

zbMATH Keywords

Bernoulli bond percolationGolton-Watson process

Mathematics Subject Classification ID

Trees (05C05) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

Nonuniqueness and mean-field criticality for percolation on nonunimodular transitive graphs

This page was built for publication: An upper bound for the critical probability on the Cartesian product graph of a regular tree and a line