Distributed algorithms with dynamical random transitions

DOI10.1002/RSA.10060MaRDI QIDQ4798174zbMATH OpenOpenAlexFDO

Authors R. Schott, Nadine Guillotin-Plantard

Publication date 19 March 2003

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/rsa.10060

zbMATH Keywords

dynamical systemsresource sharingdynamical random walksbanker algorithm

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 125893
• Large deviations analysis for distributed algorithms in an ergodic Markovian environment
• Distributed algorithms in an ergodic Markovian environment
• Probabilistic analysis of some distributed algorithms
• Some distributed algorithms revisited

Cited in

(9)

• Dynamic random walks on Heisenberg groups
• Data structures with dynamical random transitions
• Efficient distributed random walks with applications
• scientific article; zbMATH DE number 1305416 (Why is no real title available?)
• Hitting time of a corner for a reflected diffusion in the square
• Analysis of distributed systems via quasi-stationary distributions
• Large deviations analysis for distributed algorithms in an ergodic Markovian environment
• Random walks, heat equation and distributed algorithms
• Escape of resources in a distributed clustering process

This page was built for publication: Distributed algorithms with dynamical random transitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4798174)