搜索结果: 91-105 共查到“知识库 概率论”相关记录912条 . 查询时间(7.379 秒)
G.H. Hardy and Probability
Hardy modern probability probability theory
font style='font-size:12px;'>
2015/7/8
Despite a true antipathy to the subject Hardy contributed deeply to modern probability. His work with Ramanujan begat probabilistic number theory. His work on Tauberian theorems and divergent series h...
Random Matrices, Magic Squares and Matching Polynomials
Random matrix the rubik's cube matching polynomial
font style='font-size:12px;'>
2015/7/8
Random Matrices, Magic Squares and Matching Polynomials。
What is...a Random Matrix?
Random Matrix
font style='font-size:12px;'>
2015/7/8
What is...a Random Matrix。
Solitaire: Man Versus Machine
Solitaire Man Machine
font style='font-size:12px;'>
2015/7/8
Solitaire: Man Versus Machine。
SEPARATION CUT-OFFS FOR BIRTH AND DEATH CHAINS
The birth and death chain separation veto
font style='font-size:12px;'>
2015/7/8
SEPARATION CUT-OFFS FOR BIRTH AND DEATH CHAINS。
ANALYSIS OF A BOSE-EINSTEIN MARKOV CHAIN
Convergence rate markov chain stationarity k arcsine
font style='font-size:12px;'>
2015/7/8
This paper gives sharp rates of convergence to stationarity for a Markov chain generating Bose-Einstein configurations of n balls in k boxes. The analysis leads to curious identities for the arc...
Fastest mixing Markov chain on a path
Distribution probability the edge markov chain random walk
font style='font-size:12px;'>
2015/7/8
We consider the problem of assigning transition probabilities to the edges of a path, so the resulting Markov chain or random walk mixes as rapidly as possible. In this note we prove that fastest mixi...
The Fastest Mixing Markov Process on a Graph and a Connection to a Maximum Variance Unfolding Problem
Markov connected graph edge tags transition rates
font style='font-size:12px;'>
2015/7/8
We consider a Markov process on a connected graph, with edges labeled with transition rates between the adjacent vertices. The distribution of the Markov process converges to the uniform distribution ...
Examples comparing Importance Sampling and the Metropolis algorithm
Sampling order markov chain monte carlo simulation technology the markov chain
font style='font-size:12px;'>
2015/7/8
Importance sampling, particularly sequential and adaptive importance sampling, have emerged as competitive simulation techniques to Markov–chain Monte–Carlo techniques. We compare importance sampling ...
Dynamical Bias in the Coin Toss
Berry phase randomness precession image analysis
font style='font-size:12px;'>
2015/7/8
We analyze the natural process of flipping a coin which is caught in the hand. We show that vigorously flipped coins tend to come up the same way they started. The limiting chance of comin...
GRAPH LIMITS AND EXCHANGEABLE RANDOM GRAPHS
Figure restrictions and can exchange random graph
font style='font-size:12px;'>
2015/7/8
GRAPH LIMITS AND EXCHANGEABLE RANDOM GRAPHS。
Gibbs Sampling, Exponential Families and Orthogonal Polynomials
Family convergence rate gibbs sampler standard index
font style='font-size:12px;'>
2015/7/8
We give families of examples where sharp rates of convergence to stationarity of the widely used Gibbs sampler are available. The examples involve standard exponential families and their conjugate pri...
A SEQUENTIAL IMPORTANCE SAMPLING ALGORITHM FOR GENERATING RANDOM GRAPHS WITH PRESCRIBED DEGREES
Sequential sampling algorithms the random graph degree
font style='font-size:12px;'>
2015/7/8
A SEQUENTIAL IMPORTANCE SAMPLING ALGORITHM FOR GENERATING RANDOM GRAPHS WITH PRESCRIBED DEGREES。
On times to quasi-stationarity for birth and death processes
Probability the space independent index variable parameter the dirichlet conditions
font style='font-size:12px;'>
2015/7/8
The purpose of this paper is to present a probabilistic proof of the well-known result stating that the time needed by a continuous-time finite birth and death process for going from the left en...
Random doubly stochastic tridiagonal matrices
Markov chain birth and death chain cuto phenomenon random matrix
font style='font-size:12px;'>
2015/7/7
Random doubly stochastic tridiagonal matrices。