✦ LIBER ✦

Towards Consensus: Some Convergence Theorems on Repeated Averaging

✍ Scribed by S. Chatterjee and E. Seneta

Book ID: 118148160
Publisher: Applied Probability Trust
Year: 1977
Tongue: English
Weight: 692 KB
Volume: 14
Category: Article
ISSN: 0021-9002
DOI: 10.2307/3213262

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some convergence theorems on a supercrit

Some convergence theorems on a supercritical Galton-Watson process

✍ P. Koteeswaran; K. Nanthi; K. Suresh Chandra 📂 Article 📅 1985 🏛 Springer Japan 🌐 English ⚖ 235 KB

Some theorems on semicontinuity and conv

Some theorems on semicontinuity and convergence with A functional

✍ V. M. Gol'dshtein 📂 Article 📅 1971 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 788 KB

New theorems on global convergence of so

New theorems on global convergence of some dynamical systems

✍ Tianping Chen; Shun ichi Amari 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 94 KB

Some Erdös-Feldheim type theorems on mea

Some Erdös-Feldheim type theorems on mean convergence of Lagrange interpolation

✍ A.K. Varma; P. Vértesi 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 397 KB

A theorem on random polynomials and some

A theorem on random polynomials and some consequences in average complexity

✍ F. Cucker; M.-F. Roy 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 324 KB

Real polynomials have very often very few real roots, and when algorithms depend on the number of real roots of polynomials rather than on their degrees, this fact has consequences on average complexity of algorithms. In this paper we recall some classical results on the average number of real root

Dirichlet's problem on Green lines and s

Dirichlet's problem on Green lines and some convergence theorems for Denjoy's domains

✍ J. Salazar 📂 Article 📅 1993 🏛 Springer-Verlag 🌐 French ⚖ 365 KB