Search

31 Jul 2013: What is here is still relevant, but the new schedule covers the general linear model, and Gauss-Markov theorem, which is not covered in these notes. ... Chance News reviews current issues in the news that use probability or statistical concepts.

10 May 2013: Abstract. This paper presents a new approach to modeling end-to-end performance for IP networks. ... Results are presented for an IP backbone network, which highlight how this new model finds the natural operating point for TCP, which depends on route

16 Oct 2013: Ateach time 1, 2, 3,. , a ball is chosen at random from the urn and is replaced together witha new ball of the same colour. ... Just before each time n = 1, 2,. , a new gambler arrives on the scene.

3 Feb 2013: LOG-CONCAVITY: NEW THEORY AND METHODOLOGY. Co-authors: Y. Chen, M. Cule, L. ... Sinica, to appear. • Comon, P. (1994) Independent component analysis, A new conc ept?

11 Sep 2013: The transformation maps G to a new graph F(G). We have two sets of results.First, the connective constants of G and F(G) satisfy a simple functional relation, and

8 Nov 2013: In Proc. 23 Annual ACM Symposium on Theory of Computing, New Orleans, May 6-8, pages 230-240, 1991. ... on Theory of Computing, pages 208213. ACM, New York, 2000.

18 Jan 2013: new direction suggested by the work.

1 Aug 2013: Can we generalize DLA and FPP?I When FPP weights are exponential, growth process selects new edges from.

28 Oct 2013: The Annals of Statistics2013, Vol. 41, No. 4, 1999–2028DOI: 10.1214/13-AOS1133 Institute of Mathematical Statistics, 2013. NONPARAMETRIC BERNSTEIN–VON MISES THEOREMS INGAUSSIAN WHITE NOISE. BY ISMAËL CASTILLO1 AND RICHARD NICKL. CNRS and

25 Apr 2013: In view of (2.1) in the new graph indegG(i) = indegG′(i) = outdegG′(i). ... Springer-Verlag, New York, 1998. [3] A. Burchard and M. Schmuckenschläger. Comparison theorems for exit times.

23 Nov 2013: In both cases, each thickened portion of w isbackward extendable. so that the old wa becomes the new w0.) Since loop-erasure does notincrease distances along the walk among the vertices

28 Feb 2013: Let new fees be as follows. p1(θ) = p1(θ1) x(θ) E[. ... Then adopt new payments:. p1(θ1, θ2, θ3,. , θn) = p1(θ1, θ2, θ3,. ,

25 Apr 2013: In this paper we establish a new connection between mixing times and hittingtimes for reversible Markov chains (Theorem 1.1). ... 8 A new proof of tprod tL for reversible chains. Recall the definition tprod = maxx,A.

12 Sep 2013: 1987). Tilings and Patterns. Freeman, New York.MR0857454. [8] KENYON, R. (2004). ... Springer, New York.MR0894549. [12] KESTEN, H. (1987). Scaling relations for 2D-percolation.

7 Feb 2013: is about to quit —, we increase the prize tog(y), which becomes the new ‘prevailing prize’. ... is about to quit —, we increase the prize tog(y), which becomes the new ‘prevailing prize’. •

30 Oct 2013: It remains to show that I2 <. By defininga new equivalence relation on rectangles in Dk, i.e. ... Springer-Verlag, New York, 1995. [10] D. Khoshnevisan and Y. Xiao. Brownian motion and thermal capacity.

7 Mar 2013: By Lemma 4.4again, X(ω′) X(ω) is finite, so no new infinite components have beencreated, and thus X(ω′) has strictly fewer that n infinite components.Since the modification

3 Jul 2013: It implies criticality of such values, therebyproviding a new proof of the critical point of inhomogeneous systems. ... A great deal of rigorous mathematics exists for critical site percolation on thetriangular lattice, but surprisingly little for other

14 Nov 2013: K. D. Glazebrook, D. J. Hodge, C. Kirkbride, R. J. Minty, Stochastic scheduling: Ashort history of index policies and new approaches to index generation for dynamicresource allocation, J Scheduling., 2013. ... Dating strategy: should I contact a new

10 Oct 2013: It is easy to check thatG = {iJBi : J N}.The natural thing to do is to define a new random variable X′ = E[X|G] as follows. ... So for allA Fn we have. E[Xn1(A)] = E[X1(A)]. Hence if we now define a new probability measure Q̃(A) = E[X1(A)], then Q(A) =

14 Nov 2013: Dating strategy: should I contact a new prospect, or tryanother date with someone I have dated before?

21 May 2013: It turns out thatO may be chosen insuch a way that the new graph, denotedG′, is isoradial also. ... The new vertexO is the circumcentreof the three dual vertices of the surrounding hexagon ofG3.

22 May 2013: 1.3 Where do Markov chains come from? At each time we apply some new ‘randomness’ to determine the next step, in a waythat is a function only of the current

14 Mar 2013: Bernoulli 19(2), 2013, 676–719DOI: 10.3150/11-BEJ412. Cluster detection in networks usingpercolationE RY A R I A S - C A S T RO1 and G E O F F R E Y R. G R I M M E T T2. 1Department of Mathematics, University of California, San Diego, CA 92093-0112

22 May 2013: The new drug is untested and has an unknown probability of success θ,which the doctor believes to be uniformly distributed over [0, 1]. ... For example, suppose p = 0.6 and 6 trials with the new drug have givens = f = 3.