Presentations
This is a list of all seminar and conference talks I have given,
including 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.
2009
2008
2007
2006
2005
2004
2003
2002
2001
2000
1999
1998
1997
1995
I'm on maternity leave for almost all of 2009, so there'll probably
be no talks... We'll see.
December 2008, Pure Mathematics Seminar,
School of Mathematics and Statistics,
UNSW: "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"
.
(Back to top)
December 2007,
ACCMCC 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).
(Back to top)
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
(Faculty of Science Open Day for school students): "We are all connected".
July 2006,
ACCMCC 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".
(Back to top)
December 2005,
ACCMCC 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".
(Back to top)
December 2004,
NZIMA/ACCMCC 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
Conference, 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".
(Back to top)
December 2003,
ACCMCC 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,
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".
(Back to top)
December 2002,
ACCMCC'27, 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".
(Back to top)
May 2001, Oberseminar Theoretische Informatik,
Lehrstuhl für Effiziente Algorithmen, Technische
Universität München: "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".
June 2001, Combinatorial Seminar,
Mathematical Institute,
Oxford University:
"Hamiltonian decompositions of random bipartite regular graphs".
June 2001, LFCS Theory Seminar,
Division of Informatics, University of Edinburgh:
"Hamiltonian decompositions of random bipartite regular graphs".
July 2001,
BCC 2001 , University of Sussex:
"Permutation pseudographs and contiguity".
September 2001, Algebra and Combinatorics Seminar,
Department of Mathematics, University of Queensland:
"Hamiltonian decompositions of random bipartite regular graphs".
October 2001, Probability and Statistics Seminar,
School of Mathematical Sciences, Monash University :
"Contiguity and random regular graphs".
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.
December 2001, Statistical Mechanics and Combinatorics Seminar,
Department of Mathematics and
Statistics, University of Melbourne:
"Generation of simple quadrangulations of the sphere".
(Back to top)
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".
January 2000, Logic and Computation Seminar,
School of Computer Studies,
University of Leeds:
"Some rapid mixing results obtained using path coupling".
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".
June 2000, Computer Science Seminar,
Department of Computer Science and
Software Engineering, University of Melbourne:
"Convergence of the Iterated Prisoner's dilemma game".
July 2000,
COCOON'2000, Bondi Beach, Sydney, Australia (participant).
August 2000,
ISMP 2000, Atlanta, USA:
Invited talk on "The relative complexity of approximate counting problems".
December 2000,
ACCMCC 2000,
Christchurch, New Zealand:
"The relative complexity of approximate counting problems".
(Back to top)
May 1999,
RAND2 Meeting,
Orsay, Paris: "The complexity of counting graph homomorphisms".
June 1999,
Liverpool Algorithms Day,
Liverpool University: "On the Glauber dynamics for graph colourings".
July 1999,
British Combinatorial Colloquium,
Canterbury: "A new analysis of the Glauber dynamics for graph colourings".
August 1999,
Random Structures and Algorithms,
Poznan, Poland: "The complexity of counting graph homomorphisms".
September 1999,
RAND2 Meeting,
Oxford (participant).
October 1999, Mathematics Seminar,
Centre for Discrete and Applicable Mathematics, London School of Economics:
"An extension of path coupling and its application to the
Glauber dynamics for graph colourings".
October 1999, Mathematics Seminar,
Mathematics Department, University College London:
"An extension of path coupling and its application to the
Glauber dynamics for graph colourings".
November 1999,
DIMACS meeting on "Probabilistic analysis of algorithms for
hard problems", Rutgers, New Jersey (participant).
December 1999, Oberseminar,
Heinz Nixdorf Institut, Paderborn,
Germany: "Path coupling with stopping times".
(Back to top)
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".
March 1998,
RAND2 Meeting,
University of Edinburgh:
"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".
July 1998,
ICALP Conference, Aalborg, Denmark:
"A genuinely polynomial-time algorithm for sampling
two-rowed contingency tables".
July 1998,
WRASS'98 Workshop,
University of Warwick (participant).
October 1998, Computer Science seminar,
Computer Science Department,
University of Warwick:
"Some applications of path coupling".
(Back to top)
September 1997,
RAND2 workshop,
University of Leeds: "A new Markov chain for graph colourings".
(Back to top)
Sometime in 1995, Combinatorial Seminar,
Mathematical Institute, Oxford University:
"Comparisions of efficiency of finite field extensions".
(Back to top)
