Proceedings of the twenty-second annual symposium on Principles of distributed computing
The price of anarchy in network creation games
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Signed networks in social media
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Kronecker Graphs: An Approach to Modeling Networks
The Journal of Machine Learning Research
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
A clustering coefficient network formation game
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
| Hi-index | 0.00 |
Modeling is one of the major research areas in social network analysis whose goal is to study networks structure and its evolution?. ?Motivated by the intuition that members in social networks behave selfishly?, ?network creation games have been introduced for modeling social networks?. ?In this paper?, ?our aim is to measure how much the output graphs of a given network creation game are compatible with a social network?. ?We first show that the precise measurement is not possible in polynomial time?. ?Then we propose a method for its approximation, finally?, ?we show the usability of our method by conducting experiments on real network data.