Hi guys,
i'm not sure i got the question correctly, but from mathematical point of view i would see it this way: let's consider the following game: you flip a coin every second and if you flip heads you win 1$ and if tails you lose 1$, we assume that you can be up or down any number of $.
if two players play this game and we are interested in the difference between their bankroll it's like only one is playing and flips twice every second co actually the same game. so suppose that one player plays this game for infitite time
for any number of $ given we can find time at which he will have exactly this number of $ (this is a well known mathematical fact, if you are interested try google "random walk"), so in other words difference of bankrolls of our two players will be this number, this means that this difference will have arbitrary big oscillations to both plus and minus so as a sequence cannot converge (at least not in classical sense) so it doesn't converge even in the case of such simple game
of course in poker such math can't be probably even applied. for example if phil ivey and patrick antonius would make a pact to follow first player to all of his tables and the other player would be playing say with me, i would omit convergence in any sense