“A month ago he and some coauthors published a paper "A Cascadic Multigrid Algorithm for Computing the Fiedler Vector of Graph Laplacians" in a math journal (http://arxiv.org/abs/1412.0565; note that the arXiv date is earlier than the publication date, since arXiv is a preprint server) and the media had a field day with the "NFL player publishes math paper…”
A Cascadic Multigrid Algorithm for Computing the Fiedler Vector of Graph Laplacians
In this paper, we develop a cascadic multigrid algorithm for fast computation of the Fiedler vector of a graph Laplacian, namely, the eigenvector corresponding to the second smallest eigenvalue. This vector has been found to have applications in fields such as graph partitioning and graph drawing. The algorithm is a purely algebraic approach based on a heavy edge coarsening scheme and pointwise smoothing for refinement. To gain theoretical insight, we also consider the related cascadic multigrid method in the geometric setting for elliptic eigenvalue problems and show its uniform convergence under certain assumptions. Numerical tests are presented for computing the Fiedler vector of several practical graphs, and numerical results show the efficiency and optimality of our proposed cascadic multigrid algorithm.
候选层:至少 2 个不同的人、在 2 个不同月份提到过,还没到主书架的 3 人 3 个月。没有做立场标注,所以只写“被提及”。
HN 书评
推荐在前,同类按时间 · 每篇最多保留 20 条,统计用全部提及“I liked a recent paper by Baltimore Raven's center John Urschel et. al. on "Cascadic Multigrid Algorithm for Computing the Fiedler Vector of Graph Laplacians" - that was mentioned on ESPN of all places (of course not the title, it was just "math" to them). Maybe "shortest-path" isn't your geometric interest, but there is definitely an overlap with this ma…”