|Email:||schlauch [at] cs.uni-kl.de|
|Phone:||+49 631 205 3353|
At the moment I am looking deeper into subgraph sampling. There are several reasons to do this: First, for some graphs calculating a measure is quite time-expensive and not all information is needed. Therefore, it is good to know if only a subsample achieves the same results, not on a quantitative but on a qualitative level.
Second, based on my Bachelor thesis I got interested in motif counting in graphs. Nowadays, being faced with gianormous datasets/graphs, it is quite impossible to calculate how many motifs does the actual graph contain and how many are in randomized versions. Therefore I am investigating if the estimated number of motifs can be calculated in a more simple way and if subgraph-sampling changes the behavior of the developed system.
|Superordinated page: Group members|
|Feedback for this Page|
|Email to the person in charge of this page (email@example.com) [more ...]|