4 problems

Let $r\in\mathbb{N}$, and let $p_1,\ldots,p_r$ be functions of $n$ satisfying … Let $\mathbf{G}=\mathbf{G}(n,p_1,p_2,\ldots,p_r)$ and, for $i\in[r]$, define $P_i:=p_1p_2\cdots p_i$…

For the ring puzzle, let $p_{\epsilon}(n)$ be the unique value of $p$ such that the probability that the jigsaw process solves the puzzle is $f0a0\epsilon$, for fixed…

Let $p_c(n)$ denote the critical probability for jigsaw percolation on the ring puzzle graph with an Erdős–Rényi people graph. Critical-constant conjecture. The leading constant in…

Let $p_c(n)$ denote the critical probability for jigsaw percolation on the ring puzzle graph with an Erdős–Rényi people graph. Second-order asymptotic conjecture. There exist const…