Name
Abstract | ||
|---|---|---|
The mixing time of random walks on a graph has found broad applications across both theoretical and practical aspects of computer science, with the application effects depending on the behavior of mixing time. It is extensively believed that real-world networks, especially social networks, are fast mixing with their mixing time at most $O(\log N)$ where $N$ is the number of vertices. However, the ... |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1093/comjnl/bxaa150 | The Computer Journal |
Keywords | DocType | Volume |
random walk,mixing time,normalized Laplacian,social networks,fast mixing | Journal | 64 |
Issue | ISSN | Citations |
1 | 0010-4620 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yi Qi | 1 | 8 | 2.14 |
| Wanyue Xu | 2 | 1 | 3.07 |
| Liwang Zhu | 3 | 0 | 0.34 |
| Zhongzhi Zhang | 4 | 85 | 22.02 |