A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
On reduction of graphs and Markov chain models
2011
IEEE Conference on Decision and Control and European Control Conference
This paper introduces a new method for reducing large directed graphs to simpler graphs with fewer nodes. The reduction is carried out through node and edge aggregation, where the simpler graph is representative of the original large graph. Representativeness is measured using a metric defined herein, which is motivated by thermodynamic free energy and vector quantization problems in the data compression literature. The resulting aggregation scheme is largely based on the maximum entropy
doi:10.1109/cdc.2011.6160882
dblp:conf/cdc/XuSB11
fatcat:mbsd6dzr6zcx7lrylnckgim5mu