Fixed Points of Graph Peeling

Abstract : Degree peeling is used to study complex networks. It corresponds to a decomposition of the graph into vertex groups of increasing minimum degree. However, the peeling value of a vertex is non-local in this context since it relies on the connections the vertex has to groups above it. We explore a different way to decompose a network into edge layers such that the local peeling value of the vertices on each layer does not depend on their non-local connections with the other layers. This corresponds to the decomposition of a graph into subgraphs that are invariant with respect to degree peeling, i.e. they are fixed points. We introduce in this context a method to partition the edges of a graph into fixed points of degree peeling, called the iterative-edge-core decomposition. Information from this decomposition is used to formulate a notion of vertex diversity based on Shannon's entropy. We illustrate the usefulness of this decomposition in social network analysis. Our method can be used for community detection and graph visualization.
Complete list of metadatas

Cited literature [25 references]  Display  Hide  Download
Contributor : François Queyroi <>
Submitted on : Tuesday, June 11, 2013 - 2:42:07 PM
Last modification on : Friday, August 9, 2019 - 3:24:02 PM
Long-term archiving on : Thursday, September 12, 2013 - 4:08:19 AM


Files produced by the author(s)


  • HAL Id : hal-00832807, version 1



James Abello, François Queyroi. Fixed Points of Graph Peeling. 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, Aug 2013, Niagara Falls, Canada. ⟨hal-00832807⟩



Record views


Files downloads