{"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}
{"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}
{"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}
{"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}
{"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}
{"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}
{"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}
{"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}
{"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}
{"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}