University of Cambridge > Talks.cam > Probability > Cutoff for Random Walk on Random Cayley Graphs

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Cutoff for Random Walk on Random Cayley Graphs

Download to your calendar using vCal

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

Consider the random Cayley graph of a finite group G with respect to k generators chosen uniformly at random, with 1 << log k << log|G|: the vertices are the group elements, and g, h in G are connected if there exists a generator z so that g = hz or gz = h.

A conjecture of Aldous and Diaconis asserts that the simple random walk on this graph exhibits cutoff, at a time which depends only on |G| and k, not on the algebraic structure of the group G (ie universally in G). We verify this conjecture for a wide class of Abelian groups.

Time permitting, we discuss extensions to the case where the underlying group G is non-Abelian. There the cutoff time cannot be written only as a function of |G| and of k; it depends on the algebraic structure.

Joint work with Jonathan Hermon

This talk is part of the Probability series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Umney Theatre, Robinson College, Cambridge Bristol-Myers-Squibb Lecture theatre, Department of Chemistry Gates Scholars Common Room, University Centre on Mill Lane

Other talks

Group Work Title to be confirmed The elephant in the room: Machine Learning directly into physical models Title to be confirmed Title TBC Machine Politics? Computers and AI in the History of Political Thought
 

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