Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Cinkoske, Mike"'
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 length $d$. If the graph is $(e,d)$-depth-robust for any $e,d$ such that
Externí odkaz:
http://arxiv.org/abs/2110.04190
Autor:
Blocki, Jeremiah, Cinkoske, Mike
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 at most $|S| \leq e$ nodes (resp. edges) the graph $G-S$ contains a di
Externí odkaz:
http://arxiv.org/abs/1910.08920
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 properties of an excited random walk are more difficult to investigate th
Externí odkaz:
http://arxiv.org/abs/1708.08576