University of Cambridge > Talks.cam > Probability > Connectivity properties of random interlacements

Connectivity properties of random interlacements

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact grg1000.

We consider the interlacement Poisson point process on the space of doubly-infinite Zd-valued trajectories, d >=3. This random spatial process was recently introduced by Sznitman in order to describe the local picture left by the trace of a random walk when it visits a positive fraction of a large d-dimensional torus.

The present talk summarizes recent joint work with Artem Sapozhnikov (ETH). We show that almost surely every two points of the random interlacement are connected via at most ceiling(d/2) trajectories, and that this number is optimal. With a variant of this connectivity argument we also prove that the graph induced by the random interlacements is almost surely transient and that Bernoulli percolation on this graph has a non-trivial phase transition in wide enough slabs.

These results strongly suggest that despite the long-range dependencies present in the model, the geometry of the random interlacement graph is similar to that of the underlying lattice Zd

This talk is part of the Probability series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2017 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity