8 problems

Conjecture on agreement-reachable graphs. The class of agreement-reachable graphs on arbitrary weights is much larger in practice than the class supplied by the identified sufficie…

Consider the distributed consensus protocol in which the relative velocity magnitude of every agent is … Here $b$ is the decay exponent, and consensus means that the agents' states…

Let $\rho_1(t)$ denote the fastest convergence rate for the best topologies, and let $n$, $a_{\max}$, and $v$ be the parameters appearing in the protocol and assumptions. Asymptoti…

Let $\mathcal{A}_{\rm ave}^\ast$ be the class of distributed averaging algorithms considered in the paper, with time-varying parameters $\{\alpha_k\}$, operating under nearest-neig…

Let $r$ be a positive integer, let $C_{[0,t_1]}$ be a communication sequence, and let the $\mathrm{I\mathcal{V}SC}$ condition be the condition specified by the source. Let ARIS den…

Let $C_{[0,t_1]}$ be a communication sequence satisfying the $\mathrm{S\mathcal{V}SC}$ condition. Let the RIS algorithm be the algorithm proposed by Shah and Hassibi (2008), let th…

Let $C_{[0,t_1]}$ be a communication sequence, and let the $\mathrm{S\mathcal{V}CC}$ condition be defined by condition (C) of the cited theorem. Upon reception of each signal, choo…

Let $\mathcal{A}$ be a distributed algorithm, let $C_{[0,t_1]}$ be a communication sequence, and let $\mathrm{S\mathcal{V}SC}$ denote the relevant sufficient vertex-strongly-connec…