## Presentations

This is a list of all seminar and conference talks I have given, as well as talks I have given to high school students or at open days, etc. I also mention conferences or workshops which I have attended as a non-speaking participant.

2017 | 2016 | 2015 | 2014 | 2013 | 2012 | 2011 | ||||||||

2010 | 2009 | 2008 | 2007 | 2006 | 2005 | 2004 | 2003 | 2002 | 2001 | 2000 | 1999 | 1998 | 1997 | 1995 |

### 2017

August 2017, Computational Counting (photo), at Schloss Dagstuhl, Germany: "A threshold result for loose Hamiltonicity in random regular uniform hypergraphs".

June 2017, CanaDAM 2017, Ryerson University, Toronto, Canada (non-speaking participant).

April 2017, Pure Mathematics seminar, School of Mathematics and Statistics, UNSW: "Hamilton cycles in random hypergraphs".

January 2017, a lunchtime lecture at the 2017 AMSI Summer School, University of Sydney: "Hamilton cycles in random hypergraphs".

### 2016

December 2016, 40ACCMCC (photo), University of Newcastle: "A threshold result for loose Hamiltonicity in random regular uniform hypergraphs".

June 2016, Probabilistic and Extremal Combinatorics Downunder, Monash University: "The average number of spanning trees in sparse graphs with given degrees" (Invited speaker).

May 2016, Geometry and Toplogy Seminar, University of Sydney: "Colouring random graphs and hypergraphs".

May 2016, I attended the workshop Random Instances and Phase Transitions, held at the Simons Institute for the Theory of Computing as part of their program on Counting Complexity and Phase Transitions.

March 2016, Counting Program Seminar Series, Simons Institute for the Theory of Computing, Berkeley: "The expected number of spanning trees in random graphs with given degrees" (invited seminar).

February 2016, I was co-organiser and attendee at the workshop Approximate Counting, Markov Chains and Phase Transitions, held at the Simons Institute for the Theory of Computing as part of their program on Counting Complexity and Phase Transitions.

### 2015

December 2015, 39ACCMCC, University of Queensland: "Sampling and counting using Markov chains" (plenary speaker).

December 2015, New Zealand Mathematics Colloquium 2015, University of Canterbury, New Zealand: "Colouring random graphs and hypergraphs" (plenary speaker).

September 2015, Adelle Coster and I presented a Girls Do The Maths session to students attending the L'Oreal Girls in Science Forum 2015, hosted at UNSW.

August 2015, speaker in the UNSW Faculty of Science's Celebrating Women in Science Leadership Symposium. (Watch my presentation.)

August 2015, Maths Colloquium, School of Mathematics and Physics, University of Queensland: "Colouring random graphs and hypergraphs".

July 2015, lecture entitled "Ramsey Theory and Random Graphs" during Talented Students' Day at Macquarie University. This is a day of talks for bright Year 12 students, organised by the Mathematical Association of New South Wales.

June 2015, NICTA ORG Seminar, NICTA, Kensington UNSW: "The switch Markov chain for sampling irregular graphs".

May 2015, Science at the Shine Dome, Australian Academy of Science, Canberra: "From sampling to counting and back again" (invited speaker: I received the Christopher Heyde medal for research in pure mathematics).

April 2015, Workshop on Random Walks on Random Graphs and Applications, EurRandom, Eindhoven, The Netherlands: "The switch Markov chain for sampling irregular graphs" (invited speaker).

February 2015, Workshop on Algebraic, Number Theoretic and Graph Theoretic Aspects of Dynamical Systens (photo), School of Mathematics and Statistics, UNSW: "The switch Markov chain for sampling irregular graphs".

January 2015, SODA 2015, San Diego, USA: "The switch Markov chain for sampling irregular graphs".

### 2014

December 2014, Joanna Wang and I gave a presentation to a group of career counsellors from Malaysian high schools, entitled: "Careers in Mathematics: the possibilities are infinite". The visit was coordinated by the UNSW International Office.

December 2014, 38ACCMCC 2014 (photo), Wellington, New Zealand: "Asymptotic enumeration of sparse uniform hypergraphs with given degrees".

August 2014, Pure Mathematics seminar, School of Mathematics and Statistics, UNSW: "Fast and slow mixing of Markov chains for the ferromagnetic Potts model".

June 2014, SIAM Conference on Discrete Mathematics (DM14), Minneapolis, USA: "Sampling graphs using Markov chains" (invited minisymposium talk).

### 2013

December 2013, 37ACCMCC 2013 (photo), University of Western Australia, Perth: "On the chromatic number of a random hypergraph".

July 2013, Erdős Centennial Conference, the Hungarian Academy of Science, Budapest, Hungary (non-speaking participant).

March 2013, School of Mathematical Sciences Colloquium, University of Adelaide: "How fast? Bounding the mixing time of combinatorial Markov chains".

March 2013, Differential Geometry Seminar, University of Adelaide: "On the chromatic number of a random hypergraph".

### 2012

December 2012, 36ACCMCC 2012, University of New South Wales: Director. (I didn't give a talk.)

September 2012, Advanced Mathematics Day, UNSW (a day of talks for our Advanced Mathematics students): "Mathematics and me".

August 2012, Discrete Mathematics Research Group, Monash University: "Fast and slow mixing of Markov chains for the ferromagnetic Potts model".

May 2012, Workshop on Mathematical Physics of Complex Networks: From Graph Theory to Biological Physics, Max Planck Institute for the Physics of Complex Networks, Dresden, Germany: "Sampling regular directed graphs in polynomial time" (invited speaker).

May 2012, Computer Science Department Seminar, University of Liverpool, UK: "Making Markov chains less lazy".

April 2012, DIMAP seminar, University of Warwick, UK: "Making Markov chains less lazy".

March 2012, Combinatorics Study Group, Queen Mary, University of London, UK: "Making Markov chains less lazy".

February 2012, Statistics seminar, Durham University, UK: "Making Markov chains less lazy".

January 2012, ACiD seminar, Durham University, UK: "Making Markov chains less lazy".

### 2011

December 2011, 35ACCMCC 2011, Monash University, Melbourne: "Making Markov chains less lazy".

September 2011, Pure Mathematics Seminar, School of Mathematics and Statistics, UNSW: "Making Markov chains less lazy, Part II".

August 2011, Pure Mathematics Seminar, School of Mathematics and Statistics, UNSW: "Making Markov chains less lazy".

July 2011, British Combinatorial Conference (BCC 2011) , University of Exeter, UK: "Sampling regular directed graphs in polynomial time".

May 2011, 15th Random Structures and Algorithms Conference (photo), Emory University, Atlanta GA, USA: "Sampling regular directed graphs in polynomial time".

March 2011, Pure Mathematics Seminar, School of Mathematics and Statistics, UNSW: "Generating graphs randomly".

February 2011, presentation to students from Burwood Girls High School who were visiting the School of Mathematics and Statistics, UNSW: "We are all connected".

January 2011, Theory Day in Sydney, University of Sydney: "Generating graphs randomly" (invited speaker).

### 2010

December 2010, 34ACCMCC 2010, ANU, Canberra: "Generating graphs randomly" (invited speaker).

November 2010, presentation to students from Kingsgrove High School who were visiting the School of Mathematics and Statistics, UNSW: "We are all connected".

July 2010, workshop on Combinatorics and Mathematical Physics, UQ: "A rapidly mixing Markov chain for regular directed graphs" (invited speaker).

July 2010, presentation (with Timothy Schlub, School of Medical Sciences, UNSW) to the Nura Gili Winter School participants, Science stream: "Mathematics: the possibilities are infinite".

June 2010, Coimbra Meeting on 0-1 Matrix Theory and Related Topics, Coimbra, Portugal: "Asymptotic enumeration of 0-1 matrices: the sparse case" (invited speaker).

### 2009

I was maternity leave for almost all of 2009, and curiously enough I gave no presentations during that time.

### 2008

December 2008, Pure Mathematics Seminar, School of Mathematics and Statistics, UNSW: "Asymptotic enumeration of correlation-immune boolean functions".

June 2008, Combinatorics 2008, Costermano, Italy: "Asymptotic enumeration of correlation-immune boolean functions".

May 2008, Design and Analysis of Randomized and Approximation Algorithms (photo), at Schloss Dagstuhl, Germany: "The cycle structure of two rows in a random latin square".

April 2008, Teaching Seminar, School of Mathematics and Statistics, UNSW: "Should we try to encourage students to attend our lectures? If yes, how can we achieve this?".

March 2008, Workshop on Markov chain Monte Carlo Methods (photo), as part of the Isaac Newton Institute program on Combinatorics and Statistical Mechanics, Cambridge, UK: "Asymptotic enumeration of contingency tables" .

### 2007

December 2007, 32ACCMCC 2007, Otago University, Dunedin, New Zealand: "Sparse nonnegative integer matrices and how to enumerate them".

November 2007, Workshop on Graph intersection problems, UQ: "How to pull random regular graphs apart" (invited speaker).

September 2007, Canberra Workshop on Asymptotic Combinatorics, ANU: "Sparse nonnegative integer matrices and how to enumerate them" (invited speaker).

### 2006

September 2006, 50th annual Australian Mathematical Society meeting, Macquarie University, in the Special Session on Combinatorics and Geometry: "Expansion properties of a random regular graph after random vertex deletions".

September 2006, Algebra Seminar, School of Mathematics and Statistics, University of Sydney: "Asymptotic enumeration of irregular bipartite graphs".

September 2006, Gary Froyland, David Warton and I gave a presentation at the UNSW Courses and Careers Day, entitled "Careers in Mathematics: the possibilities are infinite".

August 2006, Science Fact and Fiction (UNSW Faculty of Science Open Day for school students): "We are all connected".

July 2006, NZIMA/31ACCMCC 2006, Alice Springs, Northern Territory: "Neighbour-distinguishing edge colourings of random regular graphs".

May 2006, Pure Mathematics Seminar, School of Mathematics, UNSW: "Sampling regular graphs with application to a peer-to-peer network".

January 2006, Discrete Mathematics seminar, Department of Discrete Mathematics, Adam Mickiewicz University, Poznan, Poland: "Asymptotic enumeration of irregular bipartite graphs".

### 2005

December 2005, 30ACCMCC 2005, The University of Queensland, Brisbane: "Asymptotic enumeration of dense 0-1 matrices with specified line sums".

November 2005, gave a talk at a mathematics prizegiving ceremony at PLC Sydney (an independent girls' school at Croydon, Sydney): "The collaboration graph and other stories".

September 2005, Gary Froyland, David Warton and I gave a presentation at the UNSW Courses and Careers Day, entitled "Careers in Mathematics".

September 2005, gave a speech at the School Mathematics Competition prizegiving ceremony at UNSW, entitled "Chance, patterns and mathematics".

July 2005, BCC 2005, University of Durham, UK: "Bounds on the generalised acyclic chromatic numbers of bounded degree graphs".

January 2005, Workshop on Markov chains in Algorithms and Statistical Physics, part of the MSRI program on Probability, Algorithms and Statistical Physics, Berkeley, USA: "Sampling regular graphs and a peer-to-peer network".

January 2005, SODA 2005, Vancouver, Canada: "Sampling regular graphs and a peer-to-peer network".

January 2005, Graph Theory seminar, Combinatorics and Optimization Department, University of Waterloo, Canada: "Sampling regular graphs and a peer-to-peer network".

### 2004

December 2004, NZIMA/29ACCMCC 2004, Lake Taupo, New Zealand: "Sampling regular graphs and a peer-to-peer network" (invited speaker).

September 2004, Teacher's Afternoon, organised by AMSI/ICE-EM as part of the Australian Mathematical Society meeting, RMIT, Melbourne: "Proving deterministic results in Ramsey Theory by flipping a coin".

June 2004, Pure Mathematics Seminar, School of Mathematics, UNSW: "Generalised acyclic edge colourings of random regular graphs".

April 2004, Algebra Seminar, School of Mathematics and Statistics, University of Sydney: "Random regular graphs".

### 2003

December 2003, 28ACCMCC 2003, Deakin University, Melbourne: "Asymptotic enumeration of sparse irregular bipartite graphs".

October 2003, Pure Mathematics Seminar, School of Mathematics, UNSW: "Contiguity and random regular graphs".

September 2003, seminar, School of Electrical Engineering and Computer Science, The University of Newcastle: "Random regular graphs".

July 2003, lecture entitled "Graphs, Graphs and More Graphs" during Talented Students' Day at the University of Sydney. This is a day of talks for bright Year 12 students, organised by the Mathematical Association of New South Wales.

July 2003, seminar, Centre for Computer Security Research (now Network and Communication Security Research), School of Information Technology and Computer Science, University of Wollongong: "Random regular graphs".

July 2003, ICIAM 2003, Sydney, Australia: "Contiguity and random regular graphs".

May 2003, Algorithms and Cryptography seminar, Centre for Advanced Computing - Algorithms and Cryptography, Macquarie University: "Random regular graphs".

May 2003, Pure Mathematics Seminar, School of Mathematics, UNSW: "The differential equations method for discrete random processes".

March 2003, Pure Mathematics Seminar, School of Mathematics, UNSW: "Random regular graphs".

### 2002

December 2002, 27ACCMCC 2002, Newcastle, NSW: "Generalised acyclic edge colourings of random regular graphs".

September 2002, Workshop on Combinatorial and Computational Aspects of Statistical Physics/Random Graphs and Structures, as part of the Isaac Newton Institute program on Computation, Combinatorics and Probability, Cambridge, UK: "Generalised acyclic edge colourings of random regular graphs".

August 2002, Workshop on Randomized Algorithms, as part of the Isaac Newton Institute program on Computation, Combinatorics and Probability, Cambridge, UK: "The differential equations method".

July 2002, FPSAC 2002, 14th International Conference on Formal Power Series and Algebraic Combinatorics, The University of Melbourne, Australia. I was a member of the Organising Committee (see photo).

June 2002, Statistical Mechanics and Combinatorics Seminar, Department of Mathematics and Statistics, University of Melbourne: "Generalised acyclic edge colourings of random regular graphs".

### 2001

December 2001, Statistical Mechanics and Combinatorics Seminar, Department of Mathematics and Statistics, University of Melbourne: "Generation of simple quadrangulations of the sphere".

November 2001, Enrichment lecture on "Random walks". This was a lecture to selected bright students from years 9 and 10, organised by the Maths Olympiad and the Department of Mathematics and Statistics of the University of Melbourne.

October 2001, Probability and Statistics Seminar, School of Mathematical Sciences, Monash University : "Contiguity and random regular graphs".

September 2001, Algebra and Combinatorics Seminar, Department of Mathematics, University of Queensland: "Hamiltonian decompositions of random bipartite regular graphs".

July 2001, British Combinatorial Conference 2001, University of Sussex: "Permutation pseudographs and contiguity".

June 2001, LFCS Theory Seminar, Division of Informatics, University of Edinburgh: "Hamiltonian decompositions of random bipartite regular graphs".

June 2001, Combinatorial Seminar, Mathematical Institute, Oxford University: "Hamiltonian decompositions of random bipartite regular graphs".

June 2001, Dagstuhl Seminar on Design and Analysis of Randomized and Approximation Algorithms: "Connectedness of the bounded-degree star process".

May 2001, Oberseminar Theoretische Informatik, Lehrstuhl für Effiziente Algorithmen, Technische Universität München: "Hamiltonian decompositions of random bipartite regular graphs".

### 2000

December 2000, 25ACCMCC 2000, Christchurch, New Zealand: "The relative complexity of approximate counting problems".

August 2000, ISMP 2000, Atlanta, USA: "The relative complexity of approximate counting problems" (invited minisymposium talk).

July 2000, COCOON 2000, Bondi Beach, Sydney, Australia (participant).

June 2000, Computer Science Seminar, Department of Computer Science and Software Engineering, University of Melbourne: "Convergence of the Iterated Prisoner's dilemma game".

March/April 2000, Series of four talks to the Combinatorial Seminar, Department of Mathematics and Statistics, University of Melbourne: "Some rapid mixing results obtained using path coupling", "Path coupling: some details", "Path coupling: some details, Take 2", and "An extension of path coupling".

January 2000, Logic and Computation Seminar, School of Computer Studies, University of Leeds: "Some rapid mixing results obtained using path coupling".

January 2000, SODA 2000, San Francisco: "An extension of path coupling and its application to the Glauber dynamics for graph colouring" and "The complexity of counting graph homomorphisms".

### 1999

December 1999, Oberseminar, Heinz Nixdorf Institut, Paderborn, Germany: "Path coupling with stopping times".

November 1999, DIMACS meeting on "Probabilistic analysis of algorithms for hard problems", Rutgers, New Jersey (participant).

October 1999, Mathematics Seminar, Centre for Discrete and Applicable Mathematics, Department of Mathematics, London School of Economics: "An extension of path coupling and its application to the Glauber dynamics for graph colourings".

September 1999, RAND2 meeting, Oxford (participant).

August 1999, Random Structures and Algorithms 1999, Poznan, Poland: "The complexity of counting graph homomorphisms".

July 1999, British Combinatorial Conference 1999, Canterbury: "A new analysis of the Glauber dynamics for graph colourings".

June 1999, Liverpool Algorithms Day, Liverpool University: "On the Glauber dynamics for graph colourings".

May 1999, RAND2 Meeting, Orsay, Paris: "The complexity of counting graph homomorphisms".

### 1998

October 1998, Computer Science seminar, Computer Science Department, University of Warwick: "Some applications of path coupling".

July 1998, WRASS'98 Workshop, University of Warwick (participant).

July 1998, ICALP 1998, Aalborg, Denmark: "A genuinely polynomial-time algorithm for sampling two-rowed contingency tables".

May 1998, Combinatorial Seminar, Mathematical Institute, Oxford University: "Some #P-completeness proofs for colourings and independent sets".

March 1998, RAND2 Meeting, University of Edinburgh: "A genuinely polynomial-time algorithm for sampling two-rowed contingency tables".

January 1998, SODA98 Conference, San Francisco: "Faster random generation of linear extensions" (on behalf of Bubley and Dyer), and "Beating the $2\Delta$ bound for approximately counting colourings: a computer-assisted proof of rapid mixing".

### 1997

September 1997, RAND2 workshop, University of Leeds: "A new Markov chain for graph colourings".

### 1995

Sometime in 1995, Combinatorial Seminar, Mathematical Institute, Oxford University: "Comparisions of efficiency of finite field extensions".