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 条

[31] Deterministic Path Search Algorithm on Free-Energy Landscape Using Random Grids
Nagai, Tetsuro
Yoshida, Koji
JOURNAL OF THE PHYSICAL SOCIETY OF JAPAN, 2024, 93 (08)
[32] Deterministic Random Walks
Cooper, Joshua
Doerr, Benjamin
Spencer, Joel
Tardos, Garbor
PROCEEDINGS OF THE EIGHTH WORKSHOP ON ALGORITHM ENGINEERING AND EXPERIMENTS AND THE THIRD WORKSHOP ON ANALYTIC ALGORITHMICS AND COMBINATORICS, 2006, : 185 - +
[33] RANDOM TO DETERMINISTIC TRANSFORM
METWALLI, SM
MAYNE, RW
JOURNAL OF SOUND AND VIBRATION, 1981, 79 (02) : 197 - 204
[34] Random and deterministic jitter
Johnson, H
EDN, 2002, 47 (14) : 24 - 24
[35] Random Deterministic Automata
Nicaud, Cyril
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2014, PT I, 2014, 8634 : 5 - 23
[36] Asynchronous deterministic rendezvous in graphs
De Marco, G
Gargano, L
Kranakis, E
Krizanc, D
Pelc, A
Vaccaro, U
THEORETICAL COMPUTER SCIENCE, 2006, 355 (03) : 315 - 326
[37] Deterministic Rendezvous in Restricted Graphs
Farrugia, Ashley
Gasieniec, Leszek
Kuszner, Lukasz
Pacheco, Eduardo
SOFSEM 2015: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2015, 8939 : 189 - 200
[38] Decentralized cooperative search
Howard, M
ICAI '05: PROCEEDINGS OF THE 2005 INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOLS 1 AND 2, 2005, : 548 - 554
[39] Asynchronous deterministic rendezvous in graphs
De Marco, G
Gargano, L
Kranakis, E
Krizanc, D
Pelc, A
Vaccaro, U
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2005, PROCEEDINGS, 2005, 3618 : 271 - 282
[40] Decentralized Semantic Threat Graphs
Foley, Simon N.
Fitzgerald, William M.
DATA AND APPLICATIONS SECURITY AND PRIVACY XXVI, 2012, 7371 : 177 - 192

← 1 2 3 4 5 →