Boolean Gossip Networks.

IEEE/ACM Transactions on Networking(2018)

引用 6|浏览42
暂无评分
摘要
This paper proposes and investigates a Boolean gossip model as a simplified but non-trivial probabilistic Boolean network. With positive node interactions, in view of standard theories from Markov chains, we prove that the node states asymptotically converge to an agreement at a binary random variable, whose distribution is characterized for large-scale networks by mean-field approximation. Using ...
更多
查看译文
关键词
Peer-to-peer computing,Markov processes,Boolean functions,Probabilistic logic,Computational modeling,IEEE transactions
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要