I have a very basic doubt about mixing time of the graph. I want to know how the mixing time reduces as I add edge to a connected graph $G$. Is there a possibility of the mixing time of the random walker to increase in a graph if the edges are added in some adversarial fashion? (my intuition says the mixing time should decrease).
I would be very grateful if someone could point to some resource or help me understand the change in mixing time as the graph adds one edge at a time.
Thanks!