RATE OF CONVERGENCE OF STOCHASTIC PROCESSES WITH VALUES IN R-TREES AND HADAMARD MANIFOLDS KEI FUNANO

Abstract. Under K.-T. Sturm’s formulation, we obtain a Gaussian upper bound for tail probability of mean value of independent, identically distributed random variables with values in R-trees and Hadamard manifolds.

1. Introduction and statement of the main result The aim of this paper is to study the weak Law of Large numbers for CAT(0)-spacevalued stochastic processes (see Subsection 2.1 for the definition of CAT(0)-spaces). Let N be a CAT(0)-space and (Ω, Σ, P) a probability space. Given a random variable W : Ω → N such that the push-forward measure W∗ P of P by W has the finite moment of order 2, we define its expectation EP (W ) by the barycenter of the measure W∗ P (the definition of the barycenter is in Subsection 2.1). In [8, Theorem 4.7], K.-T. Sturm introduced a natural definition of mean value of n-points y1 , · · · , yn in N , called inductive −→ P yi (see Definition 2.5 for precise definition). For an mean value and denoted by n1 i=1,··· ,n

independent, identically distributed N -valued random variables (Yi )∞ i=1 on the probability space Ω, he obtained the weak Law of Large numbers proving the following inequality Z Z −→ 1 X 2 1 2 (1.1) Yi (ω), EP (Y1 ) dP(ω) ≤ dN dN (Y1 (ω), EP (Y1 )) dP(ω). n n Ω Ω i=1,··· ,n He also proved the strong Law of Large numbers ([8, Theorem 4.7, Proposition 6.6]). Motivated by Sturm’s work, using the results of the theory of L´evy-Milman concentration of 1-Lipschitz maps obtained in [4, 5], we obtain the following Gaussian estimate. Theorem 1.1. Let (Yi )∞ i=1 be a sequence of independent, identically distributed random variables on a probability space (Ω, Σ, P) with values in an R-tree T . We assume that the support of the measure (Y1 )∗ P has bounded diameter D. Then, for any r > 0, we have −→ n 1 X  o nr 2 4 P ω ∈ Ω | dT Yi (ω), EP (Y1 ) ≥ r ≤ 4e 75 e− 150D2 . n i=1,··· ,n Date: May 27, 2009. 2000 Mathematics Subject Classification. 53C21, 53C23. Key words and phrases. R-tree, measure concentration, Hadamard manifold, weak law of large numbers. 1

2

KEI FUNANO

See Subsection 2.1 for definition of R-trees. In the case where N is an Hadamard manifold, we also obtain the following. For any m ∈ N, we put √ (m+1)/(4m−2) π2 o n √ πe e 1/(2m) em := e1/(4m) {1 + πe(m+1)/(4m−2) }. Am := e 1+ and A 2 em are bounded from above by universal constant C > 0. Note that both Am and A Theorem 1.2. Let (Yi )∞ i=1 be a sequence of independent, identically distributed random variables on a probability space (Ω, Σ, P) with values in an m-dimensional Hadamard manifold N . We assume that the support of the measure (Y1 )∗ P has bounded diameter D. Then, for any r > 0, we have −→ n 1 X  o nr 2 nr 2 em e− 32D 2m P ω ∈ Ω | dN } Yi (ω), EP (Y1 ) ≥ r ≤ min{Am e− 16D2 m , A n i=1,··· ,n

There are many other way to define a mean value of points in a CAT(0)-space (see Remark 2.6). For example, in [2], A. Es-Sahib and H. Heinich introduced an another notion of mean value and expectation. They obtained the strong Law of Large numbers under their definition. In this paper, we treat only Sturm’s formulation. Acknowledgements. The author would like to thank to Professors Kazuhiro Kuwae and Daehong Kim for motivating this work. This work was partially supported by Research Fellowships of the Japan Society for the Promotion of Science for Young Scientists. 2. Preliminaries 2.1. Basics of CAT(0)-spaces. In this subsection we explain several terminologies in geometry of CAT(0)-spaces. We refer to [8] for the details of the results on CAT(0)-spaces mentioned below. Let (X, dX ) be a metric space. A rectifiable curve γ : [0, 1] → X is called a geodesic if its arclength coincides with the distance dX (γ(0), γ(1)) and it has a constant speed, i.e., parameterized proportionally to the arclength. We say that a metric space is a geodesic space if any two points are joined by a geodesic between them. If any two points are joined by a unique geodesic, then the space is said to be uniquely geodesic. A complete geodesic space X is called a CAT(0)-space if we have 2 dX (x, γ(1/2)) ≤

1 1 1 2 2 2 dX (x, y) + dX (x, z) − dX (y, z) 2 2 4

for any x, y, z ∈ X and any geodesic γ : [0, 1] → X from y to z. For example, Hadamard manifolds, Hilbert spaces, and R-trees are all CAT(0)-spaces. An R-tree is a complete geodesic space such that the image of every simple path is the image of a geodesic. It follows from the next theorem that CAT(0)-spaces are uniquely geodesic.

3

Theorem 2.1 (cf. [8, Corollary 2.5]). Let N be a CAT(0)-space and γ, η : [0, 1] → N be two geodesics. Then, for any t ∈ [0, 1], we have dN (γ(t), η(t)) ≤ (1 − t) dN (γ(0), η(0)) + t dN (γ(1), η(1)) Let N be a CAT(0)-space. We denote by P 2 (N ) the set of all Borel probability measure ν on N having the finite moment of order 2, i.e., Z 2 dN (x, y) dν(y) < +∞ N

for some (hence all) x ∈ N . A point x0 ∈ N is called the barycenter of a measure ν ∈ P 2 (N ) if x0 is the unique minimizing point of the function Z 2 N 3 x 7→ dN (x, y) dν(y) ∈ R. N

We denote the point x0 by b(ν). It is well-known that every ν ∈ P 2 (N ) has the barycenter ([8, Proposition 4.3]). A simple variational argument implies the following lemma. Lemma 2.2 (cf. [8, Proposition 5.4]). Let H be a Hilbert space. Then, for each ν ∈ P 2 (H), we have Z b(ν) = ydν(y). H

Let (Ω, Σ, P) a probability space and N a CAT(0)-space. For an N -valued random variables W : Ω → N satisfying W∗ P ∈ P 2 (N ), we define its expectation EP (f ) ∈ N by the point b(W∗ P). By Lemma 2.2, in the case where N is a Hilbert space, this definition coincides with the classical one: Z EP (W ) = W (ω)dP(ω). Ω

The proof of the next lemma is easy, so we omit it. Lemma 2.3. Let N be a CAT(0)-space and ν ∈ P 2 (N ). Then, we have dN (b(ν), Supp ν) ≤ diam(Supp ν). Theorem 2.4 (Variance inequality, cf. [8, Proposition 4.4]). Let N be a CAT(0)-space and ν ∈ P 2 (N ). Then, for any z ∈ N , we have Z {dN (z, x)2 − dN (b(ν), x)2 }dν(x) ≥ dN (z, b(ν))2 N

We now explain the inductive mean value introduced by Sturm in [8, Definition 4.6]. Definition 2.5 (Inductive mean value). Given a sequence (yi )Ni=1 of points in a uniquely geodesic space X, we define a new sequence of points sn ∈ X, n ∈ N, by induction as follows. We define s1 := y1 and sn := γ(1/n), where γ : [0, 1] → X is the geodesic

4

KEI FUNANO

connecting two points sn−1 and yn . We denote the point sn by

1 n

−→ P

yi and call it the

i=1,··· ,n

inductive mean value of the points y1 , · · · , yn . Remark 2.6. (1) If the space X is a non-linear metric space, then the point

1 n

−→ P

yi

i=1,··· ,n

strongly depends on permutations of yi as we see the following example. For i = 1, 2, 3, let Ti := {(i, r) | r ∈ [0, +∞)} be a copy of [0, +∞) equipped with the usual Euclidean distance function. The tripod T is the metric space obtained by gluing together all these spaces Ti , i = 1, 2, 3, at their origins with the intrinsic distance function. Let y1 := (1, 1), y2 := (2, 1), and y3 := (3, 1). Then, the inductive mean value of order y1 , y2 , y3 is the point (3, 1/2), whereas the one of order y1 , y3 , y2 is the point (2, 1/2). (2) There are many other way to define a mean value of points y1 , · · · , yn in a CAT(0)space (see [8, Remark 6.4]). For example, define a mean value as the barycenter of these points. Observe that this definition does not depend on order of the points (and so it is different from inductive mean value in general). 2.2. Invariants of mm-spaces and measures. In this subsection we define several invariants of mm-spaces and measures, which are needed for the proof of the main theorems. An mm-space X = (X, dX , µX ) is a complete separable metric space (X, dX ) with a Borel probability measure µX . Let Y be a complete metric space and ν a finite Borel measure on Y having separable support with the total measure m. For any κ > 0, we define the partial diameter diam(ν, m−κ) of ν as the infimum of the diameter of Y0 , where Y0 runs over all Borel subsets of Y such that ν(Y0 ) ≥ m − κ. Let X be an mm-space with mX := µX (X) and Y a complete metric space. For any κ > 0, we define the observable diameter of X by ObsDiamY (X; −κ) := sup{diam(f∗ (µX ), mX − κ) | f : X → Y is a 1-Lipschitz map}. The idea of the observable diameter comes from the quantum and statistical mechanics, i.e., we think of µX as a state on a configuration space X and f is interpreted as an observable. Let X be an mm-space. Given any two positive numbers κ1 and κ2 , we define the separation distance Sep(X; κ1 , κ2 ) = Sep(µX ; κ1 , κ2 ) of X as the supremum of the number dX (A1 , A2 ), where A1 and A2 are Borel subsets of X such that µX (A1 ) ≥ κ1 and µX (A2 ) ≥ κ2 , and we put dX (A1 , A2 ) := inf{dX (x1 , x2 ) | x1 ∈ A1 , x2 ∈ A2 }. The next two lemmas are easy to prove. Lemma 2.7 (cf. [6, Section 3 21 .30]). Let X and Y be two mm-spaces and f : X → Y be a α-Lipschitz map such that f∗ (µX ) = µY . Then, for any κ1 , κ2 > 0, we have Sep(Y ; κ1 , κ2 ) ≤ α Sep(X; κ1 , κ2 ).

5

Lemma 2.8. Given two positive numbers κ1 and κ2 such that κ1 ≥ 1/2 and κ2 > 1/2, we have Sep(ν; κ1 , κ2 ) = 0. Lemma 2.9 (cf. [6, Section 3 21 .33]). Let X be an mm-space. Then, for any κ, κ0 > 0 with κ > κ0 , we have ObsDiamR (X; −κ0 ) ≥ Sep(X; κ, κ). See also [5, Lemma 2.5] for the proof of the above lemma. Let N be a CAT(0)-space and ν ∈ P 2 (N ). Given any κ > 0, we define the central radius CRad(ν, 1 − κ) as the infimum of ρ > 0 such that ν(BN (b(ν), ρ)) ≥ 1 − κ. Let X be an mm-space and N a CAT(0)-space such that f∗ (µX ) ∈ P 2 (N ) for any 1-Lipschitz map f : X → N . For any κ > 0, we define ObsCRadN (X; −κ) := sup{CRad(f∗ (µX ), 1 − κ) | f : X → N is a 1-Lipschitz map}, and call it the observable central radius of X. From the definition, we immediately obtain the following lemma. Lemma 2.10 (cf. [6, Section 3 21 .31]). For any κ > 0, we have ObsDiamR (X; −κ) ≤ 2 ObsCRadR (X; −κ). Observable diameters, separation distances, observable central radii are introduced by Gromov in [6, Chapter 3 21 ] to capture the theory of the L´evy-Milman concentration of 1-Lipschitz maps visually. Given an mm-space X, we define the concentration function αX : (0, +∞) → R of X as the supremum of µX (X \ A+r ), where A runs over all Borel subsets of X such that µX (A) ≥ 1/2 and A+r is an open r-neighborhood of A. Concentration functions were introduced by D. Amir and V. Milman in [1].

3. Proof of the main theorem Lemma 3.1. Let N be a CAT(0)-space. Then, for any n ∈ N, the map sn : N

⊗n

−→ 1 X xi ∈ N 3 (x1 , x2 , · · · , xn ) 7→ n i=1,··· ,n

is (1/n)-Lipschitz with respect to the `1 -distance function on the product space N ⊗n .

6

KEI FUNANO

Proof. Assuming that the map sn−1 is 1/(n − 1)-Lipschitz, by Lemma 2.1, we have  1 1 n−1 n−1 n n (s ((x ) ), s ((y ) )) ≤ 1 − dN n i i=1 n i i=1 dN (sn−1 ((xi )i=1 ), sn−1 ((yi )i=1 )) + dN (xn , yn ) n n n−1   1 1 X 1 ≤ 1− dN (xi , yi ) + dN (xn , yn ) n n − 1 i=1 n n

1X = dN (xi , yi ). n i=1 This completes the proof.



To prove Theorem 1.1, we need the following two theorems. Theorem 3.2 (cf. [3, Lemma 5.5]). Let ν be a Borel probability measure on an R-tree such that ν ∈ P 2 (T ). Then, there exists a 1-Lipschitz function ϕν : T → R such that  1 κ CRad(ν, 1 − κ) ≤ CRad((ϕν )∗ (ν), 1 − κ) + Sep ν; , 3 2  1 κ + Sep((ϕν )∗ (ν); 1 − κ, 1 − κ) + Sep (ϕν )∗ (ν); , 3 2 for any κ > 0. Theorem 3.3 (cf. [7, Corollary 1.17]). Let X = X1 ⊗ · · · ⊗ Xn be a product mm-space of mm-spaces Xi with finite diameter Di , i = 1, · · · , n, equipped with the probability Pproduct n 1 measure µX := µX1 ⊗ · · · ⊗ µXn and the ` -distance function d`1 := i=1 dXi . Then, for any 1-Lipschitz function f : X → R and any r > 0, we have (3.1) where D2 :=

µX ({x ∈ X | |f (x) − EµX (f )| ≥ r}) ≤ 2e−r

Pn i=1

2 /2D 2

,

Di2 . Moreover, we have αX (r) ≤ e−r

(3.2)

2 /8D 2

.

Proof of Theorem 1.1. Let sn : T ⊗n → T be a map which sends every point in T ⊗n to its inductive mean value. Putting ν := (Y1 )∗ P, we first prove the following. Claim 3.4. We have nr 2

ν ⊗n ({x ∈ T ⊗n | dN (sn (x), Eν ⊗n (sn )) ≥ r}) ≤ 4e− 75D2 . Proof. Since the metric space (T, n dT ) is an R-tree, by virtue of Theorem 3.2, there exists a 1-Lipschitz function ϕn : (T, n dT ) → R such that n CRad((sn )∗ (ν ⊗n ), 1 − κ)

 1 κ ≤ CRad((ϕn ◦ sn )∗ (ν ⊗n ), 1 − κ) + n Sep (sn )∗ (ν ⊗n ); , 3 2   1 κ + Sep (ϕn ◦ sn )∗ (ν ⊗n ); , + Sep((ϕn ◦ sn )∗ (ν ⊗n ); 1 − κ, 1 − κ) 3 2

7

for any κ > 0. By Lemma 3.1, the function ϕn ◦ sn : (T ⊗n , d`1 ) → R is 1-Lipschitz. Combining Lemma 2.7 with Lemmas 2.8, 2.9, and 2.10, for any κ, κ0 > 0 such that κ0 < κ < 1/2, we hence have  1 κ n CRad((sn )∗ (ν ⊗n ), 1 − κ) ≤ CRad((ϕn ◦ sn )∗ (ν ⊗n ), 1 − κ) + n Sep (sn )∗ (ν ⊗n ); , 3 2   ⊗n 1 κ + Sep (ϕn ◦ sn )∗ (ν ); ,  3 2 ⊗n ⊗n ⊗n κ κ ≤ ObsCRadR ((T , d`1 , ν ); −κ) + 2 Sep ν ; , 2 2 ⊗n ⊗n ≤ ObsCRadR ((T , d`1 , ν ); −κ) + 2 ObsDiamR ((T ⊗n , d`1 , ν ⊗n ); −κ0 /2) ≤ 5 ObsCRadR ((T ⊗n , d`1 , ν ⊗n ); −κ0 /2). According to the inequality (3.1), we thus get n CRad((sn )∗ (ν ⊗n ), 1 − κ) ≤ 5D

p

2n log(4/κ0 ).

Letting κ0 → κ yields that

r

2 4 log n κ 0 for any κ ∈ (0, 1/2). Given κ ≥ 1/2, taking an arbitrary κ ∈ (0, 1/2), we also estimate (3.3)

CRad((sn )∗ (ν ⊗n ), 1 − κ) ≤ 5D

CRad((sn )∗ (ν ⊗n ), 1 − κ) ≤ CRad((sn )∗ (ν ⊗n ), 1 − κ0 ) r 2 4 ≤ 5D log 0 n κ q r log κ40 2 4 = 5D q log κ log κ4 n q r log κ40 2 4 ≤ 5D √ log κ log 4 n Letting κ0 → 1/2, we hence get

r

4 3 log . n κ The above two inequalities (3.3) and (3.4) imply the claim. (3.4)

CRad((sn )∗ (ν

⊗n

), 1 − κ) ≤ 5D

Put an := dT (Eν ⊗n (sn ), b(ν)). By Sturm’s inequality (1.1), we have Z Z 1 2 2 ⊗n dT (x, b(ν)) dν(x). dT (sn (x), b(ν)) dν (x) ≤ n T T ⊗n



8

KEI FUNANO

Lemma 2.3 together with Lemma 2.4 thus implies that Z Z 1 4D2 2 2 ⊗n 2 an ≤ . dT (sn (x), b(ν)) dν (x) ≤ dT (x, b(ν)) dν(x) ≤ n T n T ⊗n For any r > an , by using Claim 3.4, we therefore obtain −→ n 1 X  o P ω ∈ Ω | dT Yi (ω), EP (Y1 ) ≥ r n i=1,··· ,n

= ν ⊗n ({x ∈ T ⊗n | dT (sn (x), b(ν)) ≥ r}) ≤ ν ⊗n ({x ∈ T ⊗n | dT (sn (x), Eν ⊗n (sn )) ≥ r − an }) ≤ 4e−

n(r−an )2 75D 2

na2 n

nr 2

≤ 4e 75D2 e− 150D2 4

nr 2

≤ 4e 75 e− 150D2 . If r ≤ an , then we have −→ n 1 X  o na2 na2 nr 2 nr 2 2 4 n n P ω ∈ Ω | dT Yi (ω), EP (Y1 ) ≥ r ≤ e 150D2 e− 150D2 < e 75 e− 150D2 < 4e 75 e− 150D2 . n i=1,··· ,n

Combining these two inequalities completes the proof of the theorem.



Theorem 1.2 follows from the same proof of Theorem 1.1 together with the inequality (3.2) and the following theorem. We shall consider an mm-space satisfying (3.5)

αX (r) ≤ CX e−cX r

2

for some positive constants cX , CX > 0 and any r > 0. For such an mm-space X and m ∈ N, we put √ (m+1)/(4m−2) πe 2 2 max{e(πCX ) /2 , 2CX e(πCX ) } Am,X := 1 + 2 and em,X := 1 + A



πCX e(m+1)/(4m−2) .

Theorem 3.5 (cf. [4, Theorem 1.1]). Let an mm-space X satisfies (3.5), N be an mdimensional Hadamard manifold, and f : X → N a 1-Lipschitz map. Then, for any r > 0, we have 2 em,X e−(cX /(16m))r2 }. µX ({x ∈ X | dN (f (x), EµX (f )) ≥ r}) ≤ min{Am,X e−(cX /(8m))r , A

9

References [1] D. Amir and V. D. Milman, Unconditional and symmetric sets in n-dimensional normed spaces, Israel J. Math., 37 (1980), 3–20. [2] A. Es-Sahib and H. Heinich, Barycentre canonique pour un espace m´etrique ` a courbure n´egative. (French. English, French summary) [Canonical barycenter for a negatively curved metric space] S´eminaire de Probabilit´es, XXXIII, 355–370, Lecture Notes in Math., 1709, Springer, Berlin, 1999. [3] K. Funano, Central and Lp -concentration of 1-Lipschitz maps into R-trees, J. Math. Soc. Japan, 61 (2009), 483–506. [4] K. Funano, Exponential and Gaussian concentration of 1-Lipschitz maps, to appear in Manuscripta Math. [5] K. Funano, Observable concentration of mm-spaces into spaces with doubling measures, Geom. Dedicata 127 (2007), 49–56. [6] M. Gromov, Metric structures for Riemannian and non-Riemannian spaces, Based on the 1981 French original, With appendices by M. Katz, P. Pansu and S. Semmes. Translated from the French by Sean Michael Bates. Progress in Mathematics, 152. Birkh¨auser Boston, Inc., Boston, MA, 1999. [7] M. Ledoux, The concentration of measure phenomenon, Mathematical Surveys and Monographs, 89. American Mathematical Society, Providence, RI, 2001. [8] K-T. Sturm, Probability measures on metric spaces of nonpositive curvature, Heat kernels and analysis on manifolds, graphs, and metric spaces (Paris, 2002), 357–390, Contemp. Math., 338, Amer. Math. Soc., Providence, RI, 2003. Department of Mathematics and Engineering, Graduate School of Science and Technology, Kumamoto university, Kumamoto 860-8500, JAPAN E-mail address: [email protected]

RATE OF CONVERGENCE OF STOCHASTIC ...

of order 2, we define its expectation EP(W) by the barycenter of the measure ... support of the measure (Y1)∗P has bounded diameter D. Then, for any r > 0, we ...

193KB Sizes 2 Downloads 311 Views

Recommend Documents

RATE OF CONVERGENCE OF STOCHASTIC ...
The aim of this paper is to study the weak Law of Large numbers for ... of order 2, we define its expectation EP(W) by the barycenter of the measure W∗P (the.

Improving convergence rate of distributed consensus through ...
Improving convergence rate of distributed consensus through asymmetric weights.pdf. Improving convergence rate of distributed consensus through asymmetric ...

Rate of convergence of local linearization schemes for ...
Linear discretization, the order of convergence of the LL schemes have not been ... In this paper, a main theorem on the convergence rate of the LL schemes for ...

The Rate of Convergence to Perfect Competition of ...
8 In our model, each trader's type is distributed on [0, 1] interval and has a ...... Auction with a Fixed Transaction Fee,” Econometrica, 73(2), 517—570. Williams ...

Rate of convergence of Local Linearization schemes for ...
email: [email protected], [email protected]. February 17, 2005. Abstract. There is ..... In Lecture Notes in Computer Science 2687: Artificial Neural Nets Problem.

The Rate of Convergence to Perfect Competition of ...
ematical Studies in Economics and Management Science at Kellogg School of .... auction (the set of bids is restricted to be a finite grid) and finds that Vas ...... Proof: We derive a system of equations characterizing the set of two.step equilibria.

Rate of convergence of Local Linearization schemes for ...
Feb 17, 2005 - The proposal of this paper is studying the convergence of the LL schemes for ODEs. Specif- ..... [20] T. Barker, R. Bowles and W. Williams, Development and ... [27] R.B. Sidje, EXPOKIT: software package for computing matrix ...

The rate of linear convergence of the Douglas ...
Apr 23, 2014 - [15] Y. Censor and S.A. Zenios, Parallel Optimization, Oxford University ... point algorithm for maximal monotone operators, Mathematical Programming (Series A) 55 ... [25] GNU Plot, http://sourceforge.net/projects/gnuplot.

The Rate of Convergence to Perfect Competition of ...
Only the buyers with 9' (J) % 0 and sellers with 9) (=) % 0 are active, so -' and -) are the ...... notebook that contains the evaluation of the Jacobian is available at.

Convergence of Consensus Models With Stochastic ...
T. C. Aysal is with the Communications Research in Signal Processing Group,. School of ...... Dr. Barner is the recipient of a 1999 NSF CAREER award. He was ...

On the Convergence of Stochastic Gradient MCMC ... - Duke University
†Dept. of Electrical and Computer Engineering, Duke University, Durham, NC, USA ..... to select the best prefactors, which resulted in h=0.033×L−α for the ...

Rate of Convergence in the Functional Law of the ...
Iterated Logarithm for Non-standard Normalizing. Factors. A.V. Bulinskii, M.A. Lifshits. Let W(t, ω) be a Brownian motion defined on a probabilistic space (Ω, F,P).

The Rate of Convergence to Perfect Competition of a ...
number τ > 0 proportional to the waiting time until the next meeting. We study the efficiency ...... Any bargaining game played in each meeting results in a trading ...

POINTWISE AND UNIFORM CONVERGENCE OF SEQUENCES OF ...
Sanjay Gupta, Assistant Professor, Post Graduate Department of .... POINTWISE AND UNIFORM CONVERGENCE OF SEQUENCES OF FUNCTIONS.pdf.

Improvement in convergence rate and stability: ICMA ...
array design, signal processing algorithms, space-time processing, wireless ... The LMS algorithm can be easily realized with the advantage of simple, less ...

Improvement in convergence rate and stability ... - IJRIT
IJRIT International Journal of Research in Information Technology, Volume 1, Issue 11 ... Associate Professor (Electronics Engineering Dept), Terna Engineering ...

Improvement in convergence rate and stability ... - IJRIT
IJRIT International Journal of Research in Information Technology, Volume 1 ... Associate Professor (Electronics Engineering Dept), Terna Engineering College, ...

Distributed Stochastic Pricing for Sum-Rate ...
advantages offered by the capillary deployment of femto- access points, has a clear ... FAPs is an Internet connection, which delivers packets in the network using a ..... OFDM wireless networks with non-separable utilities,” Proc. 42nd CISS,.

Strong convergence of viscosity approximation ...
Nov 24, 2008 - Very recently, Zhou [47] obtained the strong convergence theorem of the iterative ... convergent theorems of the iteration (1.6) for Lipschitz ...

MCMC: Convergence and tuning of IM
console and automatically generates various graphical files as well as numerical descriptions of the MCMC dataset. ... precision about the locations of parameters. These are the two practical issues that we ... parameter as a function of iteration nu

The Convergence of Difference Boxes
Jan 14, 2005 - On the midpoint of each side write the (unsigned) difference between the two numbers at its endpoints. 3. Inscribe a new square in the old one, ...

CONVERGENCE PROPERTY OF NOISE-INDUCED ...
7-1-2 Yoto, Utsunomiya-shi, Tochigi 321-8585, Japan [email protected]. Yusuke Nishizawa. ShinMaywa Industries, Ltd. 1-1 Shinmeiwa-cho, ...

Convergence of Pseudo Posterior Distributions ... -
An informative sampling design assigns probabilities of inclusion that are correlated ..... in the design matrix, X, is denoted by P and B are the unknown matrix of ...