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 条

[41] Geometric Random Graphs vs Inhomogeneous Random Graphs
Napolitano, George M.
Turova, Tatyana
MARKOV PROCESSES AND RELATED FIELDS, 2019, 25 (04) : 615 - 637
[42] Analysis of an iterated local search algorithm for vertex cover in sparse random graphs
Witt, Carsten
THEORETICAL COMPUTER SCIENCE, 2012, 425 : 117 - 125
[43] Greedy Local Search and Vertex Cover in Sparse Random Graphs (Extended Abstract)
Witt, Carsten
THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, 2009, 5532 : 410 - 419
[44] Average-case complexity of backtrack search for coloring sparse random graphs
Mann, Zoltan Adam
Szajko, Aniko
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2013, 79 (08) : 1287 - 1301
[45] Steps towards Decentralized Deterministic Network Coding
Graur, Oana
Henkel, Werner
2014 2ND INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE, MODELLING AND SIMULATION, 2014, : 63 - 68
[46] Precoding for Decentralized Detection of Unknown Deterministic Signals
Fang, Jun
Li, Xiaoying
Li, Hongbin
Huang, Lei
IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS, 2014, 50 (03) : 2116 - 2128
[47] RANDOM GRAPHS WITH A RANDOM BIJECTION
Anbo, Yuki
TSUKUBA JOURNAL OF MATHEMATICS, 2011, 35 (01) : 143 - 151
[48] Random cutting and records in deterministic and random trees
Janson, Svante
RANDOM STRUCTURES & ALGORITHMS, 2006, 29 (02) : 139 - 179
[49] RANDOM TREES IN RANDOM GRAPHS
BENDER, EA
WORMALD, NC
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 1988, 103 (01) : 314 - 320
[50] RANDOM GRAPHS
GILBERT, EN
ANNALS OF MATHEMATICAL STATISTICS, 1959, 30 (04): : 1141 - 1144

← 1 2 3 4 5 →