Complexity

Generalized graph entropies

Journal Article

Abstract

This article deals with generalized entropies for graphs. These entropies result from applying information measures to a graph using various schemes for defining probability distributions over the elements (e.g., vertices) of the graph. We introduce a new class of generalized measures, develop their properties, compute the measures for selected graphs, and briefly discuss potential applications to classification and clustering problems. © 2011 Wiley Periodicals, Inc. Complexity, 17,45–50, 2011

Related Topics

Related Publications

Related Content

Site Footer

Address:

This website is provided by John Wiley & Sons Limited, The Atrium, Southern Gate, Chichester, West Sussex PO19 8SQ (Company No: 00641132, VAT No: 376766987)

Published features on StatisticsViews.com are checked for statistical accuracy by a panel from the European Network for Business and Industrial Statistics (ENBIS)   to whom Wiley and StatisticsViews.com express their gratitude. This panel are: Ron Kenett, David Steinberg, Shirley Coleman, Irena Ograjenšek, Fabrizio Ruggeri, Rainer Göb, Philippe Castagliola, Xavier Tort-Martorell, Bart De Ketelaere, Antonio Pievatolo, Martina Vandebroek, Lance Mitchell, Gilbert Saporta, Helmut Waldl and Stelios Psarakis.