Description Usage Arguments Value References Examples
Runs MCMC sampling for the gamma-Poisson model presented in Tebaldi & West (1998). The algorithm used is a modification of that presented in the original paper. It uses a joint proposal for (x_k, lambda_k) to greatly accelerate convergence.
1 | twMCMC(Y, A, prior, ndraws = 120000, burnin = 20000, verbose = 0)
|
Y |
numeric vector of observed link loads at a single time (length k) |
A |
routing matrix of dimension (k x n); needs to be full row rank |
prior |
parameters for conjugate gamma prior (convolution and rate) |
ndraws |
integer number of draws for sampler to produce (excluding burn-in) |
burnin |
integer number of additional draws to discard as burnin |
verbose |
integer level of verbosity; levels > 1 have no effect currently |
list consisting of matrix of draws for X XDraws
,
matrix of draws for X lambdaDraws
, and vector of
acceptances per OD flow accepts
C. Tebaldi and M. West. Bayesian inference on network traffic using link count data. Journal of the American Statistical Association, 93(442):557-573, 1998.
1 2 3 4 5 6 7 8 |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.