Random skeletons in high-dimensional lattice trees

We study the behaviour of the rescaled minimal subtree containing the origin and K random vertices selected from a random critical (sufficiently spread-out, and in dimensions d > 8) lattice tree conditioned to survive until time ns, in the limit as n goes to infinity. We prove joint weak convergence of various quantities associated with these subtrees under this sequence of conditional measures to their counterparts for historical Brownian motion. We also show that when K is sufficiently large the entire rescaled tree is close to this rescaled skeleton with high probability, uniformly in n. These two results are the key conditions used in [5] to prove that the simple random walk on sufficiently spread-out lattice trees (conditioned to survive for a long time) converges to Brownian motion on a super-Brownian motion (conditioned to survive). The main convergence result is established more generally for a sequence of historical processes converging to historical Brownian motion in the sense of finite dimensional distributions and satisfying a pair of technical conditions. The conditions are readily verified for the lattice trees mentioned above and also for critical branching random walk. We expect that it will also apply with suitable changes to other lattice models in sufficiently high dimensions such as oriented percolation and the voter model. In addition some forms of the second skeleton density result are already established in this generality.