Twice-Ramanujan Sparsifiers — HN submission

Mon, 28 Nov 2022 02:38:24 GMT

Every graph has a sparsifier with edges linear its vertices

3 points; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.

Twice-Ramanujan Sparsifiers — mentioned by gjm11

Fri, 11 May 2018 16:44:12 GMT

John Urschel is a mathematician who recently retired from being an NFL American football player, at least in part because of the dangers of brain damage from repeated concussions. There have been several HN posts about him, but the only one I can find with a lot of comments is this one: https://news.ycombinator.com/item?id=14866573 His favourite theorem is described here https://arxiv.org/abs/0808.0163. It's a theorem in graph theory, and it says that if you have any graph, you can find a subgraph with "not too many edges" that is "like" the original graph, in a specific sense. "Not too many"…

Paper and discussion history. A mention is not an endorsement.

Twice-Ramanujan Sparsifiers · HackerPapers discussions

Twice-Ramanujan Sparsifiers — HN submission

Twice-Ramanujan Sparsifiers — mentioned by gjm11