Search

Search Funnelback University

Search powered by Funnelback
10 results 20 results 50 results
Relevance Date (Newest first) Date (Oldest first) Title (A-Z) Title (Z-A) Distance URL (A-Z) URL (Z-A) Shuffle
1 - 10 of 10 search results for TALK:PC53 20 |u:www.statslab.cam.ac.uk where 0 match all words and 10 match some words.

  1. Results that match 1 of 2 words

  2. Stat Comput (2010) 20: 1–7DOI 10.1007/s11222-008-9108-5 Importance…

    www.statslab.cam.ac.uk/~rjs57/Gramacy2010_Article_ImportanceTempering.pdf
    1 Dec 2018: Stat Comput (2010) 20: 1–7 3. we define the effective sample size by. ... Am. Stat. 52(2), 93–100 (1998). Stat Comput (2010) 20: 1–7 7.

  3. A multiple myeloma classification system that associates normal…

    www.statslab.cam.ac.uk/~rjs57/2400.full.pdf
    9 Dec 2018: D1plusD2 0 (0) 4 (20) 2 (10) 2 (10) 9 (45) 0 (0) 3 (15) 20. ... Progression free survival (months). 0.8. 1.0. 0 20. Pre–BI, n = 3/5.

  4. Percolation and Random walks on graphs Perla Sousi∗ May ...

    www.statslab.cam.ac.uk/~ps422/percolation-rws.pdf
    3 Oct 2018: Pp(AB) Pp(A) Pp(B). Remark 1.20. FKG stands for Fortuin, Kasteleyn and Ginibre. ... We now prove (1.20). First of all we note that for all n 1.

  5. Cutoff for Random Walk on Dynamical Erdős-Rényi Graph Perla ...

    www.statslab.cam.ac.uk/~ps422/ER_Annealed.pdf
    21 Nov 2018: Theorem 1.1 (Cutoff for Full System). For all λ > 1, all ε (0, 1), all M N and all n sufficientlylarge, for p = λ/n and µ (log ... 0, 1}E with πER(H) = 1 o(1) so that,for all η0 H, for µ (log n)20/n, we have.

  6. mc18-1.dvi

    www.statslab.cam.ac.uk/~grg/teaching/mc18-1.pdf
    3 Oct 2018: P =. . . . . . 1. 20 0 0 1. ... 4. 1. 4. 1. 4. 1. 41. 20 0 0 1.

  7. RaG publications

    www.statslab.cam.ac.uk/~grg/rag-pubs.html
    24 Apr 2018: Geoffrey Grimmett, Zhongyang Li. European Journal of Combinatorics 20 (2013), Paper P47, 14 pp.

  8. SELF-AVOIDING WALKS ANDCONNECTIVE CONSTANTS GEOFFREY R. GRIMMETT AND…

    www.statslab.cam.ac.uk/~grg/papers/rev-final11.pdf
    11 Sep 2018: 20 GRIMMETT AND LI. In this section, we discuss the bridge constant for transitive graphs,therein introducing the graph height functions that will be useful inthe discussion of locality in Section

  9. 1 Degressive Representation of Member States in the European ...

    www.statslab.cam.ac.uk/~grg/papers/PukelsheimGrimmettDegressive.pdf
    21 Feb 2018: 2017. Composition of the European Parliament – The FPS-Method. Typescript, 20 August 2017 (www.uni-augsburg.de/pukelsheim/2017Brussels/). ... 205–20. SŁOMCZYŃSKI, WOJCIECH and KAROL ŻYCZKOWSKI. 2012. Mathematical aspects of degressive

  10. LOCALITY OF CONNECTIVE CONSTANTS GEOFFREY R. GRIMMETT AND ZHONGYANG…

    www.statslab.cam.ac.uk/~grg/papers/loc2018-2.pdf
    14 Jul 2018: We pick w πm such that. 20 GEOFFREY R. GRIMMETT AND ZHONGYANG LI. ... J. Combin. 20 (2013), Paper P47.[16] , Strict inequalities for connective constants of regular graphs, SIAM J.

  11. pgs2e-draft.dvi

    www.statslab.cam.ac.uk/~grg/books/pgs2e-draft.pdf
    4 Jan 2018: We shall show that. (1.20)n. j=1ivj ,vj1 = 0,. and this will confirm (1.12), on recalling that we = 1 for all e E. ... 0 otherwise. Therefore, B makes a contribution towards the sum in (1.20) that is equal toN1(F+F), where F+ (respectively, F) is the

Refine your results

clear all

Date

Search history

Recently clicked results

Recently clicked results

Your click history is empty.

Recent searches

Recent searches

Your search history is empty.