Microsurveys in Discrete Probability最新文献

筛选
英文 中文
Distinguishing and reconstructing sceneries from observations along random walk paths 从随机行走路径上的观察中区分和重建景观
Microsurveys in Discrete Probability Pub Date : 1900-01-01 DOI: 10.1090/dimacs/041/05
H. Kesten
{"title":"Distinguishing and reconstructing sceneries from observations along random walk paths","authors":"H. Kesten","doi":"10.1090/dimacs/041/05","DOIUrl":"https://doi.org/10.1090/dimacs/041/05","url":null,"abstract":"","PeriodicalId":415301,"journal":{"name":"Microsurveys in Discrete Probability","volume":"550 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123373707","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 36
Coupling from the past: A user's guide 过去的耦合:用户指南
Microsurveys in Discrete Probability Pub Date : 1900-01-01 DOI: 10.1090/dimacs/041/09
J. Propp, David Wilson
{"title":"Coupling from the past: A user's guide","authors":"J. Propp, David Wilson","doi":"10.1090/dimacs/041/09","DOIUrl":"https://doi.org/10.1090/dimacs/041/09","url":null,"abstract":"The Markov chain Monte Carlo method is a general technique for obtaining samples from a probability distribution. In earlier work, we showed that for many applications one can modify the Markov chain Monte Carlo method so as to remove all bias in the output resulting from the biased choice of an initial state for the chain; we have called this method Coupling From The Past (CFTP). Here we describe this method in a fashion that should make our ideas accessible to researchers from diverse areas. Our expository strategy is to avoid proofs and focus on sample applications.","PeriodicalId":415301,"journal":{"name":"Microsurveys in Discrete Probability","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116492331","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 82
Mixing times 混合时间
Microsurveys in Discrete Probability Pub Date : 1900-01-01 DOI: 10.1090/dimacs/041/06
L. Lovász, P. Winkler
{"title":"Mixing times","authors":"L. Lovász, P. Winkler","doi":"10.1090/dimacs/041/06","DOIUrl":"https://doi.org/10.1090/dimacs/041/06","url":null,"abstract":"The critical issue in the complexity of Markov chain sampling techniques has been mixing time\", the number of steps of the chain needed to reach its stationary distribution. It turns out that there are many ways to deene mixing time|more than a dozen are considered here|but they fall into a small number of classes. The parameters in each class lie within constant multiples of one another, independent of the chain. Furthermore, there are interesting connections between these classes related to time reversal. This work is more in the nature of a long research paper than a survey, with many new results and proofs. Some of the results have appeared in recent articles or were known previously for the important special case of reversible chains.","PeriodicalId":415301,"journal":{"name":"Microsurveys in Discrete Probability","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121321431","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 86
Beyond the method of bounded differences 超越有界差分法
Microsurveys in Discrete Probability Pub Date : 1900-01-01 DOI: 10.1090/dimacs/041/03
A. Godbole, P. Hitczenko
{"title":"Beyond the method of bounded differences","authors":"A. Godbole, P. Hitczenko","doi":"10.1090/dimacs/041/03","DOIUrl":"https://doi.org/10.1090/dimacs/041/03","url":null,"abstract":"","PeriodicalId":415301,"journal":{"name":"Microsurveys in Discrete Probability","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128054749","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 18
Enumerations of trees and forests related to branching processes and random walks 与分支过程和随机漫步相关的树木和森林的枚举
Microsurveys in Discrete Probability Pub Date : 1900-01-01 DOI: 10.1090/dimacs/041/08
J. Pitman
{"title":"Enumerations of trees and forests related to branching processes and random walks","authors":"J. Pitman","doi":"10.1090/dimacs/041/08","DOIUrl":"https://doi.org/10.1090/dimacs/041/08","url":null,"abstract":"In a Galton-Watson branching process with o spring distribution (p0; p1; : : :) started with k individuals, the distribution of the total progeny is identical to the distribution of the rst passage time to k for a random walk started at 0 which takes steps of size j with probability pj+1 for j 1. The formula for this distribution is a probabilistic expression of the Lagrange inversion formula for the coe cients in the power series expansion of f(z) in terms of those of g(z) for f(z) de ned implicitly by f(z) = zg(f(z)). The Lagrange inversion formula is the analytic counterpart of various enumerations of trees and forests which generalize Cayley's formula kn k 1 for the number of rooted forests labeled by a set of size n whose set of roots is a particular subset of size k. These known results are derived by elementary combinatorial methods without appeal to the Lagrange","PeriodicalId":415301,"journal":{"name":"Microsurveys in Discrete Probability","volume":"220 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123622415","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 82
Tree-valued Markov chains and Poisson-Galton-Watson distributions 树值马尔可夫链和泊松-高尔顿-沃森分布
Microsurveys in Discrete Probability Pub Date : 1900-01-01 DOI: 10.1090/dimacs/041/01
D. Aldous
{"title":"Tree-valued Markov chains and Poisson-Galton-Watson distributions","authors":"D. Aldous","doi":"10.1090/dimacs/041/01","DOIUrl":"https://doi.org/10.1090/dimacs/041/01","url":null,"abstract":"The Poisson-Galton-Watson distribution on nite trees, and the related PGW 1 (1) distribution on innnite trees with one end, arise in several contexts, in particular as n ! 1 weak limits within various size-n combinato-rial models. We review this topic, introducingslick notation for describing such distributions. We then describe a family of continuous-time Markov chains whose marginal distributions are of Poisson-Galton-Watson type. Diierent chains in this family have connections with diierent parts of the extensive literature on tree and forest-valued chains (the random graph process, stochastic coalescence, spanning tree chains) and also illustrate the classical state-space-compactiication theory of continuous-time countable-state chains.","PeriodicalId":415301,"journal":{"name":"Microsurveys in Discrete Probability","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129815057","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 27
Couplings for normal approximations with Stein's method 用Stein方法求解正态近似的耦合
Microsurveys in Discrete Probability Pub Date : 1900-01-01 DOI: 10.1090/dimacs/041/10
G. Reinert
{"title":"Couplings for normal approximations with Stein's method","authors":"G. Reinert","doi":"10.1090/dimacs/041/10","DOIUrl":"https://doi.org/10.1090/dimacs/041/10","url":null,"abstract":"","PeriodicalId":415301,"journal":{"name":"Microsurveys in Discrete Probability","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117267920","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 22
Annotated bibliography of perfectly random sampling with Markov chains 带马尔可夫链的完全随机抽样注释书目
Microsurveys in Discrete Probability Pub Date : 1900-01-01 DOI: 10.1090/dimacs/041/11
David B. Wilson
{"title":"Annotated bibliography of perfectly random sampling with Markov chains","authors":"David B. Wilson","doi":"10.1090/dimacs/041/11","DOIUrl":"https://doi.org/10.1090/dimacs/041/11","url":null,"abstract":"","PeriodicalId":415301,"journal":{"name":"Microsurveys in Discrete Probability","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123799418","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 40
A bird's-eye view of uniform spanning trees and forests 统一生成树和森林的鸟瞰图
Microsurveys in Discrete Probability Pub Date : 1900-01-01 DOI: 10.1090/dimacs/041/07
R. Lyons
{"title":"A bird's-eye view of uniform spanning trees and forests","authors":"R. Lyons","doi":"10.1090/dimacs/041/07","DOIUrl":"https://doi.org/10.1090/dimacs/041/07","url":null,"abstract":"","PeriodicalId":415301,"journal":{"name":"Microsurveys in Discrete Probability","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134551161","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 44
Dynamical percolation: Early results and open problems 动态渗流:早期结果和开放性问题
Microsurveys in Discrete Probability Pub Date : 1900-01-01 DOI: 10.1090/dimacs/041/04
Olle Häggström
{"title":"Dynamical percolation: Early results and open problems","authors":"Olle Häggström","doi":"10.1090/dimacs/041/04","DOIUrl":"https://doi.org/10.1090/dimacs/041/04","url":null,"abstract":"","PeriodicalId":415301,"journal":{"name":"Microsurveys in Discrete Probability","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114244788","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书