(eng): The paper presents a method how the problem of finding a lower bound on the spectral gap for a zero range process on a connected graph could be transformed into the problem of finding a lower bound on spectral gap of a simple random walk on the graph.

(cze): V clanku se ukazuje, jak lze ulohu nalezeni odhadu spektralni mezery pro Zero-range proces na grafu prevest na ulohu hledani spektralni mezery nahodne prochazky na grafu