Hitting and commute times in large graphs are often misleading
From MaRDI portal
Publication:2934050
zbMath1319.05118arXiv1003.1266MaRDI QIDQ2934050
Matthias Hein, Agnes Radl, Ulrike von Luxburg
Publication date: 8 December 2014
Full work available at URL: https://arxiv.org/abs/1003.1266
Random graphs (graph-theoretic aspects) (05C80) Learning and adaptive systems in artificial intelligence (68T05) Combinatorial probability (60C05) Random walks on graphs (05C81)
Related Items
Graph regularized nonnegative matrix factorization for temporal link prediction in dynamic networks, Variance and Covariance of Distributions on Graphs, Resistance distance distribution in large sparse random graphs, On the Interplay Between Strong Regularity and Graph Densification, A bag-of-paths framework for network data analysis, Random walk hitting times and effective resistance in sparsely connected Erdős‐Rényi random graphs, Signed network representation with novel node proximity evaluation, Unnamed Item, Entropic Optimal Transport on Random Graphs, An algorithm of the prey and predator struggle to survive as a random walk simulation case study, Hitting times for random walks on tricyclic graphs, Population dynamics and statistical physics in synergy. Abstracts from the workshop held March 6--12, 2022, Hitting times for random walks on subdivision and triangulation graphs, Lower bounds for in-network computation of arbitrary functions, How does geographical distance translate into genetic distance?, Graph Similarity through Entropic Manifold Alignment, Sparse randomized shortest paths routing with Tsallis divergence regularization, Diffusion State Distances: Multitemporal Analysis, Fast Algorithms, and Applications to Biological Networks, A Metric on Directed Graphs and Markov Chains Based on Hitting Probabilities, Covariance-Based Sample Selection for Heterogeneous Data: Applications to Gene Expression and Autism Risk Gene Detection, Resistance distances in Cayley graphs on symmetric groups
