6 citations · 9 across the 13 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2020★ 1 cited
Probabilistic Zero Forcing on Grid, Regular, and Hypercube Graphs
David Hu, Alec Sun
Probabilistic zero-forcing is a coloring process on a graph. In this process, an initial set of vertices is colored blue, and the remaining vertices are colored white. At each time…
math.CO2019★ 6 cited
Bounds on expected propagation time of probabilistic zero forcing
Shyam Narayanan, Alec Sun
Probabilistic zero forcing is a coloring game played on a graph where the goal is to color every vertex blue starting with an initial blue vertex set. As long as the graph is conne…
math.CO2019
Zero-sum subsequences in bounded-sum -sequences
Alec Sun
We study the problem of finding zero-sum blocks in bounded-sum sequences, which was introduced by Caro, Hansberg, and Montejano. Caro et al. determine the minimum -sequen…