Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

STOC

2010

ACM

2010

ACM

The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spectral profile G() minimizes the Rayleigh quotient (from the variational characterization) of the spectral gap of the Laplacian matrix of G over vectors with support at most over a suitable probability measure. Formally, the spectral profile G of a graph G is a function G : [0, 1/2] R defined as: G() def = min xRV d(supp(x)) P gij(xi - xj)2 P i dix2 i . where gij is the weight of the edge (i, j) in the graph, di is the degree of vertex i, and d(supp(x)) is the fraction of edges incident on vertices within the support of vector x. While the notion of the spectral profile has numerous applications in Markov chain, it is also is closely tied to its isoperimetric profile of a graph. Specifically, the spectral profile is a relaxation for the problem of approximating edge expansion of small sets in graphs. In this w...

Added |
09 Aug 2010 |

Updated |
09 Aug 2010 |

Type |
Conference |

Year |
2010 |

Where |
STOC |

Authors |
Prasad Raghavendra, David Steurer and Prasad Tetali |

Comments (0)