Name
Abstract | ||
|---|---|---|
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 ... |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/TNET.2017.2763964 | IEEE/ACM Transactions on Networking |
Keywords | DocType | Volume |
Peer-to-peer computing,Markov processes,Boolean functions,Probabilistic logic,Computational modeling,IEEE transactions | Journal | 26 |
Issue | ISSN | Citations |
1 | 1063-6692 | 1 |
PageRank | References | Authors |
0.41 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| bo li | 1 | 4 | 1.93 |
| Junfeng Wu | 2 | 428 | 33.16 |
| hongsheng qi | 3 | 710 | 46.37 |
| A. Proutiére | 4 | 673 | 51.18 |
| guodong shi | 5 | 711 | 54.50 |