Mike Cinkoske

activity

20172021

collaborators

3 papers

cs.DS2021

On Explicit Constructions of Extremely Depth Robust Graphs

Jeremiah Blocki, Mike Cinkoske, Seunghoon Lee +1

A directed acyclic graph $G = (V, E)$ is said to be $(e, d)$ -depth robust if for every subset $S \subseteq V$ of $∣ S ∣ \leq e$ nodes the graph $G - S$ still contains a directed path of le…

cs.DS2019

A New Connection Between Node and Edge Depth Robust Graphs

Jeremiah Blocki, Mike Cinkoske

Given a directed acyclic graph (DAG) $G = (V, E)$ , we say that $G$ is $(e, d)$ -depth-robust (resp. $(e, d)$ -edge-depth-robust) if for any set $S \subset V$ (resp. $S \subseteq E$ ) of…

math.PR2017

On the Speed of an Excited Asymmetric Random Walk

Mike Cinkoske, Joe Jackson, Claire Plunkett

An excited random walk is a non-Markovian extension of the simple random walk, in which the walk's behavior at time $n$ is impacted by the path it has taken up to time $n$ . The pro…