Algebraic Properties of Generalized Graph Laplacians: Resistor Networks, Critical Groups, and Homological Algebra
DOI10.1137/16M1072607zbMath1387.05153arXiv1604.07075WikidataQ125604300 ScholiaQ125604300MaRDI QIDQ4641761
Collin Litterell, Austin J. Stromme, Avi Levy, Will Dana, David Jekel
Publication date: 18 May 2018
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1604.07075
critical grouphomological algebragraph Laplaciandiscrete harmonic functionresistor networklayer-stripping
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Analytic circuit theory (94C05) Discrete version of topics in analysis (39A12) Ext and Tor, generalizations, Künneth formula (category-theoretic aspects) (18G15) Graph operations (line graphs, products, etc.) (05C76)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Electrical networks and Lie theory
- Metric properties of the tropical Abel-Jacobi map
- Chip-firing games on graphs
- The sandpile group of a tree
- Balancing vectors in the max norm
- Arithmetical graphs
- Circular planar graphs and resistor networks
- A finite group attached to the laplacian of a graph
- Chip-firing and the critical group of a graph
- On the critical group of the \(n\)-cube
- On the sandpile group of dual graphs
- The critical group of a threshold graph
- Planar electric networks. II
- Critical groups of simplicial complexes
- Circular planar electrical networks: posets and positivity
- Determinants of Laplacians on graphs
- Riemann-Roch and Abel-Jacobi theory on a finite graph
- Discrete Complex Analysis on Planar Quad-Graphs
- Inverse Problem in Cylindrical Electrical Networks
- Harmonic Morphisms and Hyperelliptic Graphs
- Chip-Firing and Rotor-Routing on Directed Graphs
- Bicycles and Spanning Trees
- The Dirichlet to Neumann Map for a Resistor Network
- On coincidence of entropies for two classes of dynamical systems
- Algebraic Potential Theory on Graphs
- Self-organized critical state of sandpile automaton models
- A discrete analogue of the harmonic morphism and green kernel comparison theorems
- Finding the conductors in circular networks from boundary measurements
- The Laplacian on planar graphs and graphs on surfaces
- Discrete Riemann surfaces and the Ising model.
This page was built for publication: Algebraic Properties of Generalized Graph Laplacians: Resistor Networks, Critical Groups, and Homological Algebra