Random walks, spectral radii, and Ramanujan graphs

被引：0

作者：

Nagnibeda, T ^{[1
]}

机构：

[1] Royal Inst Technol, Dept Math, S-10044 Stockholm, Sweden

来源：

RANDOM WALKS AND GEOMETRY | 2004年

关键词：

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We investigate properties of random walks on trees with finitely many cone types and apply our results to get estimates on spectral radii of groups and to check whether a given finite graph is Ramanujan.

引用

页码：487 / 500

页数：14

共 50 条

[1] An estimate from above of spectral radii of random walks on surface groups
Nagnibeda T.
Journal of Mathematical Sciences, 1999, 96 (5) : 3542 - 3549
[2] Random walks on Ramanujan complexes and digraphs
Lubetzky, E.
Lubotzky, A.
Parzanchevski, O.
JOURNAL OF THE EUROPEAN MATHEMATICAL SOCIETY, 2020, 22 (11) : 3441 - 3466
[3] Random Walks on Random Graphs
Cooper, Colin
Frieze, Alan
NANO-NET, 2009, 3 : 95 - +
[4] Diameter of Ramanujan Graphs and Random Cayley Graphs
Sardari, Naser T.
COMBINATORICA, 2019, 39 (02) : 427 - 446
[5] Diameter of Ramanujan Graphs and Random Cayley Graphs
Naser T. Sardari
Combinatorica, 2019, 39 : 427 - 446
[6] On the Aα-Spectral Radii of Cactus Graphs
Wang, Chunxiang
Wang, Shaohui
Liu, Jia-Bao
Wei, Bing
MATHEMATICS, 2020, 8 (06)
[7] On the trace of random walks on random graphs
Frieze, Alan
Krivelevich, Michael
Michaeli, Peleg
Peled, Ron
PROCEEDINGS OF THE LONDON MATHEMATICAL SOCIETY, 2018, 116 : 847 - 877
[8] Biased random walks on random graphs
Ben Arous, Gerard
Fribergh, Alexander
PROBABILITY AND STATISTICAL PHYSICS IN ST. PETERSBURG, 2016, 91 : 99 - 153
[9] Learning Representations using Spectral-Biased Random Walks on Graphs
Sharma, Charu
Chauhan, Jatin
Kaul, Manohar
2020 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS (IJCNN), 2020,
[10] Random walks on random simple graphs
Hildebrand, M
RANDOM STRUCTURES & ALGORITHMS, 1996, 8 (04) : 301 - 318

← 1 2 3 4 5 →