找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

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

[复制链接]
查看: 8723|回复: 46
发表于 2025-3-21 18:20:11 | 显示全部楼层 |阅读模式
书目名称Discrete Probability and Algorithms
编辑David Aldous,Persi Diaconis,J. Michael Steele
视频video
丛书名称The IMA Volumes in Mathematics and its Applications
图书封面Titlebook: Discrete Probability and Algorithms;  David Aldous,Persi Diaconis,J. Michael Steele Conference proceedings 1995 Springer Science+Business M
描述.Discrete probability theory and the theory of algorithms have become close partners over the last ten years, though the roots of this partnership go back much longer. The papers in this volume address the latest developments in this active field. They are from the IMA Workshops "Probability and Algorithms" and "The Finite Markov Chain Renaissance." They represent the current thinking of many of the world‘s leading experts in the field...Researchers and graduate students in probability, computer science, combinatorics, and optimization theory will all be interested in this collection of articles. The techniques developed and surveyed in this volume are still undergoing rapid development, and many of the articles of the collection offer an expositionally pleasant entree into a research area of growing importance..
出版日期Conference proceedings 1995
关键词Markov chain; Probability theory; algorithms; combinatorics; network; random walk; sets
版次1
doihttps://doi.org/10.1007/978-1-4612-0801-3
isbn_softcover978-1-4612-6905-2
isbn_ebook978-1-4612-0801-3Series ISSN 0940-6573 Series E-ISSN 2198-3224
issn_series 0940-6573
copyrightSpringer Science+Business Media New York 1995
The information of publication is updating

书目名称Discrete Probability and Algorithms影响因子(影响力)




书目名称Discrete Probability and Algorithms影响因子(影响力)学科排名




书目名称Discrete Probability and Algorithms网络公开度




书目名称Discrete Probability and Algorithms网络公开度学科排名




书目名称Discrete Probability and Algorithms被引频次




书目名称Discrete Probability and Algorithms被引频次学科排名




书目名称Discrete Probability and Algorithms年度引用




书目名称Discrete Probability and Algorithms年度引用学科排名




书目名称Discrete Probability and Algorithms读者反馈




书目名称Discrete Probability and Algorithms读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 22:13:44 | 显示全部楼层
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.
发表于 2025-3-22 01:50:05 | 显示全部楼层
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.
发表于 2025-3-22 04:36:50 | 显示全部楼层
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.
发表于 2025-3-22 09:57:47 | 显示全部楼层
发表于 2025-3-22 13:59:02 | 显示全部楼层
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.
发表于 2025-3-22 18:30:49 | 显示全部楼层
发表于 2025-3-22 21:16:21 | 显示全部楼层
发表于 2025-3-23 01:31:51 | 显示全部楼层
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.
发表于 2025-3-23 06:10:13 | 显示全部楼层
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.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-8 04:00
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表