Abstract — Computing meaningful clusters of nodes is crucial to analyze large networks. In this paper, we present a pairwise node similarity measure that allows to extract roles, i.e. group of nodes sharing similar flow patterns within a network. We propose a low rank iterative scheme to approximate the similarity measure for very large networks. Finally, we show that our low rank similarity score successfully extracts the different roles in random graphs and that its performances are similar to the full rank pairwise similarity measure. I
We present a clustering method for collections of graphs based on the assumptions that graphs in the...
Many large network data sets are noisy and contain links representing low-intensity relationships th...
We consider methods for quantifying the similarity of vertices in networks. We propose a measure of ...
Graphs allow to represent real problems in an abstract fashion which, though easily stated, raises n...
Many real networks encompass a community structure which means that nodes are organized in densely c...
We present a framework to cluster nodes in directed networks according to their roles by combining R...
RoleSim and SimRank are popular graph-theoretic similarity measures with many applications in, e.g.,...
Roles and positions are structural components in complex social systems which group actors based on ...
Graphs are a data structure that lends itself to representing a wide range of entities connected by ...
RoleSim and SimRank are among the popular graph-theoretic similarity measures with many applications...
Structural node similarity is widely used in analyzing complex networks. As one of the structural no...
Subject of this dissertation is the assessment of graph similarity. The application context and ulti...
Abstract Roles represent node-level connectivity patterns such as star-center, star-edge nodes, near...
Funding Information: The authors thank the anonymous reviewers for useful comments. G.B. and V.N. ar...
We present a clustering method for collections of graphs based on the assumptions that graphs in the...
We present a clustering method for collections of graphs based on the assumptions that graphs in the...
Many large network data sets are noisy and contain links representing low-intensity relationships th...
We consider methods for quantifying the similarity of vertices in networks. We propose a measure of ...
Graphs allow to represent real problems in an abstract fashion which, though easily stated, raises n...
Many real networks encompass a community structure which means that nodes are organized in densely c...
We present a framework to cluster nodes in directed networks according to their roles by combining R...
RoleSim and SimRank are popular graph-theoretic similarity measures with many applications in, e.g.,...
Roles and positions are structural components in complex social systems which group actors based on ...
Graphs are a data structure that lends itself to representing a wide range of entities connected by ...
RoleSim and SimRank are among the popular graph-theoretic similarity measures with many applications...
Structural node similarity is widely used in analyzing complex networks. As one of the structural no...
Subject of this dissertation is the assessment of graph similarity. The application context and ulti...
Abstract Roles represent node-level connectivity patterns such as star-center, star-edge nodes, near...
Funding Information: The authors thank the anonymous reviewers for useful comments. G.B. and V.N. ar...
We present a clustering method for collections of graphs based on the assumptions that graphs in the...
We present a clustering method for collections of graphs based on the assumptions that graphs in the...
Many large network data sets are noisy and contain links representing low-intensity relationships th...
We consider methods for quantifying the similarity of vertices in networks. We propose a measure of ...