3 problems

Consider the continuous last-passage percolation model in $[0,1]^d$, with an optimal path given by the closure of … For $d\geq 3$, jumps in this path may cross lower-dimensional se…

Let $G$ be a finite transitive graph. Say that $G$ has the $EIT(c)$ property, for $0<c<1$, if for every pair of vertices $u,v\in G$ there is a set of paths from $v$ to $u$ equipped…

Let $\Upsilon$ be the space of polygonal paths equipped with the push-forward a priori probability measure $p$, let $f$ be the potential … where $J(n)\geq 0$ tends to zero sufficie…