A Web Search Engine Model - Suppose after we enter some keywords into our web search engine it finds five pages that contain those keywords. We will call these pages A, B, C, D, and E. The engine would like to rank the pages according to some measure of importance. To do so, we make note of which pages contain links to which other pages. Suppose we find the following links.
We then create a random walk where the initial state is equally likely to be any one of the five pages. At each time instant, the state changes with equal probability to one of the pages for which a link exists. For example, if we are currently in state A, then at the next time instant we will transition to either state B or state C with equal probability. If we are currently in state B, we will transition to state C, D, or E with equal probability, and so on. Draw a transition diagram and find the probability transition matrix for this Markov chain.
Answer to relevant QuestionsConsider a two- state Markov chain with a general transition probability matrix Where 0 < p, q< 1. Find an expression for the - step transition probability matrix, P n. A sinusoidal signal of the form X (t) = bcos (2πft + θ), is transmitted from a fixed platform. The signal is received by an antenna which is on a mobile platform that is in motion relative to the transmitter, with a ...A random process has a PSD function given by (a) Find the absolute bandwidth. (b) Find the 3 dB bandwidth. (c) Find the RMS bandwidth. Can you generalize your result to a spectrum of the form Where Nis an integer greater ...Suppose is a zero- mean, WSS, Gaussian random process. Find an expression for the variance of the estimate of the autocorrelation function, ṘXX (t). That is, find Var (ṘXX (t)). Let X (t) = Acos (ω t) + Bsin (ω t) where A and B are independent, zero- mean, identically distributed, non- Gaussian random variables. - Show that X (t) is WSS, but not strict sense stationary. Hint: For the latter case ...
Post your question