Sciweavers

14 search results - page 1 / 3
» Discovering parametric clusters in social small-world graphs
Sort
View
SAC
2005
ACM
13 years 10 months ago
Discovering parametric clusters in social small-world graphs
We present a strategy for analyzing large, social small-world graphs, such as those formed by human networks. Our approach brings together ideas from a number of different resear...
Jonathan McPherson, Kwan-Liu Ma, Michael Ogawa
JSAI
2001
Springer
13 years 9 months ago
A Document as a Small World
The small world topology is known widespread in biological, social and man-made systems. This paper shows that the small world structure also exists in documents, such as papers. A...
Yutaka Matsuo, Yukio Ohsawa, Mitsuru Ishizuka
ESA
2005
Springer
128views Algorithms» more  ESA 2005»
13 years 10 months ago
Greedy Routing in Tree-Decomposed Graphs
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg ...
Pierre Fraigniaud
EPIA
2009
Springer
13 years 11 months ago
An Algorithm to Discover the k-Clique Cover in Networks
Abstract. In social network analysis, a k-clique is a relaxed clique, i.e., a kclique is a quasi-complete sub-graph. A k-clique in a graph is a sub-graph where the distance between...
Luís Cavique, Armando B. Mendes, Jorge M. A...
PAKDD
2010
ACM
193views Data Mining» more  PAKDD 2010»
13 years 3 months ago
As Time Goes by: Discovering Eras in Evolving Social Networks
Abstract. Within the large body of research in complex network analysis, an important topic is the temporal evolution of networks. Existing approaches aim at analyzing the evolutio...
Michele Berlingerio, Michele Coscia, Fosca Giannot...