8 problems

Let $r_\text{conv}(s)$ denote the convergence rate as a function of the packet size $s$, and let $r_\text{conv}(r_\text{drop})$ denote the convergence rate as a function of the pac…

Let $G$) be a strongly connected graph, let $\scr N_i$ denote the neighbors of node $i$, let $d_i$ be its degree, and let $C_{ji}$ be such that $C_{ji}C'_{ji}$ is invertible. Defin…

Let $\mathcal{L}$ be the graph Laplacian, let $S=\operatorname{diag}(s)$ with $s_i=\sum_{j\in\mathcal{N}_i\cup\{i\}}\mathcal{L}_{ij}^2$, and let $n$ be the number of nodes. Write…

Min-Sum torus mixing-time conjecture. The mixing time is conjectured to be $\Theta(D^{2(d-1)/d})$. The cited work does not provide bounds for the resulting convergence time; for ot…

Adaptive disagreement conjecture. An adaptive algorithm that guarantees that the disagreement at each iteration is not too large should be sufficient to obtain scaling results comp…

The discussion concerns the convergence results for the Riemannian consensus algorithm on manifolds with bounded, constant curvature, including the use of geodesic convex hulls and…

Let the compensating rule use deterministic quantizers and let the update matrix be … where $\varepsilon$ is a rational number in $(0,1/2]$. Symbolic convergence conjecture. Coroll…

Polynomial filtering uses a Vandermonde matrix whose entries involve powers of the original eigenvalues, and the optimal filter weights are obtained using its pseudoinverse. Ill-co…