Laplacian eigenvalues and optimality

A commercial break …

An LTCC intensive course by R. A. Bailey and Peter J. Cameron
Rockefeller Building, Gower Street, London, 13-14 June 2012

The course brings together concepts from Pure Mathematics (Laplacian
eigenvalues of graphs) and Statistics (optimal design of experiments).

It will be organised as four 2-hour lectures, commencing at 1pm on Wednesday 13 June 2012, and finishing at around 1pm the next day.

Lecture 1: Block designs (RAB)
Block designs in use; complete- and incomplete-block designs; balanced incomplete-block designs; estimation using block designs.
Lecture 2: Graphs and Laplacians (PJC)
The Laplacian matrix of a graph and its spectrum; connections with spanning trees, isoperimetric properties, electrical networks and random walks.
Lecture 3: Designs, graphs and optimality (RAB)
The concurrence and Levi graphs of a block design. Variance and resistance, spanning trees. Definitions of optimality; optimality of BIBDs and group divisible designs.
Lecture 4: More on graphs (PJC)
Optimality and graph properties; variance-balanced designs. The Tutte polynomial; spanning trees, acyclic and totally cyclic orientations of graphs.

To register for the course, email Nisha Jones,
There is a course web page at

About Peter Cameron

I count all the things that need to be counted.
This entry was posted in events, exposition and tagged , , , , . Bookmark the permalink.

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

This site uses Akismet to reduce spam. Learn how your comment data is processed.