Print this page and work through it on paper. Revealed answers are never printed, so you can check one question and still print a clean sheet.

  1. Show the solution to question 1

    (a) Stationary, but not independent. The increment over is , which is whatever is. Its law depends on alone, so the increments are stationary.

    For independence take and the two consecutive increments and . Independent random variables have zero covariance, but

    So the increments are not independent. In fact any one increment determines and hence every other: the sample path is a random straight line through the origin, and knowing its slope on one stretch tells you the slope everywhere. A second symptom is the variance , which is not linear in — independent stationary increments force , and does not have that form.

    (b) Both. For , : a Poisson increment shifted by a constant. Increments of over disjoint intervals are independent by the counting definition, and subtracting constants does not disturb independence, so has independent increments. The law of is Poisson shifted by , which depends on only, so the increments are stationary.

    Since Poisson has mean and variance ,

    the variance being unchanged by the subtraction of a constant. is the Poisson process with its mean removed, and it is the jump-driven counterpart of Brownian motion: mean zero, variance growing linearly in , independent stationary increments.

    (c) Split at the earlier time. Take and write . The increment over is independent of , the increment over , so its covariance with is zero and

    The expression is symmetric in the roles of and once one relabels, so in general . This is the same covariance structure as Brownian motion, , up to the factor — and for the same reason: independent increments whose variance is proportional to the length of the interval.

  2. Show the solution to question 2

    (a) Convert the units first. Forty seconds is of a minute, so the Poisson mean is , a pure number. By the counting definition,

    (b) Twenty seconds is minute, mean . The complement of “at least one” is “none”:

    (c) Rewrite the event in terms of an increment. Given , the event is the event , a statement about the interval of length . By independent increments this increment is independent of , so the conditioning drops away, and the mean over is :

    It is not : that ratio would be a conditional probability only if were contained in , which it is not.

    (d) The past is irrelevant. “Nothing in the last minute” concerns the interval and “nothing in the next twenty seconds” concerns . These are disjoint, so by independent increments the second event is independent of the first, and the answer is the unconditional probability of no decay in an interval of length , with mean :

    Seen from the inter-arrival definition this is the memorylessness of the exponential gap: the minute already waited is discarded. Note the answer is exactly the complement of (b), as it must be.

  3. Show the solution to question 3

    (a) Counting–waiting duality. The second request arrives after time exactly when at most one request has arrived by time : , the complement of . With Poisson,

    (b) The Erlang density. is a sum of two independent Exp gaps, so by the law of the -th arrival time with ,

    Integrate by parts with and , so :

    The agreement is the equivalence theorem in one line: the count route and the waiting-time route describe the same process.

    (c) is a sum of three independent exponentials, each with mean and variance , so by linearity and independence

    An exponential with mean would have variance , three times as large, and its density would be largest at , whereas cannot be small unless all three gaps are — its Erlang density vanishes at . A sum of exponentials is not a rescaled exponential.

    (d) Memorylessness. By the inter-arrival definition with Exp independent of . Given , the event is , so

    Equivalently, by independent increments it is the probability of no request in , an interval of length with mean , which is again. Compare with (a): the conditional value is below the unconditional . That is the right direction, because the unconditional probability also includes the paths on which even the first request is still outstanding at (probability ), and on those is certain; fixing removes them.

  4. Show the solution to question 4

    Why cannot appear. By conditional uniformity, given the three arrival times are, as an unordered set, three independent Uniform points ; their conditional density on the ordered region contains no . The rate decides how many events occur, and that has been fixed. Every part below is a question about three uniform points.

    (a) Binomial thinning of the uniforms. is the number of the that fall in . Each does so independently with probability , so Binomial and

    Cross-check with increments, where enters and then cancels: .

    (b) is the smallest of the three uniforms, and means all three exceed . Each does so with probability , independently:

    (c) The sum of the arrival times is unchanged by ordering, so it is , and by linearity

    which is the expected sum of arrival times with , .

    (d) The maximum of three uniforms. , and exactly when all three are at most :

    Either differentiate to get the density and integrate against it, or use the tail formula for a non-negative variable:

    Sanity check against (c): by the symmetry of the uniform, , and the middle point has mean ; the three means sum to , agreeing with (c).

  5. Show the solution to question 5

    (a) Step 1 is correct. With the counting definition gives Poisson, and is right.

    Step 2 misquotes independent increments. The definition says that increments over disjoint intervals are independent — here over and over . It says nothing about and , which are counts over the nested intervals . They cannot be independent: on every path, so for instance while . The one-line refutation: the student's product formula would assign the impossible event the positive probability .

    Step 3 misquotes the inter-arrival definition. That definition makes the gaps exponential; is a sum of two independent exponentials, whose law is Erlang with density , not exponential. The mean is correct but the shape is not. One-line refutation: is small only if both gaps are small, so its density must vanish at , whereas every exponential density is largest at . (Equivalently, , not the an exponential of mean would have.)

    (b) (i) Rewrite the event with a disjoint increment: . Now independent increments applies, and the increment over has mean :

    Numerically this is about against the student's — uncomfortably close, which is exactly why the structural argument in (a) matters more than a numerical one.

    (ii) By the counting–waiting duality, with Poisson:

    Check by integrating the Erlang density: . The student's overstates the true , because an exponential of mean has a heavier tail than the Erlang of the same mean.

  6. Show the solution to question 6

    (a) Factorise, divide, cancel. The event is the event . The two processes are independent, so

    By the superposition theorem Poisson, so . Divide:

    The exponentials cancel because , the powers of cancel exactly, and what remains is

    since . This is the Binomial mass function. Note that has disappeared, as did in conditional uniformity: given the total, the split depends only on the ratio of the rates.

    (b) Put : . On the event the single event by time is the first event of , and it belongs to stream exactly when . So, given that exactly one event has occurred by time , it came from stream with probability , and this holds for every because cancelled.

    The proposition on which stream produced the next event says the same number, , but asserts more: that the identity of the first event is independent of its time , not merely that the conditional probability is the same for every window . Those windows overlap and are not a partition of the sample space, so (a) alone does not deliver the unconditional statement; the proof of the proposition supplies it by showing the joint law of factorises. What (a) does show, cleanly and with no integral, is where the number comes from: it is the binomial success probability of a Poisson split.

    (c) Here , , , and . By (a), Binomial, so

    Sanity check: unconditionally as well, and , so the conditioning on the typical total leaves the first room's expectation where it was.

  7. Show the solution to question 7

    (a) Moments of a compound Poisson process. The claim size has and , so . Over three months the count has mean . Hence

    (in thousands, and thousands squared). The law of total variance splits the as : only comes from uncertainty about how big the claims are, and — a fraction — from uncertainty about how many there are. Even with every claim fixed at the variance would still be .

    (b) Enumerate the ways to total . happens in exactly two ways: one claim of size , or two claims each of size . (No claims gives ; three or more claims give at least .) With Poisson and the sizes independent of the count,

    (c) Integrate the intensity. . The second hour is the interval , and the count there is Poisson with mean

    so the expected number of visits is and . Note the first hour has mean and the third has mean : the increments are Poisson and independent but not stationary.

    (d) Condition through the increments. The event is . The two increments are independent with means and , and Poisson:

    Conditional uniformity would give , but it requires a constant rate: the intensity is lowest in the first hour, so a lone visit is less likely to have landed there. The answer is the conditional-uniformity statement on the -scale — given one event, its time has density , and .

  8. Show the solution to question 8

    (a) Split at time . Write . The increment is independent of by independent increments, and a difference of independent normals is normal with the variances added:

    Check through the covariance : .

    (b) with independent of . Given , therefore, , and

    (c) , and the standard deviations are and , with product . So , which is . For the covariance is and the product of standard deviations is , so the correlation is again : it depends only on the ratio of the two times, which is the scaling property showing itself.

    (d) Verify the four clauses. Start: . Independent increments: for , is the increment of over . Disjoint intervals in shift to disjoint intervals in , so increments of over disjoint intervals are increments of over disjoint intervals, hence independent. Gaussian increments: . Continuity: is a continuous path shifted in time, and subtracting the constant preserves continuity, so the paths of are continuous almost surely. All four hold, so is a standard Brownian motion.

    Moreover is independent of , since its increments live on intervals beyond . That is the Markov property of at the fixed time ; the strong Markov property invoked by the reflection principle is the same restart at a random time .

  9. Show the solution to question 9

    (a) A smooth function has zero quadratic variation. Since is continuous on the compact interval it is bounded: for all . By the mean value theorem for some , so and

    The mechanism is , one order smaller than ; summing such terms gives something of order .

    (b) Expand and treat three sums. Write , so the are independent with , and . Squaring and summing,

    The drift-only sum is deterministic, and by the estimate of (a) applied to , .

    The cross sum has , and by independence of the ,

    so in .

    The Brownian sum in by the quoted theorem, since multiplying by the constant multiplies by .

    Combine with the triangle inequality for the norm (Minkowski's inequality):

    using that is a non-negative constant. This is convergence to ; convergence in probability follows by Chebyshev's inequality.

    (c) Roughness, and blindness to drift. Suppose the path of were continuously differentiable on with some probability . On that event, (a) says the quadratic sums tend to along every sequence of partitions. But (b) says they tend to in probability, so along some subsequence of partitions they tend to almost surely — in particular on a subset of the smooth event of probability , where they also tend to . Contradiction, so : almost surely the path is not on , and adding a drift, however large, does not smooth it.

    The limit contains no . Quadratic variation is blind to the drift: the drift is a smooth function, and (a) shows smooth functions contribute nothing to it, whereas is recovered exactly from any stretch of path. Two models differing only in produce paths that no quadratic-variation measurement can tell apart; two models differing in produce paths that are distinguishable with certainty.

  10. Show the solution to question 10

    (a) Complement the reflection principle. The reflection principle gives for . This is continuous in , and , so has no atoms and

    For the probability is , since on every path. Differentiating on by the chain rule,

    At the formula gives , so : with probability the maximum over is strictly positive, however small is. The path does not linger at or below after starting — it takes positive values immediately, and by symmetry negative ones too, so it crosses zero infinitely often in every interval .

    (b) Same distribution function. For ,

    using ; and both variables have distribution function for . Equal distribution functions mean equal laws, so . (Only in distribution: pathwise but fails whenever the path finishes well below where it started.)

    Therefore with standard normal, and by symmetry

    using . Hence , growing like as scaling demands.

    (c) The sketch. Draw the -axis from to and a vertical axis up to about .

    The density of is the standard bell : symmetric about , height at the centre, inflection points at , effectively zero by . Its mean is at by symmetry; mark it.

    The density of is for all — draw it flat along the axis there — and equals for . So on it is the bell stretched vertically by a factor of exactly : at it starts at , twice the height of the other curve, and it lies above the curve at every positive , decreasing and tending to by . Draw the two curves so that the vertical gap between them at each equals the height of the lower one.

    Areas. The bell has area , of which lies on . Doubling that half gives area for the density, which is why the taller curve on a half-line and the shorter curve on the whole line can both be densities.

    Discontinuity. At the density jumps from to ; draw it as an open circle at and a filled one at , or simply as a vertical wall. The distribution function of is continuous (no atom, from (a)); it is the density that jumps.

    Means. Mark the mean of at on the axis, to the right of the curve's peak because the density is decreasing on its whole support and so is right-skewed. It is a coincidence of the standard normal that this number equals the density's height at ; the two marks should sit on different axes.

  11. Show the solution to question 11

    (a) Chain rule. Write . Then, with and ,

    It is non-negative. As , so ; as , so . A non-decreasing function running from to whose derivative is means , so this is a genuine density. (Near the factor crushes the : the path almost never reaches immediately.)

    (b) The tail is too fat for a mean. . For the exponent satisfies , so , and dropping the part of the integral below ,

    So the level is reached with probability but the expected time to reach it is infinite, for every : the density decays like , and is not integrable at infinity.

    (c) Equal distribution functions. For ,

    so . The scaling property explains it: is again a standard Brownian motion, and exactly when . So the first time hits is , and since is a standard Brownian motion that time has the law of . Doubling the level quadruples the time, because Brownian motion spreads like .

    (d) Reflect, and integrate over the hitting time. Condition on . By the strong Markov property the process restarts at level as a fresh Brownian motion, so is symmetric about given . Finishing at or below is and finishing at or above is , mirror images, hence equally likely given . Integrating over ,

    the last step because forces by continuity of the path (the intermediate value theorem). Finally , so . This is the reflection principle with the endpoint tracked: the ordinary principle reflects paths ending anywhere below ; here only those ending below , which reflect to paths ending above .

    With and , and from the reflection principle,

    Sanity check on the size: and , so the conditional probability is about , far below the unconditional . A path known to have reached is very unlikely to have fallen all the way back past by time , and the formula quantifies exactly how unlikely.

  12. Show the solution to question 12

    (a) One conditional probability is forced to zero. The event is . But always, so on this event : the first replacement is certain to fall in the second year. Hence

    Unconditionally, no replacement in can only happen with (the case was just excluded) and then , since and every later . Condition on , which has density : we need , of probability . Therefore

    The increment over has a different law given the increment over than it has unconditionally, so the two increments are dependent.

    Not stationary either: , while . Two intervals of the same length carry different increment laws.

    (b) Counting–waiting duality for a renewal process. From the identity holds exactly as for the Poisson process. Now is uniform on the cube of volume , and the region is a simplex of volume that lies entirely inside the cube (each coordinate is automatically at most ). So

    giving , , , , and so on. The mean, by the tail-sum formula,

    The long-run rate is per year (see (c)), so the comparison process is Poisson with , for which Poisson: against the true (a component cannot last beyond two years), and against the true . Same long-run rate, quite different law at .

    (c) Memorylessness fails, and that is the whole story.

    A memoryless lifetime would make these equal; here a component that has survived a year is more likely to fail in the next half-year than a new one is, because it is wearing out. That is exactly the information carries about the future: says the current component is at least a year old, which changes the law of what happens in — the dependence exhibited in (a). Independent increments would require the future after any fixed time to be blind to the age of the current component, which is memorylessness, which only the exponential has.

    So lacks both independent increments and stationary increments, two of the three clauses of the Lévy definition (it does start at ). This is the general fact that a renewal process is Lévy only when its gaps are exponential, seen in one concrete case.

    What survives is the long-run behaviour. The gaps are i.i.d., strictly positive, with finite mean , so by the elementary renewal theorem almost surely: one replacement per year in the long run, about over a -year horizon, even though every exact Poisson formula is wrong for this process at every finite .

Full solutions sheet →