Next Article in Journal
Pythagorean Fuzzy Hamy Mean Operators in Multiple Attribute Group Decision Making and Their Application to Supplier Selection
Next Article in Special Issue
Fuzzy Normed Rings
Previous Article in Journal
Solution of Fractional Differential Equation Systems and Computation of Matrix Mittag–Leffler Functions
Previous Article in Special Issue
A Multi-Granularity 2-Tuple QFD Method and Application to Emergency Routes Evaluation
Open AccessArticle

Invariant Graph Partition Comparison Measures

Karlsruhe Institute of Technology, Institute of Information Systems and Marketing, Kaiserstr. 12, 76131 Karlsruhe, Germany
*
Author to whom correspondence should be addressed.
Symmetry 2018, 10(10), 504; https://doi.org/10.3390/sym10100504
Received: 10 September 2018 / Revised: 10 October 2018 / Accepted: 11 October 2018 / Published: 15 October 2018
(This article belongs to the Special Issue Discrete Mathematics and Symmetry)
  |  
PDF [485 KB, uploaded 23 October 2018]
  |  

Abstract

Symmetric graphs have non-trivial automorphism groups. This article starts with the proof that all partition comparison measures we have found in the literature fail on symmetric graphs, because they are not invariant with regard to the graph automorphisms. By the construction of a pseudometric space of equivalence classes of permutations and with Hausdorff’s and von Neumann’s methods of constructing invariant measures on the space of equivalence classes, we design three different families of invariant measures, and we present two types of invariance proofs. Last, but not least, we provide algorithms for computing invariant partition comparison measures as pseudometrics on the partition space. When combining an invariant partition comparison measure with its classical counterpart, the decomposition of the measure into a structural difference and a difference contributed by the group automorphism is derived. View Full-Text
Keywords: graph partitioning; graph clustering; invariant measures; partition comparison; finite automorphism groups; graph automorphisms graph partitioning; graph clustering; invariant measures; partition comparison; finite automorphism groups; graph automorphisms
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).

Supplementary material

SciFeed

Share & Cite This Article

MDPI and ACS Style

Ball, F.; Geyer-Schulz, A. Invariant Graph Partition Comparison Measures. Symmetry 2018, 10, 504.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Symmetry EISSN 2073-8994 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top