Randomized DDA average-consensus conjecture under condition (C)

About 15 years old · traced to

Let C[0,t1]C_{[0,t_1]} be a communication sequence, and let the SVCC\mathrm{S\mathcal{V}CC} condition be defined by condition (C) of the cited theorem. Upon reception of each signal, choose the normal consensus-estimate update with probability p∈(0,1)p\in(0,1) and the alternative update with probability 1−p1-p. Randomized DDA conjecture. Under these assumptions, average-consensus holds at time t=t1(+)t=t_1(+) almost surely for every communication sequence C[0,t1]C_{[0,t_1]} satisfying the IVCC\mathrm{I\mathcal{V}CC} condition. The conjecture proposes that random switching between the two global updates restores finite-time average consensus under the broader condition (C); the supplied text gives no resolution.

References

Primary source

Kevin Topley and Vikram Krishnamurthy, “Average-Consensus Algorithms in a Deterministic Framework”, arXiv:1106.4346 (2011).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.