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 条

[21] On the Performance of the Depth First Search Algorithm in Supercritical Random Graphs
Diskin, Sahar
Krivelevich, Michael
ELECTRONIC JOURNAL OF COMBINATORICS, 2022, 29 (03):
[22] Deterministic Rendezvous in Graphs
Anders Dessmark
Pierre Fraigniaud
Dariusz R. Kowalski
Andrzej Pelc
Algorithmica, 2006, 46 : 69 - 96
[23] Deterministic rendezvous in graphs
Dessmark, Anders
Fraigniaud, Pierre
Kowalski, Dariusz R.
Pelc, Andrzej
ALGORITHMICA, 2006, 46 (01) : 69 - 96
[24] Deterministic rendezvous in graphs
Dessmark, A
Fraigniaud, P
Pelc, A
ALGORITHMS - ESA 2003, PROCEEDINGS, 2003, 2832 : 184 - 195
[25] Deterministic Soliton Graphs
Bartha, Miklos
Kresz, Miklos
INFORMATICA-JOURNAL OF COMPUTING AND INFORMATICS, 2006, 30 (03): : 281 - 288
[26] A NEW PARTITION-BASED RANDOM SEARCH METHOD FOR DETERMINISTIC OPTIMIZATION PROBLEMS
Lin, Ziwei
Du, Shichang
Matta, Andrea
2019 WINTER SIMULATION CONFERENCE (WSC), 2019, : 3504 - 3515
[27] Decentralized Cooperative Online Estimation With Random Observation Matrices, Communication Graphs and Time Delays
Wang, Jiexiang
Li, Tao
Zhang, Xiwei
IEEE TRANSACTIONS ON INFORMATION THEORY, 2021, 67 (06) : 4035 - 4059
[28] Decentralized Resource Assignment in Cognitive Networks Based on Swarming Mechanisms Over Random Graphs
Di Lorenzo, Paolo
Barbarossa, Sergio
Sayed, Ali H.
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2012, 60 (07) : 3755 - 3769
[29] Bringing Decentralized Search to Decentralized Services
Li, Mingyu
Zhu, Jinhao
Zhang, Tianxu
Tan, Cheng
Xia, Yubin
Angel, Sebastian
Chen, Haibo
PROCEEDINGS OF THE 15TH USENIX SYMPOSIUM ON OPERATING SYSTEMS DESIGN AND IMPLEMENTATION (OSDI '21), 2021, : 331 - 347
[30] On the asymmetry of random regular graphs and random graphs
Kim, JH
Sudakov, B
Vu, VH
RANDOM STRUCTURES & ALGORITHMS, 2002, 21 (3-4) : 216 - 224

← 1 2 3 4 5 →