Reachability and expectation in gossiping

DOI10.1007/978-3-319-69131-2_6zbMath1498.68344OpenAlexW2763510479MaRDI QIDQ2092493

Anders Stockmarr, Ioannis Kokkinis, Hans P. van Ditmarsch

Publication date: 2 November 2022

Full work available at URL: https://doi.org/10.1007/978-3-319-69131-2_6

zbMATH Keywords

reachabilitynetworksMarkov chainexpectationgossip

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Network protocols (68M12) Agent technology and artificial intelligence (68T42)

Related Items

Propositional gossip protocols ⋮ Everyone knows that everyone knows ⋮ Dynamic gossip ⋮ Sharp Thresholds in Random Simple Temporal Graphs ⋮ Minimal number of calls in propositional protocols ⋮ The logic of gossiping ⋮ Unnamed Item