|
ИСТИНА |
Войти в систему Регистрация |
ФНКЦ РР |
||
Reproducing Network Structure: A Comparative Study of Random Graph Generatorsстатья
Информация о цитировании статьи получена из
Web of Science,
Scopus
Дата последнего поиска статьи во внешних источниках: 10 августа 2018 г.
- Авторы: Mikhail Drobyshevskiy, Denis Turdakov, Sergey Kuznetsov
- Сборник: 2017 Ivannikov ISPRAS Open Conference (ISPRAS)
- Том: 1
- Год издания: 2017
- Издательство: IEEE Computer Society
- Местоположение издательства: United States
- Первая страница: 83
- Последняя страница: 89
- DOI: 10.1109/ISPRAS.2017.00021
- Аннотация: The problem of generating graphs similar to a given one arises in such tasks as data anonymization and significance testing of network mining tools. Main challenges lie in a rich diversity of graph domains emerging in various research areas and the uncertainty about graph properties to be reproduced. Our central statement is that a good graph generation model should follow two requirements on generated graphs: 1) similarity to the original one in terms of manifold graph metrics, and 2) variability wide enough to mimic natural diversity across a graph domain. In this work we have compared three state-of-the-art graph generators, Embedding based Random Graph Generator, Gscaler, and Stochastic Kronecker Graph, universal enough to fit an arbitrary graph. We found that ERGG and Gscaler greatly outperform SKG in graph reproducing accuracy in terms of graph metrics. An experiment with domain imitation showed that the variability of ERGG generated graphs resembled the original variability, while Gscaler graphs were almost identical.
- Добавил в систему: Кузнецов Сергей Дмитриевич