Talk page
Title:
Random Conductances and the Chromatic Polynomial
Speaker:
Abstract:
For a graph G, the chromatic polynomial at negative integer values is the expected value of a certain quantity, related to Dirichlet energy, over the simplex of random positive conductances (of sum 1). Talk based on joint work with Wei Yeung Lam.
Link:
Workshop: