Graph sampling refers to the process of deriving a small subset of nodes from a possibly huge graph in order to estimate properties of the whole graph from examining the sample. Whereas topological properties can already be obtained accurately by sampling, current approaches do not take possibly hidden dependencies between node topology and attributes into account. Especially in the context of online social networks, node attributes are of importance as they correspond to properties of the social network's users. Therefore, existing sampling algorithms can be extended to attribute sampling, but still lack the capturing of structural properties. Analyzing topology (e.g., node degree, clustering coefficient) and attribute properties (e.g., age, location) jointly can provide valuable insights into the social network and allows for a better understanding of social processes. As major contribution, this work proposes a novel sampling algorithm which provides unbiased and reliable estimates of joint topological and attribute based graph properties in a resource efficient fashion. Furthermore, the obtained samples allow for the generation of synthetic graphs, which show high similarity to the original graph with respect to topology and attributes. The proposed sampling and generation algorithms are evaluated on real world social network graphs, for which they demonstrate to be effective.
%0 Journal Article
%1 info3-article-2016-1
%A Seufert, Michael
%A Lange, Stanislav
%A Hoßfeld, Tobias
%D 2016
%J Computer Communications
%K myown can
%N Part B
%P 176-187
%T More than Topology: Joint Topology and Attribute Sampling and Generation of Social Network Graphs
%V 73
%X Graph sampling refers to the process of deriving a small subset of nodes from a possibly huge graph in order to estimate properties of the whole graph from examining the sample. Whereas topological properties can already be obtained accurately by sampling, current approaches do not take possibly hidden dependencies between node topology and attributes into account. Especially in the context of online social networks, node attributes are of importance as they correspond to properties of the social network's users. Therefore, existing sampling algorithms can be extended to attribute sampling, but still lack the capturing of structural properties. Analyzing topology (e.g., node degree, clustering coefficient) and attribute properties (e.g., age, location) jointly can provide valuable insights into the social network and allows for a better understanding of social processes. As major contribution, this work proposes a novel sampling algorithm which provides unbiased and reliable estimates of joint topological and attribute based graph properties in a resource efficient fashion. Furthermore, the obtained samples allow for the generation of synthetic graphs, which show high similarity to the original graph with respect to topology and attributes. The proposed sampling and generation algorithms are evaluated on real world social network graphs, for which they demonstrate to be effective.
@article{info3-article-2016-1,
abstract = {Graph sampling refers to the process of deriving a small subset of nodes from a possibly huge graph in order to estimate properties of the whole graph from examining the sample. Whereas topological properties can already be obtained accurately by sampling, current approaches do not take possibly hidden dependencies between node topology and attributes into account. Especially in the context of online social networks, node attributes are of importance as they correspond to properties of the social network's users. Therefore, existing sampling algorithms can be extended to attribute sampling, but still lack the capturing of structural properties. Analyzing topology (e.g., node degree, clustering coefficient) and attribute properties (e.g., age, location) jointly can provide valuable insights into the social network and allows for a better understanding of social processes. As major contribution, this work proposes a novel sampling algorithm which provides unbiased and reliable estimates of joint topological and attribute based graph properties in a resource efficient fashion. Furthermore, the obtained samples allow for the generation of synthetic graphs, which show high similarity to the original graph with respect to topology and attributes. The proposed sampling and generation algorithms are evaluated on real world social network graphs, for which they demonstrate to be effective. },
added-at = {2016-03-17T16:49:17.000+0100},
author = {Seufert, Michael and Lange, Stanislav and Hoßfeld, Tobias},
biburl = {https://www.bibsonomy.org/bibtex/207052e59de2481033ce8fca5c26fff9f/uniwue_info3},
interhash = {b45917e68d3615b7d250fe680849231d},
intrahash = {07052e59de2481033ce8fca5c26fff9f},
journal = {Computer Communications},
keywords = {myown can},
month = {1},
number = {Part B},
pages = {176-187},
timestamp = {2022-03-14T00:14:32.000+0100},
title = {More than Topology: Joint Topology and Attribute Sampling and Generation of Social Network Graphs},
volume = 73,
year = 2016
}