Emelie Curl

activity

20182024

most citedUsing Markov chains to determine expected propagation time for probabilistic zero forcing

5 citations · 5 across the 4 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2020

The Polychromatic Number of Small Subsets of the Integers Modulo $n$

Emelie Curl, John Goldwasser, Joe Sampson +1

If $S$ is a subset of an abelian group $G$ , the polychromatic number of $S$ in $G$ is the largest integer $k$ so that there is a $k -$ coloring of the elements of $G$ such that every…

math.CO2019

Skew throttling

Emelie Curl, Jesse Geneson, Leslie Hogben

Zero forcing is a process that colors the vertices of a graph blue by starting with some vertices blue and applying a color change rule. Throttling minimizes the sum of the number…

math.CO2019★ 5 cited

Using Markov chains to determine expected propagation time for probabilistic zero forcing

Yu Chan, Emelie Curl, Jesse Geneson +4

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 (determin…

The Polychromatic Number of Small Subsets of the Integers Modulo n

Skew throttling

Using Markov chains to determine expected propagation time for probabilistic zero forcing

The Polychromatic Number of Small Subsets of the Integers Modulo $n$