Sciweavers

KAIS
2011
129views more  KAIS 2011»
12 years 9 months ago
Counting triangles in real-world networks using projections
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
Charalampos E. Tsourakakis
GRC
2008
IEEE
13 years 3 months ago
Effects of Varying the Delay Distribution in Random, Scale-free, and Small-world Networks
Graph-theory-based approaches have been used with great success when analyzing abstract properties of natural and artificial networks. However, these approaches have not factored...
Bum Soon Jang, Timothy Mann, Yoonsuck Choe
AAAI
2007
13 years 4 months ago
Probabilistic Community Discovery Using Hierarchical Latent Gaussian Mixture Model
Complex networks exist in a wide array of diverse domains, ranging from biology, sociology, and computer science. These real-world networks, while disparate in nature, often compr...
Haizheng Zhang, C. Lee Giles, Henry C. Foley, John...
ACMSE
2005
ACM
13 years 8 months ago
Bibliometric approach to community discovery
Recent research suggests that most of the real-world random networks organize themselves into communities. Communities are formed by subsets of nodes in a graph, which are closely...
Narsingh Deo, Hemant Balakrishnan
WAW
2007
Springer
157views Algorithms» more  WAW 2007»
13 years 8 months ago
Stochastic Kronecker Graphs
A random graph model based on Kronecker products of probability matrices has been recently proposed as a generative model for large-scale real-world networks such as the web. This...
Mohammad Mahdian, Ying Xu 0002
PKDD
2007
Springer
132views Data Mining» more  PKDD 2007»
13 years 8 months ago
An Algorithm to Find Overlapping Community Structure in Networks
Recent years have seen the development of many graph clustering algorithms, which can identify community structure in networks. The vast majority of these only find disjoint commun...
Steve Gregory
ICPR
2008
IEEE
13 years 9 months ago
Detecting hubs and quasi cliques in scale-free networks
Scale-free networks are believed to closely model most real-world networks. An interesting property of such networks is the existence of so-called hub and community structures. In...
Sriganesh Srihari, Hoong Kee Ng, Kang Ning, Hon Wa...
COMPLEX
2009
Springer
13 years 9 months ago
Characterizing the Structural Complexity of Real-World Complex Networks
Although recent research has shown that the complexity of a network depends on its structural organization, which is linked to the functional constraints the network must satisfy, ...
Jun Wang, Gregory M. Provan