text:   Approximations",1,"['The Laplacian approach is extremely useful in discrete graphs (e.g. mixing times, min-cuts, etc.).  How can we apply similar ideas to RL, where eigendecomposition is not easy and the graph is only known via sampling?  Find out how in our recent paper: <LINK>']",18,10,256