Hitting and commute times in large graphs are often misleading
暂无分享,去创建一个
[1] AURÉLIE COULON,et al. Statistical methods in spatial genetics , 2009, Molecular ecology.
[2] Purnamrita Sarkar,et al. Fast incremental proximity search in large graphs , 2008, ICML '08.
[3] Kunal Roy,et al. Topological descriptors in drug design and modeling studies , 2004, Molecular Diversity.
[4] C. Zenger. A comparison of some bounds for the nontrivial eigenvalues of stochastic matrices , 1972 .
[5] Matthew Brand,et al. A Random Walks Perspective on Maximizing Satisfaction and Profit , 2005, SDM.
[6] Peter G. Doyle,et al. Random Walks and Electric Networks: REFERENCES , 1987 .
[7] Ulrike von Luxburg,et al. Graph Laplacians and their Convergence on Random Neighborhood Graphs , 2006, J. Mach. Learn. Res..
[8] Chen Avin,et al. On the cover time and mixing time of random geometric graphs , 2007, Theor. Comput. Sci..
[9] Fan Chung,et al. Spectral Graph Theory , 1996 .
[10] Itai Benjamini,et al. Submean Variance Bound for Effective Resistance of Random Electric Networks , 2006 .
[11] Edwin R. Hancock,et al. Graph Embedding Using Commute Time , 2006, SSPR/SPR.
[12] J. Cserti. Application of the lattice Green's function for calculating the resistance of an infinite network of resistors , 1999, cond-mat/9909120.
[13] Claudio Gentile,et al. Fast and Optimal Prediction on a Labeled Tree , 2009, COLT.
[14] Luh Yen,et al. A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances , 2008, KDD.
[15] Edwin R. Hancock,et al. Image Segmentation using Commute Times , 2005, BMVC.
[16] Yehuda Koren,et al. Measuring and extracting proximity in networks , 2006, KDD '06.
[17] Alan M. Frieze,et al. The cover time of sparse random graphs. , 2003, SODA '03.
[18] F. Chung,et al. Complex Graphs and Networks , 2006 .
[19] Jon M. Kleinberg,et al. The link-prediction problem for social networks , 2007, J. Assoc. Inf. Sci. Technol..
[20] U. V. Luxburg,et al. Getting lost in space: large sample analysis of the commute distance , 2010, NIPS 2010.
[21] M. Randic,et al. Resistance distance , 1993 .
[22] Marco Saerens,et al. A novel way of computing similarities between nodes of a graph, with application to collaborative filtering and subspace projection of the graph nodes , 2006 .
[23] Chen Avin,et al. On the Cover Time of Random Geometric Graphs , 2005, ICALP.
[24] François Fouss,et al. The Principal Components Analysis of a Graph, and Its Relationships to Spectral Clustering , 2004, ECML.
[25] Richard J. Lipton,et al. Random walks, universal traversal sequences, and the complexity of maze problems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).
[26] AudibertJean-Yves,et al. Graph Laplacians and their Convergence on Random Neighborhood Graphs , 2007 .
[27] Bernhard Schölkopf,et al. Learning from Labeled and Unlabeled Data Using Random Walks , 2004, DAGM-Symposium.
[28] Béla Bollobás,et al. Modern Graph Theory , 2002, Graduate Texts in Mathematics.
[29] Leslie G. Valiant,et al. Fast probabilistic algorithms for hamiltonian circuits and matchings , 1977, STOC '77.
[30] P. Diaconis,et al. Geometric Bounds for Eigenvalues of Markov Chains , 1991 .
[31] Stephen Guattery. Graph embeddings, symmetric real matrices, and generalized inverses , 1998 .
[32] Fabian J. Theis,et al. Author's Personal Copy Theoretical Computer Science Reconstruction of Graphs Based on Random Walks , 2022 .
[33] Purnamrita Sarkar,et al. A Tractable Approach to Finding Closest Truncated-commute-time Neighbors in Large Graphs , 2007, UAI.
[34] Fan Chung Graham,et al. Local Graph Partitioning using PageRank Vectors , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[35] P. Diaconis,et al. COMPARISON THEOREMS FOR REVERSIBLE MARKOV CHAINS , 1993 .
[36] Alan M. Frieze,et al. The Cover Time of Random Regular Graphs , 2005, SIAM J. Discret. Math..
[37] László Lovász,et al. Random Walks on Graphs: A Survey , 1993 .
[38] F. Y. Wu. Theory of resistor networks: the two-point resistance , 2004 .
[39] Mark Herbster,et al. Prediction on a Graph with a Perceptron , 2006, NIPS.
[40] Bernhard Schölkopf,et al. A kernel view of the dimensionality reduction of manifolds , 2004, ICML.
[41] Alan M. Frieze,et al. The cover time of the preferential attachment graph , 2007, J. Comb. Theory, Ser. B.
[42] Prabhakar Raghavan,et al. The electrical resistance of a graph captures its commute and cover times , 2005, computational complexity.
[43] L. Asz. Random Walks on Graphs: a Survey , 2022 .
[44] I. Gutman,et al. Resistance distance and Laplacian spectrum , 2003 .
[45] Fan Chung Graham,et al. On the Spectra of General Random Graphs , 2011, Electron. J. Comb..
[46] M. Penrose. A Strong Law for the Longest Edge of the Minimal Spanning Tree , 1999 .
[47] Alistair Sinclair,et al. Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow , 1992, Combinatorics, Probability and Computing.
[48] Patrick W. Fowler. Resistance distances in fullerene graphs , 2002 .
[49] Stephen P. Boyd,et al. Mixing Times for Random Walks on Geometric Random Graphs , 2005, ALENEX/ANALCO.
[50] Edwin R. Hancock,et al. Robust Multi-body Motion Tracking Using Commute Time Clustering , 2006, ECCV.
[51] E. Seneta. Non-negative Matrices and Markov Chains , 2008 .
[52] Nikhil Srivastava,et al. Graph sparsification by effective resistances , 2008, SIAM J. Comput..