Very cool video :) I do share @darklordvadermort intuition concerning the relevance of percolation measures in HNSW (as a tool for optimisation of vector database). Indeed, the more "percolative" is a node in a knowledge graph, the more it will have an impact on the efficiency of query, and the more it will help to find a nearest neighbor. Could be a very interesting topic though !
Video is not clear. It jumps to formulas that imply definition of shortest paths, without providing explanation by visualization. "Percolation" itself is a physical process ("the process of a liquid, gas, etc. moving gradually through a surface that has very small holes or spaces in it") that could have been visualized directly.
![Classification of Associative Graph Products [Graph Theory]](http://i.ytimg.com/vi/hgcXmsOEbGM/mqdefault.jpg)
![Classification of Associative Graph Products [Graph Theory]](/img/tr.png)
Cool and informative video!
any interest in hierarchical navigable small worlds (probabistic/best in class nearest neighbor search algo) or tangential topics?
Hello,
I'm not familiar with that concept, sorry. However, it does look interesting from what I've read since searching for it online!
Very cool video :) I do share @darklordvadermort intuition concerning the relevance of percolation measures in HNSW (as a tool for optimisation of vector database). Indeed, the more "percolative" is a node in a knowledge graph, the more it will have an impact on the efficiency of query, and the more it will help to find a nearest neighbor. Could be a very interesting topic though !
Video is not clear. It jumps to formulas that imply definition of shortest paths, without providing explanation by visualization. "Percolation" itself is a physical process ("the process of a liquid, gas, etc. moving gradually through a surface that has very small holes or spaces in it") that could have been visualized directly.