Sciweavers

368 search results - page 10 / 74
» Higher Eigenvalues of Graphs
Sort
View
ICASSP
2009
IEEE
13 years 11 months ago
Principal component analysis in decomposable Gaussian graphical models
We consider principal component analysis (PCA) in decomposable Gaussian graphical models. We exploit the prior information in these models in order to distribute its computation. ...
Ami Wiesel, Alfred O. Hero III
JCT
2006
54views more  JCT 2006»
13 years 7 months ago
Spectral estimates for Abelian Cayley graphs
We give two short proofs that for fixed d, a d-regular Cayley graph on an Abelian group of order n has second eigenvalue bounded below by d - O(dn-4/d), where the implied constant...
Joel Friedman, Ram Murty, Jean-Pierre Tillich
ENDM
2002
84views more  ENDM 2002»
13 years 7 months ago
Addressing the Petersen graph
Motivated by a problem on message routing in communication networks, Graham and Pollak proposed a scheme for addressing the vertices of a graph G by N-tuples of three symbols in s...
Randall J. Elzinga, David A. Gregory, Kevin N. Van...
ICML
2006
IEEE
14 years 8 months ago
Higher order learning with graphs
Recently there has been considerable interest in learning with higher order relations (i.e., three-way or higher) in the unsupervised and semi-supervised settings. Hypergraphs and...
Sameer Agarwal, Kristin Branson, Serge Belongie
JCT
2007
119views more  JCT 2007»
13 years 7 months ago
Cliques and the spectral radius
We prove a number of relations between the number of cliques of a graph G and the largest eigenvalue (G) of its adjacency matrix. In particular, writing ks (G) for the number of s...
Béla Bollobás, Vladimir Nikiforov