Is there ANY ballot-type result for random walk $S_n:=\sum_{i\le n}X_i$ that allows for independent but not identically distributed random variables $X_i$, up to some uniform concentration conditions or moment bounds? By ballot-type theorem, I mean at least the upper bound with the following shape: $$\mathbb{P}(\forall J\le j\le n: S_j\le B)\le C\frac{B^C}{\sqrt{n-J}},$$
with some large constant $C>0$ independent of $B$, and some cut-off $J$(can be 1; but I guess we need the number of random variables to be large to get some concentration).
The only one I saw in the literature so far is the probability result 1 by Adam Harper, that requires $X_i$ be Gaussians with comparable variances(in between $\frac{1}{20}$ and $20$, say).
However, the result, statement (A1) on P88, is proved by relating to Lemma 5.1.8 in Lawler & Limic's Random Walk: a Modern Introduction. Then for $X_i$ not identically distributed, the statement
"But, $\mathbb{P}(S_{k+1},\cdots,S_n>S_k+1)\ge \mathbb{P}(S_{k+1}>1)\mathbb{P}(X_{k+2},\cdots,S_n-S_k>0)\ge \inf_{k}\mathbb{P}(S_k>1) \mathbb{P}(S_1,\cdots,S_n>0)$"
is not always true, because now the random walk is no longer stationary. Maybe for Gaussians with comparable variances, Harper can conduct some computations to justify it (which I don't know how); nevertheless I don't find a clue how to generalize it to other cases.