Simulated annealing in convex bodies and an O*(n4) volume algorithm
Journal of Computer and System Sciences - Special issue on FOCS 2003
A Local Graph Partitioning Algorithm Using Heat Kernel Pagerank
WAW '09 Proceedings of the 6th International Workshop on Algorithms and Models for the Web-Graph
Supervised self-organization of homogeneous swarms using ergodic projections of Markov chains
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Local partitioning for directed graphs using PageRank
WAW'07 Proceedings of the 5th international conference on Algorithms and models for the web-graph
Approximating the volume of unions and intersections of high-dimensional geometric objects
Computational Geometry: Theory and Applications
Volume computation using a direct monte carlo method
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Accurate and scalable nearest neighbors in large networks based on effective importance
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
| Hi-index | 0.00 |
A. Sinclair and M. Jerrum (1988) derived a bound on the mixing rate of time-reversible Markov chains in terms of their conductance. The authors generalize this result by not assuming time reversibility and using a weaker notion of conductance. They prove an isoperimetric inequality for subsets of a convex body. These results are combined to simplify an algorithm of M. Dyer et al. (1989) for approximating the volume of a convex body and to improve running-time bounds.