Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Auctions, bargaining, bidding and selling, and other market models (91B26) Exact enumeration problems, generating functions (05A15) Signed and weighted graphs (05C22) Enumeration in graph theory (05C30) Microeconomic theory (price theory and economic markets) (91B24)
Abstract: The paper describes an explicit combinatorial formula for a harmonic vector for the Laplacian of a directed graph with arbitrary edge weights. This result was motivated by questions from mathematical economics, and the formula plays a crucial role in forthcoming joint work of the author on the emergence of prices and money in an exchange economy. It turns out that the formula is closely related to well-studied problems in graph theory, in particular to the so-called matrix tree theorem due to W. Tutte and independently to R. Bott and J. Mayberry. As a further application of our considerations, we obtain a short new proof of both the matrix tree theorem as well as its generalization due to S. Chaiken.
Recommendations
Cited in
(4)
This page was built for publication: Harmonic vectors and matrix tree theorems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477973)
