Limiting increment conjecture for expected propagation times of n-Suns

From papers

For the n-Sunn\operatorname{-Sun} graph, let ept(n-Sun)\operatorname{ept}(n\operatorname{-Sun}) denote its expected propagation time. Limiting increment conjecture.

limn(ept(n-Sun)ept((n1)-Sun))=1116=0.6875.\lim_{n\rightarrow\infty} \left(\operatorname{ept}(n\operatorname{-Sun})-\operatorname{ept}((n-1)\operatorname{-Sun})\right)=\frac{11}{16}=0.6875.

The conjecture is motivated by the tabulated numerical values of successive expected-propagation-time differences, which approach 0.68750.6875. Its status is not established in the supplied material.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Yu Chan, Emelie Curl, Jesse Geneson, Leslie Hogben, Kevin Liu, Issac Odegard and Michael S. Ross, “Using Markov chains to determine expected propagation time for probabilistic zero forcing”, arXiv:1906.11083 (2019).

Solutions 0

No solutions have been posted yet.