Suppose we have a finite graph. We can view this as a resistor network where each edge has unit resistance. We can then calculate the resistance between any two vertices and ask questions like `which graph with $n$ vertices and $m$ edges minimises the average resistance between pairs of vertices?' There is a `obvious' solution; we show that this answer is not correct.
This problem was motivated by some questions about the design of statistical experiments (and has some surprising applications in chemistry) but this talk will not assume any statistical knowledge.
This is joint work with Robert Johnson.
- Combinatorial Theory Seminar