Effective drift estimates for random walks on graph products

We find uniform lower bounds on the drift for a large family of random walks on graph products, of the form P(|Z(n)| < kn) <= e(-kappa n) for k > 0. This includes the simple random walk for a right-angled Artin group with a sparse defining graph. This is done by extending an argument of Gouezel, along with the combinatorial notion of a piling introduced by Crisp, Godelle, and Wiest. We do not use any moment conditions, instead considering random walks which alternate between one measure uniformly distributed on vertex groups, and another measure over which we make no assumptions.