pith. sign in

arxiv: 1203.1256 · v1 · pith:JXTPSUDCnew · submitted 2012-03-06 · 🧮 math.PR · math.CO

The Laplacian on planar graphs and graphs on surfaces

classification 🧮 math.PR math.CO
keywords laplaciandiscussgraphsplanarannulusaspectscharacteristiccharacterization
0
0 comments X
read the original abstract

These are lecture notes for the Current Developments in Mathematics conference at Harvard, November, 2011. We discuss topological, probabilistic and combinatorial aspects of the Laplacian on a graph embedded on a surface. The three main goals are to discuss: (1) for "circular" planar networks, the characterization due to Colin de Verdi\`ere of Dirichlet-to-Neumann operator; (2) The connections with the random spanning tree model; and (3) the characteristic polynomial of the Laplacian on an annulus and torus.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.