Search

15 Aug 2012: Theorem 6. [24] We have that µp(K = 1) = 1 whenever p > pentc. ... Soc., 130:175–188, 2001. MR1797779. [24] O. Häggström. Uniqueness of the infinite entangled component in three-dimensional bond percolation.

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.