Overlapping community detection in networks: The state-of-the-art and comparative study

J Xie, S Kelley, BK Szymanski - Acm computing surveys (csur), 2013 - dl.acm.org
This article reviews the state-of-the-art in overlapping community detection algorithms,
quality measures, and benchmarks. A thorough comparison of different algorithms (a total of …

Analyzing and modeling real-world phenomena with complex networks: a survey of applications

LF Costa, ON Oliveira Jr, G Travieso… - Advances in …, 2011 - Taylor & Francis
The success of new scientific areas can be assessed by their potential in contributing to new
theoretical approaches and in applications to real-world problems. Complex networks have …

The structure and function of complex networks

MEJ Newman - SIAM review, 2003 - SIAM
Inspired by empirical studies of networked systems such as the Internet, social networks,
and biological networks, researchers have in recent years developed a variety of techniques …

[图书][B] Complex networks: structure, robustness and function

R Cohen, S Havlin - 2010 - books.google.com
Examining important results and analytical techniques, this graduate-level textbook is a step-
by-step presentation of the structure and function of complex networks. Using a range of …

Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters

J Leskovec, KJ Lang, A Dasgupta… - Internet …, 2009 - Taylor & Francis
A large body of work has been devoted to defining and identifying clusters or communities in
social and information networks, ie, in graphs in which the nodes represent underlying …

The eigentrust algorithm for reputation management in p2p networks

SD Kamvar, MT Schlosser… - Proceedings of the 12th …, 2003 - dl.acm.org
Peer-to-peer file-sharing networks are currently receiving much attention as a means of
sharing and distributing information. However, as recent experience shows, the anonymous …

Fast exact shortest-path distance queries on large networks by pruned landmark labeling

T Akiba, Y Iwata, Y Yoshida - Proceedings of the 2013 ACM SIGMOD …, 2013 - dl.acm.org
We propose a new exact method for shortest-path distance queries on large-scale networks.
Our method precomputes distance labels for vertices by performing a breadth-first search …

[PDF][PDF] Kronecker graphs: an approach to modeling networks.

J Leskovec, D Chakrabarti, J Kleinberg… - Journal of Machine …, 2010 - jmlr.org
How can we generate realistic networks? In addition, how can we do so with a
mathematically tractable model that allows for rigorous analysis of network properties? Real …

Epidemic spreading in real networks: An eigenvalue viewpoint

Y Wang, D Chakrabarti, C Wang… - … Symposium on Reliable …, 2003 - ieeexplore.ieee.org
How will a virus propagate in a real network? Does an epidemic threshold exist for a finite
graph? How long does it take to disinfect a network given particular values of infection rate …

[图书][B] Evolution and structure of the Internet: A statistical physics approach

R Pastor-Satorras, A Vespignani - 2004 - dl.acm.org
Evolution and Structure of the Internet | Guide books skip to main content ACM Digital Library
home ACM Association for Computing Machinery corporate logo Google, Inc. (search) …