This is the imaginative title of my PhD thesis. It contains four unrelated pieces of work. (I was warned off using this phrasing in the thesis itself, where the chapters are instead described as “self-contained”.) The first and most substantial concerns partition regularity. It is a coherent presentation of all of the material from Partition …
Tag: random-walks
Random walks on quasirandom graphs
Ben Barber and Eoin Long, The Electronic Journal of Combinatorics, 20(4) (2013), #P25 PDF Take a long (proportional to ) random walk in a quasirandom graph . Must the subgraph of edges traversed by be quasirandom? We’d like to say yes, for the following reason: visits every vertex about the same number of times, so we …