zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Consensus in networks of multiagents with switching topologies modeled as adapted stochastic processes. (English) Zbl 1222.93232
The paper deals with the consensus problem in networks of multiagents with stochastic switching topologies. The switch of graph topology is modeled here as an adapted stochastic process. The authors introduce the concept of p -consensus in both discrete and continuous time. In the particular case when p=2, one arrives to the usual mean square consensus. By employing the Hajmal inequality from the theory of products of SIA matrices, sufficient conditions for p -consensus in both discrete and continuous time switching networks are derived. This conditions are provided in terms of conditional expectations of the underlying graph topology. A comparison with previous results is given, showing that some of these results could be derived from this approach. It is also shown that the conditions for p -consensus are also sufficient for almost sure consensus. As applications, there are given some corollaries concerning stochastic processes other than i.i.d. process and Markov processes.
93E15Stochastic stability
34F05ODE with randomness