ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1112.1336
  4. Cited By
Consensus over Random Graph Processes: Network Borel-Cantelli Lemmas for
  Almost Sure Convergence
v1v2v3v4v5 (latest)

Consensus over Random Graph Processes: Network Borel-Cantelli Lemmas for Almost Sure Convergence

IEEE Transactions on Information Theory (IEEE Trans. Inf. Theory), 2011
6 December 2011
Guodong Shi
Brian D. O. Anderson
Karl H. Johansson
ArXiv (abs)PDFHTML

Papers citing "Consensus over Random Graph Processes: Network Borel-Cantelli Lemmas for Almost Sure Convergence"

5 / 5 papers shown
Differentially Private Distributed Computation via Public-Private
  Communication Networks
Differentially Private Distributed Computation via Public-Private Communication Networks
Lei Wang
Yang Liu
I. Manchester
Guodong Shi
FedML
110
3
0
05 Jan 2021
Distributed Linear Equations over Random Networks
Distributed Linear Equations over Random Networks
Peng Yi
Jinlong Lei
Yiguang Hong
Jie-bin Chen
Guodong Shi
156
8
0
22 Aug 2020
Dynamical Privacy in Distributed Computing -- Part II: PPSC Gossip
  Algorithms
Dynamical Privacy in Distributed Computing -- Part II: PPSC Gossip Algorithms
Yang Liu
Junfeng Wu
I. Manchester
Guodong Shi
156
2
0
01 Aug 2018
Clique Gossiping
Clique GossipingIEEE/ACM Transactions on Networking (TON), 2017
Yang Liu
Bo Li
Brian D. O. Anderson
Guodong Shi
105
10
0
08 Jun 2017
Finite-time Convergent Gossiping
Finite-time Convergent GossipingIEEE/ACM Transactions on Networking (TON), 2012
Guodong Shi
Bo Li
M. Johansson
Karl H. Johansson
416
41
0
05 Jun 2012
1