RANDOM WALKS, CONDUCTANCE, AND RESISTANCE FOR THE CONNECTION GRAPH LAPLACIAN

被引：0

作者：

Cloninger, Alexander ^{[1
,2
]}

Mishne, Gal ^{[2
]}

Oslandsbotn, Andreas ^{[3
]}

Robertson, Sawyer J. ^{[1
,2
]}

Wan, Zhengchao ^{[2
]}

Wang, Yusu ^{[2
]}

机构：

[1] Department of Mathematics, University of California San Diego, La Jolla, CA,92093, United States

[2] Halıcıoğlu Data Science Institute, University of California San Diego, La Jolla, CA,92093, United States

[3] Department of Informatics, University of Oslo, Oslo, Norway

来源：

SIAM Journal on Matrix Analysis and Applications | 2024年 / 45卷 / 03期

关键词：

Laplace transforms;

D O I：

10.1137/23M1595400

中图分类号：

学科分类号：

摘要：

We investigate the concept of effective resistance in connection graphs, expanding its traditional application from undirected graphs. We propose a robust definition of effective resistance in connection graphs by focusing on the duality of Dirichlet-type and Poisson-type problems on connection graphs. Additionally, we delve into random walks, taking into account both node transitions and vector rotations. This approach introduces novel concepts of effective conductance and resistance matrices for connection graphs, capturing mean rotation matrices corresponding to random walk transitions. Thereby, it provides new theoretical insights for network analysis and optimization. © 2024 Society for Industrial and Applied Mathematics.

引用

页码：1541 / 1572

共 50 条

[1] Graph connection Laplacian and random matrices with random blocks (sic)
El Karoui, Noureddine
Wu, Hau-Tieng
INFORMATION AND INFERENCE-A JOURNAL OF THE IMA, 2015, 4 (01) : 1 - 42
[2] Morphology of Laplacian random walks
Bakke, J. O. H.
Ray, P.
Hansen, A.
EPL, 2010, 92 (03)
[3] RANDOM WALKS ON THE RANDOM GRAPH
Berestycki, Nathanael
Lubetzky, Eyal
Peres, Yuval
Sly, Allan
ANNALS OF PROBABILITY, 2018, 46 (01): : 456 - 490
[4] Random walks on the click graph
Microsoft Research Cambridge, 7 JJ Thomson Ave, Cambridge, United Kingdom
Proceedings of the 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR'07, 2007, : 239 - 246
[5] Restricted random walks on a graph
F. Y. Wu
H. Kunz
Annals of Combinatorics, 1999, 3 (2-4) : 475 - 481
[6] Blocking conductance and mixing in random walks
Kannan, R.
Lovasz, L.
Montenegro, R.
COMBINATORICS PROBABILITY & COMPUTING, 2006, 15 (04): : 541 - 570
[7] A CHEEGER INEQUALITY FOR THE GRAPH CONNECTION LAPLACIAN
Bandeira, Afonso S.
Singer, Amit
Spielman, Daniel A.
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 2013, 34 (04) : 1611 - 1630
[8] Random walks and chemical graph theory
Klein, DJ
Palacios, JL
Randic, M
Trinajstic, N
JOURNAL OF CHEMICAL INFORMATION AND COMPUTER SCIENCES, 2004, 44 (05): : 1521 - 1525
[9] Reweighted Random Walks for Graph Matching
Cho, Minsu
Lee, Jungmin
Lee, Kyoung Mu
COMPUTER VISION-ECCV 2010, PT V, 2010, 6315 : 492 - 505
[10] A property of random walks on a cycle graph
Ikeda, Yuki
Fukai, Yasunari
Mizoguchi, Yoshihiro
PACIFIC JOURNAL OF MATHEMATICS FOR INDUSTRY, 2015, 7

← 1 2 3 4 5 →