• No results found

(2) Consider the simple ra,ndom walk (S,o),çN¡ on the d-dimensional integer lattice Zd

N/A
N/A
Protected

Academic year: 2021

Share "(2) Consider the simple ra,ndom walk (S,o),çN¡ on the d-dimensional integer lattice Zd"

Copied!
2
0
0

Bezig met laden.... (Bekijk nu de volledige tekst)

Hele tekst

(1)

Reexamination for the course on Random \ilalks

Teacher: L. Avena

FYiday 03 Februa¡y 2017, 10:00-13:00

r Write your narne and student identification number on each piece of paper you hand in.

o All answers must come with a full explanation.

o The use of notes or diktaat is not allowed.

o There are 18 questions. The total number of points is 100 + bonus (per question

indicated in boldface). A score of ) 55 points is sufficient.

(1) t5l Consider a symmetric random wa.lk (S,o),,çw, onZ starting from the origin with the following jumping rules: from arry t eZ,itjumps eitherto æ*2 or to æ-2 with probability 1/2. Compute the probability F¡(S¡a : ,t) for arbitrary M e N[6 ar¡Ld t e Z.

(2) Consider the simple ra,ndom walk (S,o),çN¡ on the d-dimensional integer lattice Zd.

(u) [f] Give the definitions of. recur'¡ence and trøns'ience.

(b) tl0l For which d is the simple random walk transient? Explain the main lines of a possible proof?

(3) Consider an infinite rooted regular tree with degree d > 1 (i.e. each node has d children) and unit resistances on the edges.

(") [S] Compute the effective resistance as a function of d.

(b) t5l For which d's is the effective resistance finite? What does this imply for the random walk associated to this infinite d-regular tree?

(4) Consider a finite connected graph g: (V,t) with conductances C,s (0,æ) assigned

to each of the edges ø3r t such that Cro: Cs* Pick any two vertices ø,b e V with a I b and place a battery across them.

(a) [fO] After defining the necessary objects, state the related Dirichlet, Thomson and Rayleþh monotonicity principles.

(b) [10] Give an application of the Rayleigh monotonicity principle.

(5) Let c, denote the m¡mber of self-avoiding walks of length r¿ AI on the ladder (i.e., two parallel copies of.Z that are sideways connected).

(") [¡] Compute c4.

(b) t5l Show that 3 x 2n 3 csn+t 5,3 x 23n, n AI, and use this to obtain bounds on the connectivity constant ¡,1.

(2)

(6) (u) t¡l Define the path spaceWn and the path measure 4 of.tihe pinning poìymer model of length n N.

(b) t5l l-et ( F+ /(() b" the free energy associated with the pinned polymer, we saw that

¡G):{\', ( ir(<o'

rs - !rros(2 - "-e), ii C t o. (1)

Compute and draw a plot of the derivative

"f /(() and explain how to read from this plot the phase transition locali,zed uerlul delocq,lized-

(") [S] Define the sa,me objects as in question 6.a for the wetti,ng polymer model of length n N[.

(d) [Bonus] Show how to obtain the free energy associated with the wetting polymer model by knowing the one associated with the pinned pol¡rmer.

(7) (") [S] Explain how the simple random walk on Z is related to the Brownian motion on IR.

(b) t5l Let (W(t))t¿e be a standard Brownian motion on IR. Set X(t) :W(2t)-W(t).

Is (X(f))¿¡6 a Brownian motion?

(") [S] Let (W1(t))¿>o and (Wz(t))r>o be independent standard Brownian motions on IR and let ø,b,c IR. \ {0}. What ß (claw1(tl"\+bw2$lb\])rro equal to in distribution?

(8) Consider the one period binomial asset pricing model. Suppose the the current price of

a stock is ,56 : 10 euro, and that at the end of the period its price must be either St : 5

or ,S1 : 20 euro. A call option on the stock is available with a strike price of K : 10 euro, expiring at the end of the period. It is also possible to borrow and lend at a 25To

rate of interest.

(u) [S] Compute the arbitrage-free price of the call option.

(b) t5l Suppose that you can buy such an option on the market for 3 euro. What should you do?

Referenties

GERELATEERDE DOCUMENTEN

Lemma 2.2 states that, conditioned on the occurrence of a cut time at time k, the color record after time k does not affect the probability of any event that is fully determined by

The strategy of a gambler is to continue playing until either a total of 10 euro is won (the gambler leaves the game happy) or four times in a row a loss is suffered (the gambler

(b) The answer in (a) is an upper bound for the number of self-avoiding walks on the cubic lattice, because this lattice has 6 nearest-neighbours (like the tree with degree 6)

Therefore it is impossi- ble to treat the desired continuous process as an actual limit of some rescaled random walk, but the convergence in distribution strongly suggests a

In een recent rapport van het Engelse Institution of Engineering and Technology (IET, zie www.theiet.org) wordt een overzicht gegeven van de redenen waarom 16-

a general locally finite connected graph, the mixing measure is unique if there exists a mixing measure Q which is supported on transition probabilities of irreducible Markov

Large deviation principle for one-dimensional random walk in dynamic random environment : attractive spin-flips and simple symmetric exclusion.. Citation for published

Here we show the remaining FWHM histograms of all FWHM values (figure A.2 and A.3) with no active flow and active flow, and mean FWHM values (figure A.4 – A.7) with no active