scholarly journals Bounds on expected propagation time of probabilistic zero forcing

2021 ◽  
Vol 98 ◽  
pp. 103405
Author(s):  
Shyam Narayanan ◽  
Alec Sun
2019 ◽  
Vol 576 ◽  
pp. 124-141 ◽  
Author(s):  
Franklin H.J. Kenter ◽  
Jephian C.-H. Lin

2012 ◽  
Vol 160 (13-14) ◽  
pp. 1994-2005 ◽  
Author(s):  
Leslie Hogben ◽  
My Huynh ◽  
Nicole Kingsley ◽  
Sarah Meyer ◽  
Shanise Walker ◽  
...  

2020 ◽  
Vol 36 (36) ◽  
pp. 318-333 ◽  
Author(s):  
Yu Chan ◽  
Emelie Curl ◽  
Jesse Geneson ◽  
Leslie Hogben ◽  
Kevin Liu ◽  
...  

Zero forcing is a coloring game played on a graph where each vertex is initially colored blue or white and the goal is to color all the vertices blue by repeated use of a (deterministic) color change rule starting with as few blue vertices as possible. Probabilistic zero forcing yields a discrete dynamical system governed by a Markov chain. Since in a connected graph any one vertex can eventually color the entire graph blue using probabilistic zero forcing, the expected time to do this is studied. Given a Markov transition matrix for a probabilistic zero forcing process, an exact formula is established for expected propagation time. Markov chains are applied to determine bounds on expected propagation time for various families of graphs.


2019 ◽  
Vol 254 ◽  
pp. 33-46 ◽  
Author(s):  
Joshua Carlson ◽  
Leslie Hogben ◽  
Jürgen Kritschgau ◽  
Kate Lorenzen ◽  
Michael S. Ross ◽  
...  

2021 ◽  
Vol 6 (2) ◽  
pp. 1833-1850
Author(s):  
Sakander Hayat ◽  
◽  
Hafiz Muhammad Afzal Siddiqui ◽  
Muhammad Imran ◽  
Hafiz Muhammad Ikhlaq ◽  
...  

2017 ◽  
Vol 224 ◽  
pp. 45-59 ◽  
Author(s):  
Adam Berliner ◽  
Chassidy Bozeman ◽  
Steve Butler ◽  
Minerva Catral ◽  
Leslie Hogben ◽  
...  

2015 ◽  
Vol E98.B (2) ◽  
pp. 352-359 ◽  
Author(s):  
Ping WANG ◽  
Lei DING ◽  
Huifang PANG ◽  
Fuqiang LIU ◽  
Nguyen Ngoc VAN

Sign in / Sign up

Export Citation Format

Share Document