Search
Search Funnelback University
- Refined by:
- Date: 2012
31 -
40 of
45
search results for news |u:www.statslab.cam.ac.uk
Fully-matching results
-
Geometry of Lipschitz percolation
www.statslab.cam.ac.uk/~grg/papers/AIHP403.pdf11 Apr 2012: U. In the latter case, we may remove U together with the previous DV stepto obtain a new admissible Λ-path from 0 to x of shorter length than π , a -
mcst.dvi
www.statslab.cam.ac.uk/~grg/papers/USmcst.pdf15 Aug 2012: By(3.13), this process is supercritical. It follows that pc(k) p.(iv) A detailed argument would be long and contain no new ideas, and is thereforeomitted. -
crit6.dvi
www.statslab.cam.ac.uk/~grg/papers/UScrit6.pdf15 Aug 2012: families a new collection (Yx : x Zd) of random variables, which constitutes a site. ... another vertex is selected as a new starting point, and the process is iterated. -
rctree.dvi
www.statslab.cam.ac.uk/~grg/papers/USrctree.pdf15 Aug 2012: We augment this graph by adding certainnew edges. Specifically, for distinct u,v Λ, we add a new edge between the pairu, v if either:(a) there exists a path of -
10-grg.dvi
www.statslab.cam.ac.uk/~grg/books/hammfest/10-grg.pdf15 Aug 2012: Each time we reach a new red vertex, there is astrictly positive probability that this vertex is the root of an ǫ-robust treein future generations. ... Soviet Mathe-matics Doklady 28, 23–26. Grimmett, G. R. (1989). Percolation. Springer-Verlag, New -
bg6.dvi
www.statslab.cam.ac.uk/~grg/papers/USbg6.pdf15 Aug 2012: At each new point that it encounters, this point is a rw point withprobability prw, and the chance that r new points are not rw points is therefore (1 ... LK1. Now, by Theorem 3.4 and the remarks thereafter, each time thatthe above construction -
inter4.dvi
www.statslab.cam.ac.uk/~grg/papers/USinter4.pdf15 Aug 2012: Thegeometry of the interfaces for this model is notably different from that of a spinmodel since the configurations are indexed by edges rather than by vertices, andthis leads to some new ... Although Dobrushin’s work is a helpfulindicator of the -
meanf.dvi
www.statslab.cam.ac.uk/~grg/papers/USmeanf.pdf15 Aug 2012: 6. Proofs of main results. In this section we combine the results derived so far with a new argument in orderto prove Theorems 2.1–2.3 for q 1. ... Inthe case q = 1, this gives new information about the probabilities of large deviationsof Cn. -
Random-cluster representation of the Blume–Capel model B. T. Graham,…
www.statslab.cam.ac.uk/~grg/papers/blume.pdf15 Aug 2012: q} where q 1. We intro-duce this new model in Section 3, where we dub it the Blume–Capel–Potts(BCP) model. -
ems.dvi
www.statslab.cam.ac.uk/~grg/papers/usems.pdf15 Aug 2012: THE RANDOM-CLUSTER MODEL. Geoffrey GrimmettAbstra t. The class of random-cluster models is a unification of a variety of sto-chastic processes of significance for probability and statistical physics, including per-colation, Ising, and Potts models;
Search history
Recently clicked results
Recently clicked results
Your click history is empty.
Recent searches
- news |u:www.equality.admin.cam.ac.uk (4) · moments ago
Recent searches
Your search history is empty.