Titlebook: Discrete Probability and Algorithms; David Aldous,Persi Diaconis,J. Michael Steele Conference proceedings 1995 Springer Science+Business M

CANTO

書(shū)目名稱Discrete Probability and Algorithms影響因子(影響力)




書(shū)目名稱Discrete Probability and Algorithms影響因子(影響力)學(xué)科排名




書(shū)目名稱Discrete Probability and Algorithms網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱Discrete Probability and Algorithms網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱Discrete Probability and Algorithms被引頻次




書(shū)目名稱Discrete Probability and Algorithms被引頻次學(xué)科排名




書(shū)目名稱Discrete Probability and Algorithms年度引用




書(shū)目名稱Discrete Probability and Algorithms年度引用學(xué)科排名




書(shū)目名稱Discrete Probability and Algorithms讀者反饋




書(shū)目名稱Discrete Probability and Algorithms讀者反饋學(xué)科排名

牽連

Endoscopic Examination of the Esophagusand column sums. The combinatorial problems include counting magic squares, enumerating permutations by descent patterns and a variety of problems in representation theory. The statistical problems involve goodness of fit tests for contingency tables. We review these problems along with the available techniques for exact and approximate solution.

insidious

https://doi.org/10.1007/978-1-4613-4283-0r the transition probabilities and stationary distribution of the permutation chain. The spectral structure of the chain is presented explicitly. Bounds on the discrepancy from stationarity for the permutation chain are computed in terms of the corresponding discrepancy for the request chain, both for separation and for total variation distance.

ACRID

Victor H. Frankel,James W. Pughudorandom sequences as well as deterministic ones. Although most attention is given to previously published research, some new proofs and new results are given. In particular, some new phenomena are demonstrated for the monotonic subsequences of . of sequences. A number of open problems from the literature are also surveyed.

Forsake

符合規(guī)定

Rectangular Arrays with Fixed Margins,and column sums. The combinatorial problems include counting magic squares, enumerating permutations by descent patterns and a variety of problems in representation theory. The statistical problems involve goodness of fit tests for contingency tables. We review these problems along with the available techniques for exact and approximate solution.

符合規(guī)定

歡樂(lè)中國(guó)

Resection

Diencephalic Surgery for the Relief of PainWe present an algorithm which, given a .-state Markov chain whose steps can be simulated, outputs a random state whose distribution is within . of the stationary distribution, using .(.)space and .(?-2τ) time, where is a certain “average hitting time” parameter of the chain.

SOBER

M. V. Braimbridge,D. J. Hearse,D. A. StewartWe survey a number of algorithms that decide connectivity in undirected graphs. Our focus is on the use of random walks as a tool in reducing the space complexity of these algorithms.