activity
20162026
most citedBounds on expected propagation time of probabilistic zero forcing

6 citations · 9 across the 13 of their papers we have counts for

collaborators
Showing 2020Show all

2 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.NT2020★ 1 cited

A Bombieri-Vinogradov Theorem for primes in short intervals and small sectors

Tanmay Khale, Cooper O'Kuhn, Apoorva Panidapu +2

Let be a finite Galois extension of . We count primes in short intervals represented by the norm of a prime ideal of satisfying a small sector condition determi…