4 problems

Regular-graph extension conjecture. The bound given in Theorem remains valid in the simple symmetric case, for example for regular graphs without transitivity.

In the scalable compressed gossip setting, let $gamma$ denote the algorithm's step-size parameter, let $omega$ denote its compression parameter, and let the convergence rate refer…

Degree-to-node scaling conjecture. Based on simulations, the mean square error of the BGA is proportional to the ratio between the degree and the number of nodes,

Upper-bound conjecture. Random-walk mobility models with slower mixing times should yield smaller benefits, and the independent, fast-mixing model should always provide an upper bo…