###
**
Grube, Tim and Schiller, Benjamin and Strufe, Thorsten
:**

*Monotone Sampling of Networks.*

Proceedings of the 2nd International Workshop on Dynamic Networks and Knowledge Discovery

[Conference or Workshop Item]
, (2014)

## Abstract

Determining the graph-theoretic properties of large real-world networks like social, computer, and biological networks, is a challenging task. Many of those networks are too large to be processed e ciently and some are not even available in their entirety. In order to reduce the size of available data or collect a sample of an existing network, several sampling algorithms were developed. They aim to produce samples whose properties are close to the original network. It is unclear what sample size is su cient to obtain a sample whose properties can be used to estimate those of the original network. This estimation requires sampling algorithms that produce results that converge smoothly to the original properties since estimations based on unsteady data are unreliable. Consequently, we eval- uate the monotonicity of sampled properties while increasing the sample size. We provide a ranking of common sampling algorithms based on their monotonicity of relevant network properties using the results from four nework classes.

Item Type: | Conference or Workshop Item |
---|---|

Erschienen: | 2014 |

Creators: | Grube, Tim and Schiller, Benjamin and Strufe, Thorsten |

Title: | Monotone Sampling of Networks |

Language: | English |

Abstract: | Determining the graph-theoretic properties of large real-world networks like social, computer, and biological networks, is a challenging task. Many of those networks are too large to be processed e ciently and some are not even available in their entirety. In order to reduce the size of available data or collect a sample of an existing network, several sampling algorithms were developed. They aim to produce samples whose properties are close to the original network. It is unclear what sample size is su cient to obtain a sample whose properties can be used to estimate those of the original network. This estimation requires sampling algorithms that produce results that converge smoothly to the original properties since estimations based on unsteady data are unreliable. Consequently, we eval- uate the monotonicity of sampled properties while increasing the sample size. We provide a ranking of common sampling algorithms based on their monotonicity of relevant network properties using the results from four nework classes. |

Title of Book: | Proceedings of the 2nd International Workshop on Dynamic Networks and Knowledge Discovery |

Volume: | 1229 |

Uncontrolled Keywords: | - P2P: Online social networks;- P2P - Area Peer-to-Peer Systems;- SSI - Area Secure Smart Infrastructures;SPIN: Smart Protection in Infrastructures and Networks |

Divisions: | Department of Computer Science Department of Computer Science > Telecooperation |

Date Deposited: | 09 May 2017 10:51 |

Identification Number: | TUD-CS-2014-1092 |

Export: |

#### Optionen (nur für Redakteure)

View Item |