The electrical resistance of a graph captures its commute and cover times
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Graph embeddings, symmetric real matrices, and generalized inverses
Graph embeddings, symmetric real matrices, and generalized inverses
The link prediction problem for social networks
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
A kernel view of the dimensionality reduction of manifolds
ICML '04 Proceedings of the twenty-first international conference on Machine learning
Graph sparsification by effective resistances
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Fast incremental proximity search in large graphs
Proceedings of the 25th international conference on Machine learning
The cover time of random geometric graphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Reconstruction of graphs based on random walks
Theoretical Computer Science
Commute times and the effective resistances of random trees
Probability in the Engineering and Informational Sciences
Graph embedding using commute time
SSPR'06/SPR'06 Proceedings of the 2006 joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
| Hi-index | 0.04 |
In this paper we provide exact formula for the commute times of random walks on spherically symmetric random trees. Using this formula we sharpen some of the results presented in Al-Awadhi et al. to the form of equalities rather than inequalities.