Description: The course covers mathematics useful in analyzing computer algorithms. Topics include recurrence relations; evaluation of sums; integer functions; elementary number theory; binomial ...

Let T denote a subset of the possible transitions between the states of a finite Markov chain and let Yk denote the time of the kth occurrence of a T-transition. Formulae are derived for the ...

This is a preview. Log in through your library . Abstract Let {Xt} be a discrete multivariate Gaussian autoregressive process of order 1. The paper derives the exact finite-sample joint moment ...