Related papers: Consensus in non-commutative spaces
In a real Hilbert space $\mathcal{H}$. Given any function $f$ convex differentiable whose solution set $\argmin_{\mathcal{H}}\,f$ is nonempty, by considering the Proximal Algorithm $x_{k+1}=\text{prox}_{\b_k f}(d x_k)$, where $0<d<1$ and…
We study the popular distributed consensus method over networks composed of a number of densely connected clusters with a sparse connection between them. In these cluster networks, the method often constitutes two-time-scale dynamics, where…
We give a characterization of the contraction ratio of bounded linear maps in Banach space with respect to Hopf's oscillation seminorm, which is the infinitesimal distance associated to Hilbert's projective metric, in terms of the extreme…
In this brief paper, a new consensus protocol based on the sign of innovations is proposed. Based on this protocol each agent only requires single-bit of information about its relative state to its neighboring agents. This is significant in…
We analyze the global convergence of the power iterates for the computation of a general mixed-subordinate matrix norm. We prove a new global convergence theorem for a class of entrywise nonnegative matrices that generalizes and improves a…
This paper deals with a method for the approximation of a spectral density function among the solutions of a generalized moment problem a` la Byrnes/Georgiou/Lindquist. The approximation is pursued with respect to the Kullback-Leibler…
We study second order consensus dynamics with random additive disturbances. We investigate three different performance measures: the steady-state variance of pairwise differences between vertex states, the steady-state variance of the…
This paper gives a self-contained introduction to the Hilbert projective metric $\mathcal{H}$ and its fundamental properties, with a particular focus on the space of probability measures. We start by defining the Hilbert pseudo-metric on…
Given a compact metric space $X$ and a probability measure in the $\sigma-$algebra of Borel subsets of $X$, we will establish a dominated convergence theorem for ultralimits of sequences of integrable maps and apply it to deduce a…
We provide a general theorem on the asymptotic behavior of stochastic processes that conform to a relaxed supermartingale condition. The distinguishing feature of our result is that it provides quantitative convergence guarantees at a much…
This article investigates discrete-time matrix-weighted consensus of multi-agent networks over undirected and connected graphs. We first present consensus protocols for the agents in common networks of symmetric matrix weights with possibly…
In this paper, we show a mean convergence theorem for a mapping with an attractive point in a Hilbert space by using a quasinonexpansive extension of the mapping and a mean convergence theorem for a quasinonexpansive mapping.
Optimization techniques are at the core of many scientific and engineering disciplines. The steepest descent methods play a foundational role in this area. In this paper we studied a generalized steepest descent method on Riemannian…
In this paper we establish an estimate for the rate of convergence of the Krasnosel'ski\v{\i}-Mann iteration for computing fixed points of non-expansive maps. Our main result settles the Baillon-Bruck conjecture [3] on the asymptotic…
Let $E$ be a uniformly smooth and uniformly convex real Banach space and $E^*$ be its dual space. Suppose $A : E\rightarrow E^*$ is bounded, strongly monotone and satisfies the range condition such that $A^{-1}(0)\neq \emptyset$. Inspired…
The classical Eagleson's theorem states that if appropriately normalized Birkhoff sums generated by a measurable function and a probability preserving transformation converge in distribution, then they also converge in distribution with…
We provide quantitative information in the form of a rate of metastability in the sense of T. Tao and (under a metric regularity assumption) a rate of convergence for an algorithm approximating zeros of differences of maximally monotone…
To prove that a measure, linearly representable by means of a finite set of nonnegative matrices $\mathcal M$, has the weak-Gibbs property, one check the uniform convergence (on $\mathcal M^\mathbb N$) of the sequence of vectors…
We consider a consensus algorithm in which every node in a sequence of undirected, B-connected graphs assigns equal weight to each of its neighbors. Under the assumption that the degree of each node is fixed (except for times when the node…
The consensus problem -- achieving agreement among a network of agents -- is a central theme in both theory and applications. Recently, this problem has been extended from Euclidean spaces to the space of probability measures, where the…