### Top Posts

### Recent comments

- Tim Penttila on A rant
- Tim Penttila on A rant
- Peter Cameron on A rant
- Dima on Oligomorphic groups: topology or geometry?
- G. Smith on The symmetric group, 1

### Blogroll

- Astronomy Picture of the Day
- Azimuth
- British Combinatorial Committee
- Comfortably numbered
- Diamond Geezer
- Exploring East London
- From hill to sea
- Gödel's lost letter and P=NP
- Gil Kalai
- Jane's London
- Jon Awbrey
- Kourovka Notebook
- LMS blogs page
- Log24
- London Algebra Colloquium
- London Reconnections
- MathBlogging
- Micromath
- Neill Cameron
- neverendingbooks
- Noncommutative geometry
- numericana hall of fame
- Ratio bound
- Robert A. Wilson's blog
- Since it is not …
- Spitalfields life
- Sylvy's mathsy blog
- SymOmega
- Terry Tao
- The Aperiodical
- The De Morgan Journal
- The ICA
- The London column
- The Lumber Room
- The matroid union
- Theorem of the day
- Tim Gowers
- XKCD

### Find me on the web

### Cameron Counts: RSS feeds

### Meta

# Tag Archives: random walk

## London Combinatorics Colloquia

The second speaker at this year’s Queen Mary colloquium, János Pach, said at the start of his talk that he first came to Britain as a backpacker some years ago; at that time he never imagined that by now there … Continue reading

Posted in events
Tagged discrepancy, flows, Glauber dynamics, induced subgraphs, percolation, Ramsey theory, random walk, tilings
Leave a comment

## Random orbits on colourings, or nested Markov chains

I promised after reporting Catherine Greenhill’s talk last week that I would advertise this little problem; so here goes. How do we pick a random proper colouring of a graph Γ? There is a simple Markov chain for this, also … Continue reading

Posted in exposition, open problems
Tagged graph colouring, Markov chain, orbits, random walk
Leave a comment