Very sharp distance and range transitions for random walk bridges on Ramanujan graphs

For vertex-transitive Ramanujan graphs with logarithmic girth, a simple random walk bridge of length of order $\log N$, where $N$ is the size of the graph, has a maximum distance that changes from order $\sqrt{\log N}$ to order $\log N$ in a bounded critical window. We prove this by separating bridg