[officialchicken]

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 material, topology, and requires Comp Sci.

arXiv:1412.0565v1

Edit: add link http://arxiv.org/abs/1412.0565

[syadegari]

Thanks for mentioning the paper, this comes close to one of my topics of interest, spectral graph theory. Although quite an interesting subject (I can see myself easily being drawn to the subject), I wonder if there has been any attempts to understand or study the topological structure at the heart of algorithms that are used for learning or natural language processing/parsing. I am quite curious and eager about these methods so if you happen to know of a paper or reference please let me know.