EqRank: A Self-Consistent Equivalence Relation on Graph Vertexes
<|reference_start|>EqRank: A Self-Consistent Equivalence Relation on Graph Vertexes: A new method of hierarchical clustering of graph vertexes is suggested. In the method, the graph partition is determined with an equivalence relation satisfying a recursive definition stating that vertexes are equivalent if the vertexes they point to (or vertexes pointing to them) are equivalent. Iterative application of the partitioning yields a hierarchical clustering of graph vertexes. The method is applied to the citation graph of hep-th. The outcome is a two-level classification scheme for the subject field presented in hep-th, and indexing of the papers from hep-th in this scheme. A number of tests show that the classification obtained is adequate.<|reference_end|>
@article{pivovarov2003eqrank:,
    title={EqRank: A Self-Consistent Equivalence Relation on Graph Vertexes},
    author={Grigorii Pivovarov and Sergei Trunov},
    journal={arXiv preprint arXiv:cs/0308044},
    year={2003},
    archivePrefix={arXiv},
    eprint={cs/0308044},
    primaryClass={cs.DS cs.DL}
}