Sciweavers

APPROX
2009
Springer
98views Algorithms» more  APPROX 2009»
13 years 11 months ago
Random Tensors and Planted Cliques
The r-parity tensor of a graph is a generalization of the adjacency matrix, where the tensor’s entries denote the parity of the number of edges in subgraphs induced by r distinc...
S. Charles Brubaker, Santosh Vempala
STOC
2003
ACM
118views Algorithms» more  STOC 2003»
14 years 5 months ago
A proof of Alon's second eigenvalue conjecture
A d-regular graph has largest or first (adjacency matrix) eigenvalue 1 = d. In this paper we show the following conjecture of Alon. Fix an integer d > 2 and a real > 0. Then...
Joel Friedman
WWW
2005
ACM
14 years 5 months ago
TruRank: taking PageRank to the limit
PageRank is defined as the stationary state of a Markov chain depending on a damping factor that spreads uniformly part of the rank. The choice of is eminently empirical, and in...
Sebastiano Vigna