![]() |
![]() |
University of Birmingham > Talks@bham > Combinatorics and Probability seminar > Optimal Resistor Networks
![]() Optimal Resistor NetworksAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Dr Andrew Treglown. Given a graph on n vertices with m edges, each of unit resistance, how small can the average resistance between pairs of vertices be? There are two very plausible extremal constructions—graphs like a star, and graphs which are close to regular—with the transition between them occurring when the average degree is 3. However, we show that there is a rather surprising construction which is better. This talk is part of the Combinatorics and Probability seminar series. This talk is included in these lists:Note that ex-directory lists are not shown. |
Other listsCentre for Computational Biology Seminar Series Particle Physics Seminars Topology and Dynamics seminarOther talksUltrafast, all-optical, and highly efficient imaging of molecular chirality Modelling uncertainty in image analysis. Test talk TBC Geometry of alternating projections in metric spaces with bounded curvature Extending the Lax type operator for finite W-algebras |