The Laplacian on planar graphs and graphs on surfaces
From MaRDI portal
Publication:5265149
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.
Recommendations
- The Laplacian spectral radius of graphs on surfaces
- The Laplacian spectral radius of graphs on a surface
- On the geometry and Laplacian of a graph
- The spectral radius of graphs on surfaces
- The Laplacian and Dirac operators on critical planar graphs
- A survey of graph laplacians
- The signless Laplacian spectral radius of graphs on surfaces
- Planar graphs on nonplanar surfaces
- Graph Laplacians and topology
- Laplacian of a graph covering and its applications
Cited in
(24)- The Laplacian and Dirac operators on critical planar graphs
- The cd-indices of intervals in the uncrossing partial order on matchings
- Electroid varieties and a compactification of the space of electrical networks
- Shellability of face posets of electrical networks and the CW poset property
- Gagliardo-Nirenberg-Sobolev inequalities on planar graphs
- Circular planar electrical networks: posets and positivity
- Notes on discrete Gaussian scale space
- Learning about critical phenomena from scribbles and sandpiles
- Vertex-colored graphs, bicycle spaces and Mahler measure
- The space of circular planar electrical networks
- scientific article; zbMATH DE number 6602242 (Why is no real title available?)
- Algebraic properties of generalized graph Laplacians: resistor networks, critical groups, and homological algebra
- The uncrossing partial order on matchings is Eulerian
- Laminations of a graph on a pair of pants
- Circular Planar Electrical Networks, Split Systems, and Phylogenetic Networks
- The totally nonnegative Grassmannian is a ball
- The totally nonnegative Grassmannian is a ball
- scientific article; zbMATH DE number 7715365 (Why is no real title available?)
- Generalized recursive atom ordering and equivalence to CL-shellability
- Inverse problems related to electrical networks and the geometry of non-negative Grassmannians
- Weighted sums of rooted spanning forests on cycles with pendant edges
- Modern theory of electrical networks: from the matrix-tree theorem to the theory of cluster varieties
- Period matrices and homological quasi-trees on discrete Riemann surfaces
- Ising model and the positive orthogonal Grassmannian
This page was built for publication: The Laplacian on planar graphs and graphs on surfaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5265149)