1542 search results - page 101 / 309 » The metamathematics of random graphs |
117
Voted
CORR
2004
Springer
15 years 1 months ago
2004
Springer
A d-regular graph has largest or first (adjacency matrix) eigenvalue 1 = d. Consider for an even d 4, a random d-regular graph model formed from d/2 uniform, independent permutat...
142
Voted
SDM
2010
SIAM
15 years 3 months ago
2010
SIAM
We study the application of spectral clustering, prediction and visualization methods to graphs with negatively weighted edges. We show that several characteristic matrices of gra...
107
click to vote
ICML
2010
IEEE
15 years 2 months ago
2010
IEEE
We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n log3 n + m log n) time on graphs with n vertices and m edges, and (b) with high pro...
148
click to vote
KDD
2012
ACM
13 years 4 months ago
2012
ACM
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
143
Voted
KAIS
2011
14 years 8 months ago
2011
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...