Sciweavers

2168 search results - page 1 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
DC
2000
13 years 4 months ago
Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study
ms, to use abstraction mappings to prove probabilistic properties, and to apply random walk theory in a distributed computational setting. We apply all of these techniques to analy...
Anna Pogosyants, Roberto Segala, Nancy A. Lynch
CORR
2008
Springer
127views Education» more  CORR 2008»
13 years 4 months ago
Theory of Rumour Spreading in Complex Social Networks
We introduce a general stochastic model for the spread of rumours, and derive mean-field equations that describe the dynamics of the model on complex social networks (in particula...
Maziar Nekovee, Yamir Moreno, G. Bianconi, M. Mars...
ALT
2008
Springer
14 years 1 months ago
On-Line Probability, Complexity and Randomness
Abstract. Classical probability theory considers probability distributions that assign probabilities to all events (at least in the finite case). However, there are natural situat...
Alexey V. Chernov, Alexander Shen, Nikolai K. Vere...
CORR
2008
Springer
116views Education» more  CORR 2008»
13 years 4 months ago
A statistical mechanical interpretation of algorithmic information theory
Abstract. We develop a statistical mechanical interpretation of algorithmic information theory by introducing the notion of thermodynamic quantities, such as free energy, energy, s...
Kohtaro Tadaki