Abstract
For any system {i} of particles with the trajectories xi(t) in Rd on a finite time interval [0,τ] we define the interaction graph G . Vertices of G are the particles, there is an edge between two particles i and j iff for some t∊[0,τ] the distance between particles i and j is not greater than some constant. We undertake a detailed study of this graph for infinite particle dynamics and prove exponential estimates for its finite connected components. This also solves continuous percolation problem for complicated geometrical objects—the tubes around particle trajectories.