Selfavoiding walk on regular graphs
Add to your list(s)
Download to your calendar using vCal
If you have a question about this talk, please contact neb25.
A selfavoiding walk (SAW) is a path on a graph that revisits no vertex. The connective constant of a graph is defined to be the exponential growth rate of the number of nstep SAWs with respect to n. We prove that sqrt{d1} is a universal lower bound for connective constants of any infinite, connected, transitive, simple, dregular graph. We also prove that the connective constant of a Cayley graph decreases strictly when a new relator is added to the group and increases strictly when a nontrivial word is declared to be a generator. Joint work with Geoffrey Grimmett.
This talk is part of the Probability series.
This talk is included in these lists:
Note that exdirectory lists are not shown.
