On total weight exiting finite, strongly connected sets in shift-invariant weighted directed graphs on \mathbb{Z}

Abstract: For a shift-invariant weighted directed graph with vertex set

m a t h b b Z

, we examine the minimal weight

k a p p a_{0}

exiting a finite, strongly connected set of vertices. Although

k a p p a_{0}

is defined as an infimum, it has been shown that the infimum is always attained by an actual set of vertices. We show that for each underlying directed graph (prior to assignment of the weights), there is a formula for

k a p p a_{0}

as a minimum of finitely many integer combinations of the edge weights. We find this formula for several different directed graphs. Motivation for this problem comes from random walks in Dirichlet environments (equivalently, directed edge reinforced random walks), where the size of

k a p p a_{0}

has been shown to determine the strength of finite traps where the walk can get stuck for a long time.

This page was built for publication: On total weight exiting finite, strongly connected sets in shift-invariant weighted directed graphs on $\mathbb{Z}$

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6399225)