COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

## Self-avoiding walk on regular graphsAdd to your list(s) Download to your calendar using vCal - Zhongyang Li (Cambridge)
- Tuesday 28 May 2013, 16:30-17:30
- MR12, CMS, Wilberforce Road, Cambridge, CB3 0WB.
If you have a question about this talk, please contact neb25. A self-avoiding 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 n-step SAWs with respect to n. We prove that sqrt{d-1} is a universal lower bound for connective constants of any infinite, connected, transitive, simple, d-regular 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 non-trivial 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:- All CMS events
- All Talks (aka the CURE list)
- CMS Events
- DPMMS Lists
- DPMMS info aggregator
- DPMMS lists
- MR12, CMS, Wilberforce Road, Cambridge, CB3 0WB
- Probability
- School of Physical Sciences
- Statistical Laboratory info aggregator
Note that ex-directory lists are not shown. |
## Other listsChemical Engineering and Biotechnology Departmental Seminars Gurdon Institute Talks Gates Cambridge Annual Lecture 7 March 2017## Other talksThermodynamics The Challenge of Scaling Up Low Carbon Fuels Synthesis RIG Postdoc Seminar Trading places: understanding psychosis risk in migrant groups Testing your memory: The many consequences of retrieval on long-term learning and retention Single Cell Seminars (September) |