### Current browse context:

math.CO

### Change to browse by:

### References & Citations

# Mathematics > Combinatorics

# Title: Algorithmic aspects of $M$-Lipschitz mappings of graphs

(Submitted on 16 Jan 2018 (v1), last revised 24 Apr 2018 (this version, v3))

Abstract: $M$-Lipschitz mappings of graphs (or equivalently graph-indexed random walks) are a generalization of standard random walk on $\mathbb{Z}$. For $M \in \N$, an \emph{$M$-Lipschitz mapping} of a connected rooted graph $G = (V,E)$ is a mapping $f: V \to \Z$ such that root is mapped to zero and for every edge $(u,v) \in E$ we have $|f(u) - f(v)| \le M$.

We study two natural problems regarding graph-indexed random walks. - Computing the maximum range of a graph-indexed random walk for a given graph. - Deciding if we can extend a partial GI random walk into a full GI random walk for a given graph.

We show that both these problems are polynomial-time solvable and we show efficient algorithms for them. To our best knowledge, this is the first algorithmic treatment of Lipschitz mappings of graphs. Furthermore, our problem of extending partial mappings is connected to the problem of \emph{list homomorphism} and yields a better run-time complexity for a specific family of its instances.

## Submission history

From: Jan Bok [view email]**[v1]**Tue, 16 Jan 2018 22:17:52 GMT (1381kb)

**[v2]**Thu, 22 Mar 2018 22:26:09 GMT (1374kb)

**[v3]**Tue, 24 Apr 2018 21:11:48 GMT (1375kb)