Search

11 Sep 2018: SELF-AVOIDING WALKS 11. The proof follows quickly by earlier results of Woess [73], and Gilchand Müller [24]. ... By [73, Thm 11.6], every G G,g is covered by F ,and by [24, Thm 3.3], F has connective constant 1/ζ.

14 Feb 2010: the queue size. Instead, as described in [24, 25], protocols act to control the. ... Computer Communication Review, 38 (2008) 51–. 62. [24] G. Raina, D.

20 Mar 2015: of [24]. We make some remarks about the three graphs of Figure 1.2. ... J. Math.Oxford 13 (1962), 108–110. [24] I. Jensen, A parallel algorithm for the enumeration of self-avoiding polygonson the square lattice, J.

9 Mar 2011: 15. Member State Population 5 upwards 6 standard Now. 24 Estonia 1 340 127 7 8 6. ... 24 Estonia 1 340 127 7 8 6. 25 Cyprus 803 147 6 7 6.

13 Mar 2015: By the mass-transport principle as enunciated in, for example, [24, Thm.8.7],. ... See [4] for ageneral account of the theory of Cayley graphs, and [24, sect.

15 Aug 2012: Our basic strategy in proving the central limit theorem isto adapt the arguments proposed by Kipnis and Varadhan [24] and further developed byDeMasi, Ferrari, Goldstein, and Wick [10, 11]. ... One of the main properties of the chain Xω is its

15 Apr 2009: ACM Comp. Commun. Rev. 24, 10{23.(See http://www.aciri.org/ oyd/ecn.html.). Floyd, S. & Jacobson, V.

15 Aug 2012: See [24, 51, 52] for more informa-tion and references.Few non-trivial facts are known about the limit set L, and much eort hasbeen spent, largely inconclusively, on attempting to

17 Aug 2010: F. Sidorenko, Percolation theoryand some applications, Itogi Nauki i Techniki (Series of Probability Theory,Mathematical Statistics, Theoretical Cybernetics) 24 (1986), 53–110.

23 Apr 2007: 25] and by Osborne and Nielsen [24] (see, forexample, [4] and the references therein for further studies). ... satisfying Q 1,S1 log ν. (2.24). 10 G. R. Grimmett, T.

7 Mar 2013: Amer. Math. Soc. 24 (2011), 375–409, available at: ams.org, arXiv:0911.0871. [21] L. ... Mathematical Statistics. Theoreti-cal Cybernetics, Vol. 24 (Russian), Itogi Nauki i Tekhniki, Akad.

11 Apr 2012: Ax,m(n)) nnr=0 hmp (r). 1. (24). Once this is proved, it follows by (23) that. ... prove (24), and the proof is essentially that of [11], Lemma 5.17.

18 Aug 2017: Such harmonic functions do not appear to contribute to thediscussion of the Liouville property (see, for example, [24, Defn 2.1.10]), since boththeir positive and negative parts are unbounded.

14 May 2008: Then from (22) we get. v̇j (t) = aj (Yj Cj ). Cj Yj T j. X. r:jr. xαrwαr Tr. zr(t Trj) (24). ... Proceedings of IFACWorld Congress, Barcelona, Spain 2002. [24] T. Voice. Stability of multi-path dual congestioncontrol algorithms.

25 Mar 2009: See [23, 24] and [5, 27]. Thespin-clusters of the Ising model on T are ‘critical’ (in a certain sense described below)for all p (pc(T), 12 ], and this suggests ... 24] , Towards conformal invariance of 2D lattice models, Proceedings of the

15 Aug 2012: φbp,q = αφ′ (1 α)φ′′. for some distinct φ′,φ′′ Rp,q. It follows by [24, Thm. ... The given statement for θ0 may be proved similarly, making use of Theorem3.2 and [24, Prop.

15 Aug 2012: Directed percolation is closely related to the contact model, for which blockarguments have been used to prove results related to some of those describedabove (see [7, 12, 23, 24]).

15 Aug 2012: 2.24) λ(C | Uj = 1) = λ(g(U ) A) λ(f (U ) A) = λ(B | Uj = 1).

14 Oct 1998: 1.24) δ(p) = limn. {n(d1)/d log Pp(|C|= n). }exists and is strictly positive when p > pc. ... The existence of the limit in (1.24) has been proved when d = 2 by Alexander,Chayes, and Chayes (1990), and when d = 3 by Cerf (1998b).

15 Aug 2012: Using (5.17)–(5.18) of[22], together with estimates at the beginning of the proof of Lemma (2.24) of [29],we find that. ... We have forf W(δ1) QG/3(e1) that. τ[QG/3(f) EL1,M1. ]= QG/3(τf) EL2,M2, (24).