메뉴 건너뛰기
Annals of Probability
Volumn 34, Issue 3, 2006, Pages 865-869
Ends in free minimal spanning forests
Author keywords

Indistinguishability; Minimal spanning forest; Number of ends
Indexed keywords

EID: 33746185705     PISSN: 00911798     EISSN: None     Source Type: Journal    
DOI: 10.1214/009117906000000025     Document Type: Article
Times cited : (10)
References (3)
  • 1
    • 0002795385 scopus 로고    scopus 로고
    • Percolation on transitive graphs as a coalescent process: Relentless merging followed by simultaneous uniqueness
    • (M. Bramson and R. Durrett, eds.). Birkhäuser, Boston. MR1703125
    • HÄGGSTRÖM, O., PERES, Y. and SCHONMANN, R. (1999). Percolation on transitive graphs as a coalescent process: Relentless merging followed by simultaneous uniqueness. In Perplexing Probability Problems: Papers in Honor of H. Resten (M. Bramson and R. Durrett, eds.) 69-90. Birkhäuser, Boston. MR1703125
    • (1999) Perplexing Probability Problems: Papers in Honor of H. Resten , pp. 69-90
    • Häggström, O.1    Peres, Y.2    Schonmann, R.3
  • 3
    • 0033233663 scopus 로고    scopus 로고
    • Indistinguishability of percolation clusters
    • MR1742889
    • LYONS, L. and SCHRAMM, O. (1999). Indistinguishability of percolation clusters. Ann. Probab. 27 1809-1836. MR1742889
    • (1999) Ann. Probab. , vol.27 , pp. 1809-1836
    • Lyons, L.1    Schramm, O.2

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.