Descripción
|
|
---|---|
We propose distributed algorithms for sampling networks based on a new class of random walks that we call Centrifugal Random Walks (CRW). A CRW is a random walk that starts at a source and always moves away from it. We propose CRW algorithms for connected networks with arbitrary probability distributions, and for grids and networks with regular concentric connectivity with distance based distributions. All CRW sampling algorithms select a node with the exact probability distribution, do not need warm-up, and end in a number of hops bounded by the network diameter. | |
Internacional
|
Si |
Nombre congreso
|
Distributed Computing - 26th International Symposium, DISC 2012 |
Tipo de participación
|
960 |
Lugar del congreso
|
Salvador, Brasil |
Revisores
|
Si |
ISBN o ISSN
|
978-3-642-33650-8 |
DOI
|
10.1007/978-3-642-33651-5_37 |
Fecha inicio congreso
|
16/10/2012 |
Fecha fin congreso
|
18/10/2012 |
Desde la página
|
419 |
Hasta la página
|
420 |
Título de las actas
|
Distributed Computing - 26th International Symposium, DISC 2012, Lecture Notes in Computer Science Volume 7611, 2012 |