The classical parking function story is as follows: we have cars $v_1,\ldots,v_n$ who approach a line of spaces marked $0,\ldots,n-1$ in order. Each car $v_i$ has space preference …

Let G be a finite undirected connected graph. A divisor on G is an element of the free abelian group Div(G) on the vertices of G (or an integer-valued function on the vertices.) …

This question is about a popular probabilistic model on graphs studied in physics, mostly, for the standard lattice in ${\mathbb R}^n$ but also on other graphs (this model is of th …