8 citations · 35 across the 17 of their papers we have counts for
4 papers · 1 filter
Excited random walk with periodic cookies
Gady Kozma, Tal Orenshtein, Igor Shinkar
In this paper we consider an excited random walk on in identically piled periodic environment. This is a discrete time process on defined by parameters $(…
Bi-Lipschitz Bijection between the Boolean Cube and the Hamming Ball
Itai Benjamini, Gil Cohen, Igor Shinkar
We construct a bi-Lipschitz bijection from the Boolean cube to the Hamming ball of equal volume. More precisely, we show that for all even n there exists an explicit bijection f fr…
A Tight Upper Bound on Acquaintance Time of Graphs
Omer Angel, Igor Shinkar
In this note we confirm a conjecture raised by Benjamini et al. \cite{BST} on the acquaintance time of graphs, proving that for all graphs with vertices it holds that $\AC(…
Acquaintance Time of a Graph
Itai Benjamini, Igor Shinkar, Gilad Tsur
We define the following parameter of connected graphs. For a given graph we place one agent in each vertex of . Every pair of agents sharing a common edge is declared to be…