Deterministic Decentralized Search in Random Graphs

被引：0

作者：

Arcaute, Esteban ^{[1
]}

Chen, Ning ^{[2
]}

Kumar, Ravi ^{[3
]}

Liben-Nowell, David ^{[4
]}

Mahdian, Mohammad ^{[3
]}

Nazerzadeh, Hamid ^{[5
]}

Xu, Ying ^{[6
]}

机构：

[1] Stanford Univ, Inst Computat & Math Engn, Durand Bldg 496 Lomita Mall, Stanford, CA 94305 USA

[2] Nanyang Technol Univ, Div Math Sci, Singapore 637371, Singapore

[3] Yahoo Res, Sunnyvale, CA 94089 USA

[4] Carleton Coll, Dept Comp Sci, Northfield, MN 55057 USA

[5] Stanford Univ, Terman Engn Ctr, Dept Management Sci & Engn, Stanford, CA 94305 USA

[6] Stanford Univ, Dept Comp Sci, Stanford, CA 94305 USA

来源：

INTERNET MATHEMATICS | 2008年 / 5卷 / 1-2期

关键词：

D O I：

10.1080/15427951.2008.10129298

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We study a general framework for decentralized search in random graphs. Our main focus is on deterministic memoryless search algorithms that use only local information to reach their destination in a bounded number of steps in expectation. This class includes (with small modifications) the search algorithms used in Kleinberg's pioneering work on long-range percolation graphs and hierarchical network models. We give a characterization of searchable graphs in this model, and use this characterization to prove a monotonicity property for searchability.

引用

页码：141 / 154

页数：14

共 50 条

[1] Deterministic decentralized search in random graphs
Arcaute, Esteban
Chen, Ning
Kumar, Ravi
Liben-Nowell, David
Mahdian, Mohammad
Nazerzadeh, Hamid
Xu, Ying
ALGORITHMS AND MODELS FOR THE WEB-GRAPH, 2007, 4863 : 187 - +
[2] Deterministic and Probabilistic Binary Search in Graphs
Emamjomeh-Zadeh, Ehsan
Kempe, David
Singhal, Vikrant
STOC'16: PROCEEDINGS OF THE 48TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2016, : 519 - 532
[3] Deterministic random walks on finite graphs
Kijima, Shuji
Koga, Kentaro
Makino, Kazuhisa
RANDOM STRUCTURES & ALGORITHMS, 2015, 46 (04) : 739 - 761
[4] Guiding random particles by deterministic search
Sullivan, J
Rittscher, J
EIGHTH IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION, VOL I, PROCEEDINGS, 2001, : 323 - 330
[5] Random walks pertaining to a class of deterministic weighted graphs
Huillet, Thierry
JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL, 2009, 42 (27)
[6] Deterministic walks in random networks:: an application to thesaurus graphs
Kinouchi, O
Martinez, AS
Lima, GF
Lourenço, GM
Risau-Gusman, S
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2002, 315 (3-4) : 665 - 676
[7] Deterministic Search on Star Graphs via Quantum Walks
Qu, Dengke
Marsh, Samuel
Wang, Kunkun
Xiao, Lei
Wang, Jingbo
Xue, Peng
PHYSICAL REVIEW LETTERS, 2022, 128 (05)
[8] Random Walk Gradient Descent for Decentralized Learning on Graphs
Ayache, Ghadir
El Rouayheb, Salim
2019 IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS (IPDPSW), 2019, : 926 - 931
[9] Quickest Search for Local Structures in Random Graphs
Heydari, Javad
Tajer, Ali
IEEE TRANSACTIONS ON SIGNAL AND INFORMATION PROCESSING OVER NETWORKS, 2017, 3 (03): : 526 - 538
[10] An almost-greedy search on random binary vectors and random graphs
Dor, A
Greenshtein, E
JOURNAL OF ALGORITHMS, 2001, 40 (01) : 102 - 133

← 1 2 3 4 5 →