Yaglom limits can depend on the starting state
|
|
- Lynette Goodman
- 6 years ago
- Views:
Transcription
1 Yglom limits cn depend on the strting stte Ce trvil conjoint vec Bo Foley 1 est dédié à Frnçois Bccelli. Dvid McDonld 2 Mthemtics nd Sttistics University of Ottw dvid.r.mcdonld@gmil.com 12 Jnury Prtilly supported y NSF Grnt CMMI Prtilly supported y NSERC Grnt 4551 / 2011
2 A quottion Semi-infinite rndom wlk with sorption Gmler s ruin Our exmple Periodic Yglom limits Applying the theory ρ-mrtin entrnce oundry Closing words
3 The long run is misleding guide... The long run is misleding guide to current ffirs. In the long run we re ll ded. Economists set themselves too esy, too useless tsk if in tempestuous sesons they cn only tell us tht when the storm is pst the ocen is flt gin. John Mynrd Keynes Keynes ws Proilist: Keynes, John Mynrd (1921), Tretise on Proility, London: Mcmilln & Co. Rther thn insinuting tht Keynes didn t cre out the long run, proilists might interpret Keynes s dvocting the study of evnescent stochstic process: P x {X n = y X n S}.
4 An evnescent process Gmler s ruin Suppose gmler is pitted ginst n infinitely welthy csino. The gmler enters the csino with x > 0 dollrs. With ech ply, the gmler either wins dollr with proility where 0 < < 1/ or loses dollr with proility where + = 1. The gmler continues to ply for s long s possile. In the long run the gmler is certinly roke. Wht cn e sid out her fortune fter plying mny times given tht she still hs t lest one dollr?
5 A qusi-sttionry distriution Senet nd Vere-Jones (1966) nswered this question with the following proility distriution π : π (y) = 1 ρ y where = 1 nd ρ = 2. ( ) y 1 for y = 1, 2,... (1)
6 Limiting conditionl distriutions Let X n e her fortune fter n plys. Notice tht her fortune lterntes etween eing odd nd even. For n lrge, Senet nd Vere-Jones proved tht P x {X n = y X n 1} { π (y) π (2N) π (y) π (2N 1) for y even, x + n even, for y odd, x + n odd. The suscript x mens tht X 0 = x, N := {1, 2,...}. The proility π ssigns to the even nd odd nturl numers is denoted y π (2N) nd π (2N 1), respectively.
7 Gmler s ruin s Mrkov chin The Senet Vere-Jones exmple hs stte spce N 0 := {0} N where 0 is soring. The trnsition mtrix etween sttes in N is P = P is irreducile, strictly sustochstic, nd periodic with period 2.
8 Grphic of Gmler s ruin Figure: P restricted to N.
9 Fcts from Senet nd Vere-Jones The z-trnsform of the return time to 1 is given in Senet nd Vere-Jones: ( 1 ) 1 4z F 11 (z) = 2. 2 Hence the convergence prmeter of P is R = 1/ρ where ρ = 2. Moreover F 11 (R) = 1/2 so P is R-trnsient. Using Stirling s formul s n : for y x even P 2n (x, y) xy ( 2 ) ( ) x 1 ( n πn 3/2 ) y 1. Denote the time until sorption y τ so P x (τ = n) = f (n) x0. If n x is even then from Feller Vol. 1 f (n) x0 x 2 n+1 (2π) 1/2 (n) 3/2 1 2 (n x) 1 2 (n+x).
10 Define the kernel Q It will e convenient to introduce chin with kernel Q on N 0 with sorption t δ defined for x 0 y Q(x, y) = P (x + 1, y + 1) 0 δ Figure: Q is P relelled to N 0.
11 Our exmple The kernel K of our exmple hs stte spce Z. For x > 0, K(x, y) = Q(x, y), K( x, y) = Q(x, y), K(0, 1) = K(0, 1) = /2, K(0, δ) =. Folding over the two spoke chin gives the chin with kernel Q /2 / δ Figure: K restricted to Z.
12 0 1 2 δ /2 / δ
13 Yglom limit of our exmple Define fmily σ ξ of ρ-invrint qsd s for K indexed y ξ [ 1, 1] nd given y σ ξ (0) = 1 ρ For x, y 2Z, lim n [1 + y + ξ y] σ ξ (y) = σ ξ (0) 2 K 2n (x, y) K 2n (x, 2Z) = 1 + ρ ρ σ ξ(x)(y) where where ξ(x) = x for x Z. 1 + x Notice the limit depends on x! (2) ( ) y for y Z (3) ρ 1 + ρ = σ ξ(x)(2z).
14 Definition of Periodic Yglom limits For periodic chins, define k = k(x, y) {0, 1, 2,... d 1} so tht K nd+k (x, y) > 0 for n sufficiently lrge. We cn prtition S into d sets leled S 0,..., S d 1 so tht the strting stte x S 0 nd tht K nd+k (x, y) > 0 for n sufficiently lrge if y S k. Theorem A of Vere-Jones implies tht for ny y S k, [K nd+k (x, y)] 1/(nd+k) ρ. We sy tht we hve periodic Yglom limit if for some k {0,..., d 1} P x {X nd+k = y X nd+k S} = Knd+k (x, y) K nd+k (x, S) πk x(y) (4) where π k x is proility mesure on S with π k x(s k ) = 1.
15 Asymptotics of Periodic Yglom limits Proposition If π k x is the periodic Yglom limit for some k {0, 1,..., d 1}, then there re periodic Yglom limits for ll k {0, 1,..., d 1}. Moreover, there is ρ invrint qsd π x such tht π k x(y) = π x (y)/π x (S k ) for y S k for ech k {0, 1,..., d 1}. We conclude Knd+k (x, y) K nd+k (x, S) π x(y) for ll π x (S k ) k {0, 1,..., d 1} where x S 0 y definition nd y S k.
16 Periodic rtio limits We sy tht we hve periodic rtio limit if for x, y S 0 K nd (y, S 0 ) h(y) lim n K nd = λ(x, y) = (x, S 0 ) h(x). Proposition If we hve oth periodic Yglom nd rtio limits on S 0 then for ny k, m {0, 1,..., d 1}, u S k nd y S m, K nd+d m+k (u, y)/k nd+d m+k (u, S k ) π u (y)/π u (S m ).
17 Theory pplied to our exmple Let S 0 = 2Z nd let x S 0. We check tht for y 2Z, lim n K 2n (x, y) K 2n (x, 2Z) = 1 + ρ 1 σ ξ(x)(y) where σ ξ(x) (2Z) = ρ. From Proposition 1 we then get for y 2Z 1, lim n K 2n+1 (x, y) K 2n (x, 2Z 1) = 1 + ρ ρ σ ξ(x)(y) where σ ξ(x) (2Z 1) = ρ 1 + ρ.
18 Checking the periodic Yglom limit I Assume x, y 1. Similr to the clssicl llot prolem, there re two types of pths from x to y: those tht visit 0 nd those tht do not. From the reflection principle, ny pth from x to y tht visits 0 hs corresponding pth from x to y with the sme proility of occurring. Thus, if {0} K n (x, y) denotes the proility of going from x to y without visiting zero, we hve K n (x, y) = {0} K n (x, y) + K n ( x, y) = {0} K n (x, y) + K n (x, y). From the coupling rgument, {0} K n (x, y) = P n (x, y).
19 Checking the periodic Yglom limit II For x, y 0, Q n (x, y) =K n (x, y ) := K n (x, y) + K n (x, y). Hence, K n (x, y) = K n (x, y ) K n (x, y) = K n (x, y ) (K n (x, y) {0} K n (x, y)) = 1 2 ( {0} Kn (x, y) + K n (x, y )). Similrly, K n (x, y) = 1 2 (Kn (x, y ) {0} K n (x, y)).
20 Checking the periodic Yglom limit III For x, y > 0 nd oth even, from (35) in Vere-Jones nd Senet {0} K2n (x, y) = P 2n (x, y) xy ( 2 ) ( ) x 1 ( ) y 1 2n. πn 3/2 Moreover, K 2n (x, y )) = Q 2n (x, y) + Q 2n (x, y) = P 2n (x + 1, y + 1) + P 2n (x + 1, (y + 1)) ( ) x ( ) y 1 (4) n (x + 1) (y + 1) π n 3/2.
21 Checking the periodic Yglom limit IV Let τ δ e the time to sorption for the chin X. so P x (τ δ = n) = P x+1 (τ = n) nd P x (τ δ > 2n) = v=n+1 f 2v 1 x+1,0. (5) P x (τ > 2n) (x + 1) 2 2v (2π) 1/2 (2v 1) 3/2 1 2 (2v 1 (x+1)) 1 2 (2v 1+(x+1)) v=n+1 ( ) x (x + 1) (4) n 4 (2π) 1/2 (2n) 3/2 1 4.
22 Checking the periodic Yglom limit V Hence, for x, y > 0, K 2n (x, y) P x (τ > 2n) = 1 K 2n (x, y )) + {0} K 2n (x, y) 2 P x (τ > 2n) ) ( x (y + 1) (x + 1) ( 1 xy 2 πn 3/2 (x+1) ) x (4) n ( (2π) 1/2 (2n) ( 3/2 ) 2n ( ) x/2 ( y/2 ) (x+1) (2π) 1/2 ( 1 4 ( ) x (4) n 4 (2n) 3/ y + ξy ) 2 ( ) y 1 (4) n π n 3/ ) y = (1 + ρ)σ ξ(x)(y).
23 Checking the periodic Yglom limit VI K 2n (x, y) P x (τ > 2n) = 1 (K 2n (x, y ) {0} K 2n (x, y) 2 P x (τ > 2n) ( ) y ( ) y 1 4 (y + 1) xy x ( ) y = y ξy ( ) = (1 + ρ)σ 2 ξ(x)( y). Finlly, for y = 0, K 2n (x, 0) = P 2n x+1,1 so K 2n (x, 0) P x (τ > 2n) = P 2n x+1,1 P x (τ > 2n) = 1 4 = (x + 1) (x+1) (2π) 1/2 ( = (1 + ρ)σ ξ(x) (0). ( ) x 1 (4) n π n ) 3/2 x (4) n (2n) 3/2
24 Checking the periodic Yglom limit VII Therefore strting from x even we hve periodic Yglom limit with density (1 + 2 )σ ξ ( ) on S 0 = 2Z with ξ = x/( x + 1) [0, 1]. Similrly, for x, y > 0 even, K 2n ( x, y) = K 2n (x, y) nd K 2n ( x, y) = K 2n (x, y); hence, strting from x even we get Yglom limit (1 + 2 )σ ξ ( ) on 2Z with ξ = x/( x + 1) so ξ [ 1, 0].
25 Checking the periodic rtio limit Agin tking S 0 = 2Z, K 2n (y, 2Z) K 2n (x, 2Z) = P y(τ > 2n) P x (τ > 2n) ( / ) y ( y + 1) ( / ) x = h 0(y) h ( x + 1) 0 (x) In fct h 0 is the unique ρ-hrmonic function for Q in the fmily of ρ-hrmonic functions for K h ξ (y) := [1 + y + ξy] ( ) y for y Z. (6)
26 Checking the periodic Yglom limit VIII Applying Proposition 2, strting from u odd we hve periodic Yglom limit on the evens with density (1 + 2 )σ ξ(u) ( ) on S 0 = 2Z with ξ = u/( u + 1) [0, 1]. Similrly, strting from u odd we hve periodic Yglom limit on the odds: σ ξ(u) ( )
27 Cone of ρ-invrint proilities The proilities σ ξ with ξ [ 1, 1] form cone. The extreml elements re ξ = 1 nd ξ = 1 since σ ξ (y) = 1 + ξ 2 σ 1(y) + 1 ξ 2 σ 1(y). Define the potentil G(x, y) = R n K n (x, y) nd n=0 the ρ-mrtin kernel M(y, x) = G(y, x)/g(y, 0). As mesure in x, M(y, x) B re the positive excessive mesures of R K normlized to e 1 t x = 0; i.e. µ RµK if µ B. Ech point y Z is identified with the mesure M(y, ) B, which y the Riesz decomposition theorem is extreml in B.
28 The ρ-mrtin entrnce oundry As y +, M(y, ) M(+, ) = σ 1 ( )/σ 1 (0). We conclude + is point in the Mrtin oundry of Z. We hve therefore identified + in the Mrtin oundry with the ρ-invrint mesure σ 1 ( )/σ 1 (0), which is identified with the point +1 in the topologicl oundry of { ξ = x 1 + x : x Z }. By similr rgument we see is lso in the Mrtin oundry of Z. As y +, M(y, ) M(, ) = σ 1 ( )/σ 1 (0). Agin we hve identified in the Mrtin oundry with the ρ-invrint mesure σ 1 ( )/σ 1 (0) which is identified with the point 1 in the topologicl oundry of { ξ = x 1 + x : x Z }.
29 Hrry Kesten s exmple Kesten (1995) constructed n mzing exmple of su-mrkov chin possessing most every nice property including hving ρ-invrint qsd tht fils to hve Yglom limit. Kesten s exmple hs the sme stte spce nd the sme structure s ours. The only difference is tht t ny stte x there is proility r x of holding in stte x nd proilities (1 r x ) nd (1 r x ) of moving one step closer or further from zero. If α = (1 r 0 ), then our chin is exctly Kesten s chin wtched t the times his chin chnges stte. It is pretty cler Hrry could hve derived our exmple with moment s thought, ut he focused on the non-existence of Yglom limits. His exmple is orders of mgnitude more sophisticted nd complicted thn ours.
Quadratic Forms. Quadratic Forms
Qudrtic Forms Recll the Simon & Blume excerpt from n erlier lecture which sid tht the min tsk of clculus is to pproximte nonliner functions with liner functions. It s ctully more ccurte to sy tht we pproximte
More informationIntermediate Math Circles Wednesday, November 14, 2018 Finite Automata II. Nickolas Rollick a b b. a b 4
Intermedite Mth Circles Wednesdy, Novemer 14, 2018 Finite Automt II Nickols Rollick nrollick@uwterloo.c Regulr Lnguges Lst time, we were introduced to the ide of DFA (deterministic finite utomton), one
More informationset is not closed under matrix [ multiplication, ] and does not form a group.
Prolem 2.3: Which of the following collections of 2 2 mtrices with rel entries form groups under [ mtrix ] multipliction? i) Those of the form for which c d 2 Answer: The set of such mtrices is not closed
More informationDiscrete Mathematics and Probability Theory Spring 2013 Anant Sahai Lecture 17
EECS 70 Discrete Mthemtics nd Proility Theory Spring 2013 Annt Shi Lecture 17 I.I.D. Rndom Vriles Estimting the is of coin Question: We wnt to estimte the proportion p of Democrts in the US popultion,
More informationHeavy tail and stable distributions
Hevy til nd stle distriutions J.K. Misiewicz Deprtment of Mthemtics nd Informtion Science Technicl University of Wrsw X or its distriution hs hevy til if E(X ) =. X or its distriution hs hevy til of order
More informationSurface maps into free groups
Surfce mps into free groups lden Wlker Novemer 10, 2014 Free groups wedge X of two circles: Set F = π 1 (X ) =,. We write cpitl letters for inverse, so = 1. e.g. () 1 = Commuttors Let x nd y e loops. The
More informationDiscrete Mathematics and Probability Theory Summer 2014 James Cook Note 17
CS 70 Discrete Mthemtics nd Proility Theory Summer 2014 Jmes Cook Note 17 I.I.D. Rndom Vriles Estimting the is of coin Question: We wnt to estimte the proportion p of Democrts in the US popultion, y tking
More informationp-adic Egyptian Fractions
p-adic Egyptin Frctions Contents 1 Introduction 1 2 Trditionl Egyptin Frctions nd Greedy Algorithm 2 3 Set-up 3 4 p-greedy Algorithm 5 5 p-egyptin Trditionl 10 6 Conclusion 1 Introduction An Egyptin frction
More informationChapter 14. Matrix Representations of Linear Transformations
Chpter 4 Mtrix Representtions of Liner Trnsformtions When considering the Het Stte Evolution, we found tht we could describe this process using multipliction by mtrix. This ws nice becuse computers cn
More informationMath 61CM - Solutions to homework 9
Mth 61CM - Solutions to homework 9 Cédric De Groote November 30 th, 2018 Problem 1: Recll tht the left limit of function f t point c is defined s follows: lim f(x) = l x c if for ny > 0 there exists δ
More informationCoalgebra, Lecture 15: Equations for Deterministic Automata
Colger, Lecture 15: Equtions for Deterministic Automt Julin Slmnc (nd Jurrin Rot) Decemer 19, 2016 In this lecture, we will study the concept of equtions for deterministic utomt. The notes re self contined
More informationPH12b 2010 Solutions HW#3
PH 00 Solutions HW#3. The Hmiltonin of this two level system is where E g < E e The experimentlist sis is H E g jgi hgj + E e jei hej j+i p (jgi + jei) j i p (jgi jei) ) At t 0 the stte is j (0)i j+i,
More information1 Nondeterministic Finite Automata
1 Nondeterministic Finite Automt Suppose in life, whenever you hd choice, you could try oth possiilities nd live your life. At the end, you would go ck nd choose the one tht worked out the est. Then you
More informationLecture 3. In this lecture, we will discuss algorithms for solving systems of linear equations.
Lecture 3 3 Solving liner equtions In this lecture we will discuss lgorithms for solving systems of liner equtions Multiplictive identity Let us restrict ourselves to considering squre mtrices since one
More informationFarey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University
U.U.D.M. Project Report 07:4 Frey Frctions Rickrd Fernström Exmensrete i mtemtik, 5 hp Hledre: Andres Strömergsson Exmintor: Jörgen Östensson Juni 07 Deprtment of Mthemtics Uppsl University Frey Frctions
More informationLecture 09: Myhill-Nerode Theorem
CS 373: Theory of Computtion Mdhusudn Prthsrthy Lecture 09: Myhill-Nerode Theorem 16 Ferury 2010 In this lecture, we will see tht every lnguge hs unique miniml DFA We will see this fct from two perspectives
More informationA product convergence theorem for Henstock Kurzweil integrals
A product convergence theorem for Henstock Kurzweil integrls Prsr Mohnty Erik Tlvil 1 Deprtment of Mthemticl nd Sttisticl Sciences University of Albert Edmonton AB Cnd T6G 2G1 pmohnty@mth.ulbert.c etlvil@mth.ulbert.c
More informationMath 8 Winter 2015 Applications of Integration
Mth 8 Winter 205 Applictions of Integrtion Here re few importnt pplictions of integrtion. The pplictions you my see on n exm in this course include only the Net Chnge Theorem (which is relly just the Fundmentl
More informationAdvanced Calculus: MATH 410 Uniform Convergence of Functions Professor David Levermore 11 December 2015
Advnced Clculus: MATH 410 Uniform Convergence of Functions Professor Dvid Levermore 11 December 2015 12. Sequences of Functions We now explore two notions of wht it mens for sequence of functions {f n
More informationImproper Integrals. The First Fundamental Theorem of Calculus, as we ve discussed in class, goes as follows:
Improper Integrls The First Fundmentl Theorem of Clculus, s we ve discussed in clss, goes s follows: If f is continuous on the intervl [, ] nd F is function for which F t = ft, then ftdt = F F. An integrl
More informationLecture 2e Orthogonal Complement (pages )
Lecture 2e Orthogonl Complement (pges -) We hve now seen tht n orthonorml sis is nice wy to descrie suspce, ut knowing tht we wnt n orthonorml sis doesn t mke one fll into our lp. In theory, the process
More informationLecture 2: January 27
CS 684: Algorithmic Gme Theory Spring 217 Lecturer: Év Trdos Lecture 2: Jnury 27 Scrie: Alert Julius Liu 2.1 Logistics Scrie notes must e sumitted within 24 hours of the corresponding lecture for full
More informationMore on automata. Michael George. March 24 April 7, 2014
More on utomt Michel George Mrch 24 April 7, 2014 1 Automt constructions Now tht we hve forml model of mchine, it is useful to mke some generl constructions. 1.1 DFA Union / Product construction Suppose
More informationMinimal DFA. minimal DFA for L starting from any other
Miniml DFA Among the mny DFAs ccepting the sme regulr lnguge L, there is exctly one (up to renming of sttes) which hs the smllest possile numer of sttes. Moreover, it is possile to otin tht miniml DFA
More informationI1 = I2 I1 = I2 + I3 I1 + I2 = I3 + I4 I 3
2 The Prllel Circuit Electric Circuits: Figure 2- elow show ttery nd multiple resistors rrnged in prllel. Ech resistor receives portion of the current from the ttery sed on its resistnce. The split is
More informationTHE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS.
THE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS RADON ROSBOROUGH https://intuitiveexplntionscom/picrd-lindelof-theorem/ This document is proof of the existence-uniqueness theorem
More informationThe Regulated and Riemann Integrals
Chpter 1 The Regulted nd Riemnn Integrls 1.1 Introduction We will consider severl different pproches to defining the definite integrl f(x) dx of function f(x). These definitions will ll ssign the sme vlue
More informationFormal Languages and Automata
Moile Computing nd Softwre Engineering p. 1/5 Forml Lnguges nd Automt Chpter 2 Finite Automt Chun-Ming Liu cmliu@csie.ntut.edu.tw Deprtment of Computer Science nd Informtion Engineering Ntionl Tipei University
More informationRecitation 3: More Applications of the Derivative
Mth 1c TA: Pdric Brtlett Recittion 3: More Applictions of the Derivtive Week 3 Cltech 2012 1 Rndom Question Question 1 A grph consists of the following: A set V of vertices. A set E of edges where ech
More informationBases for Vector Spaces
Bses for Vector Spces 2-26-25 A set is independent if, roughly speking, there is no redundncy in the set: You cn t uild ny vector in the set s liner comintion of the others A set spns if you cn uild everything
More informationHomework Assignment 3 Solution Set
Homework Assignment 3 Solution Set PHYCS 44 6 Ferury, 4 Prolem 1 (Griffiths.5(c The potentil due to ny continuous chrge distriution is the sum of the contriutions from ech infinitesiml chrge in the distriution.
More informationHomework 4. (1) If f R[a, b], show that f 3 R[a, b]. If f + (x) = max{f(x), 0}, is f + R[a, b]? Justify your answer.
Homework 4 (1) If f R[, b], show tht f 3 R[, b]. If f + (x) = mx{f(x), 0}, is f + R[, b]? Justify your nswer. (2) Let f be continuous function on [, b] tht is strictly positive except finitely mny points
More informationPhysics 116C Solution of inhomogeneous ordinary differential equations using Green s functions
Physics 6C Solution of inhomogeneous ordinry differentil equtions using Green s functions Peter Young November 5, 29 Homogeneous Equtions We hve studied, especilly in long HW problem, second order liner
More informationConvert the NFA into DFA
Convert the NF into F For ech NF we cn find F ccepting the sme lnguge. The numer of sttes of the F could e exponentil in the numer of sttes of the NF, ut in prctice this worst cse occurs rrely. lgorithm:
More informationLet's start with an example:
Finite Automt Let's strt with n exmple: Here you see leled circles tht re sttes, nd leled rrows tht re trnsitions. One of the sttes is mrked "strt". One of the sttes hs doule circle; this is terminl stte
More informationThings to Memorize: A Partial List. January 27, 2017
Things to Memorize: A Prtil List Jnury 27, 2017 Chpter 2 Vectors - Bsic Fcts A vector hs mgnitude (lso clled size/length/norm) nd direction. It does not hve fixed position, so the sme vector cn e moved
More informationNondeterminism and Nodeterministic Automata
Nondeterminism nd Nodeterministic Automt 61 Nondeterminism nd Nondeterministic Automt The computtionl mchine models tht we lerned in the clss re deterministic in the sense tht the next move is uniquely
More informationGrammar. Languages. Content 5/10/16. Automata and Languages. Regular Languages. Regular Languages
5//6 Grmmr Automt nd Lnguges Regulr Grmmr Context-free Grmmr Context-sensitive Grmmr Prof. Mohmed Hmd Softwre Engineering L. The University of Aizu Jpn Regulr Lnguges Context Free Lnguges Context Sensitive
More informationChapter 0. What is the Lebesgue integral about?
Chpter 0. Wht is the Lebesgue integrl bout? The pln is to hve tutoril sheet ech week, most often on Fridy, (to be done during the clss) where you will try to get used to the ides introduced in the previous
More informationTheoretical foundations of Gaussian quadrature
Theoreticl foundtions of Gussin qudrture 1 Inner product vector spce Definition 1. A vector spce (or liner spce) is set V = {u, v, w,...} in which the following two opertions re defined: (A) Addition of
More informationConverting Regular Expressions to Discrete Finite Automata: A Tutorial
Converting Regulr Expressions to Discrete Finite Automt: A Tutoril Dvid Christinsen 2013-01-03 This is tutoril on how to convert regulr expressions to nondeterministic finite utomt (NFA) nd how to convert
More informationName Solutions to Test 3 November 8, 2017
Nme Solutions to Test 3 November 8, 07 This test consists of three prts. Plese note tht in prts II nd III, you cn skip one question of those offered. Some possibly useful formuls cn be found below. Brrier
More informationCS103B Handout 18 Winter 2007 February 28, 2007 Finite Automata
CS103B ndout 18 Winter 2007 Ferury 28, 2007 Finite Automt Initil text y Mggie Johnson. Introduction Severl childrens gmes fit the following description: Pieces re set up on plying ord; dice re thrown or
More informationRiemann is the Mann! (But Lebesgue may besgue to differ.)
Riemnn is the Mnn! (But Lebesgue my besgue to differ.) Leo Livshits My 2, 2008 1 For finite intervls in R We hve seen in clss tht every continuous function f : [, b] R hs the property tht for every ɛ >
More informationn f(x i ) x. i=1 In section 4.2, we defined the definite integral of f from x = a to x = b as n f(x i ) x; f(x) dx = lim i=1
The Fundmentl Theorem of Clculus As we continue to study the re problem, let s think bck to wht we know bout computing res of regions enclosed by curves. If we wnt to find the re of the region below the
More informationChapter Five: Nondeterministic Finite Automata. Formal Language, chapter 5, slide 1
Chpter Five: Nondeterministic Finite Automt Forml Lnguge, chpter 5, slide 1 1 A DFA hs exctly one trnsition from every stte on every symol in the lphet. By relxing this requirement we get relted ut more
More informationCS 301. Lecture 04 Regular Expressions. Stephen Checkoway. January 29, 2018
CS 301 Lecture 04 Regulr Expressions Stephen Checkowy Jnury 29, 2018 1 / 35 Review from lst time NFA N = (Q, Σ, δ, q 0, F ) where δ Q Σ P (Q) mps stte nd n lphet symol (or ) to set of sttes We run n NFA
More informationHow do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique?
XII. LINEAR ALGEBRA: SOLVING SYSTEMS OF EQUATIONS Tody we re going to tlk out solving systems of liner equtions. These re prolems tht give couple of equtions with couple of unknowns, like: 6= x + x 7=
More informationHomework 3 Solutions
CS 341: Foundtions of Computer Science II Prof. Mrvin Nkym Homework 3 Solutions 1. Give NFAs with the specified numer of sttes recognizing ech of the following lnguges. In ll cses, the lphet is Σ = {,1}.
More informationOrthogonal Polynomials
Mth 4401 Gussin Qudrture Pge 1 Orthogonl Polynomils Orthogonl polynomils rise from series solutions to differentil equtions, lthough they cn be rrived t in vriety of different mnners. Orthogonl polynomils
More informationParse trees, ambiguity, and Chomsky normal form
Prse trees, miguity, nd Chomsky norml form In this lecture we will discuss few importnt notions connected with contextfree grmmrs, including prse trees, miguity, nd specil form for context-free grmmrs
More information7.2 The Definite Integral
7.2 The Definite Integrl the definite integrl In the previous section, it ws found tht if function f is continuous nd nonnegtive, then the re under the grph of f on [, b] is given by F (b) F (), where
More informationa n = 1 58 a n+1 1 = 57a n + 1 a n = 56(a n 1) 57 so 0 a n+1 1, and the required result is true, by induction.
MAS221(216-17) Exm Solutions 1. (i) A is () bounded bove if there exists K R so tht K for ll A ; (b) it is bounded below if there exists L R so tht L for ll A. e.g. the set { n; n N} is bounded bove (by
More informationEnergy Bands Energy Bands and Band Gap. Phys463.nb Phenomenon
Phys463.nb 49 7 Energy Bnds Ref: textbook, Chpter 7 Q: Why re there insultors nd conductors? Q: Wht will hppen when n electron moves in crystl? In the previous chpter, we discussed free electron gses,
More informationCS 373, Spring Solutions to Mock midterm 1 (Based on first midterm in CS 273, Fall 2008.)
CS 373, Spring 29. Solutions to Mock midterm (sed on first midterm in CS 273, Fll 28.) Prolem : Short nswer (8 points) The nswers to these prolems should e short nd not complicted. () If n NF M ccepts
More information4.1. Probability Density Functions
STT 1 4.1-4. 4.1. Proility Density Functions Ojectives. Continuous rndom vrile - vers - discrete rndom vrile. Proility density function. Uniform distriution nd its properties. Expected vlue nd vrince of
More informationFirst Midterm Examination
Çnky University Deprtment of Computer Engineering 203-204 Fll Semester First Midterm Exmintion ) Design DFA for ll strings over the lphet Σ = {,, c} in which there is no, no nd no cc. 2) Wht lnguge does
More informationCMSC 330: Organization of Programming Languages
CMSC 330: Orgniztion of Progrmming Lnguges Finite Automt 2 CMSC 330 1 Types of Finite Automt Deterministic Finite Automt (DFA) Exctly one sequence of steps for ech string All exmples so fr Nondeterministic
More informationReview of Riemann Integral
1 Review of Riemnn Integrl In this chpter we review the definition of Riemnn integrl of bounded function f : [, b] R, nd point out its limittions so s to be convinced of the necessity of more generl integrl.
More informationLecture 3: Equivalence Relations
Mthcmp Crsh Course Instructor: Pdric Brtlett Lecture 3: Equivlence Reltions Week 1 Mthcmp 2014 In our lst three tlks of this clss, we shift the focus of our tlks from proof techniques to proof concepts
More informationRiemann Sums and Riemann Integrals
Riemnn Sums nd Riemnn Integrls Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University August 26, 2013 Outline 1 Riemnn Sums 2 Riemnn Integrls 3 Properties
More informationTypes of Finite Automata. CMSC 330: Organization of Programming Languages. Comparing DFAs and NFAs. NFA for (a b)*abb.
CMSC 330: Orgniztion of Progrmming Lnguges Finite Automt 2 Types of Finite Automt Deterministic Finite Automt () Exctly one sequence of steps for ech string All exmples so fr Nondeterministic Finite Automt
More informationImproper Integrals, and Differential Equations
Improper Integrls, nd Differentil Equtions October 22, 204 5.3 Improper Integrls Previously, we discussed how integrls correspond to res. More specificlly, we sid tht for function f(x), the region creted
More informationDEFINITION The inner product of two functions f 1 and f 2 on an interval [a, b] is the number. ( f 1, f 2 ) b DEFINITION 11.1.
398 CHAPTER 11 ORTHOGONAL FUNCTIONS AND FOURIER SERIES 11.1 ORTHOGONAL FUNCTIONS REVIEW MATERIAL The notions of generlized vectors nd vector spces cn e found in ny liner lger text. INTRODUCTION The concepts
More informationAbstract inner product spaces
WEEK 4 Abstrct inner product spces Definition An inner product spce is vector spce V over the rel field R equipped with rule for multiplying vectors, such tht the product of two vectors is sclr, nd the
More informationState space systems analysis (continued) Stability. A. Definitions A system is said to be Asymptotically Stable (AS) when it satisfies
Stte spce systems nlysis (continued) Stbility A. Definitions A system is sid to be Asymptoticlly Stble (AS) when it stisfies ut () = 0, t > 0 lim xt () 0. t A system is AS if nd only if the impulse response
More information378 Relations Solutions for Chapter 16. Section 16.1 Exercises. 3. Let A = {0,1,2,3,4,5}. Write out the relation R that expresses on A.
378 Reltions 16.7 Solutions for Chpter 16 Section 16.1 Exercises 1. Let A = {0,1,2,3,4,5}. Write out the reltion R tht expresses > on A. Then illustrte it with digrm. 2 1 R = { (5,4),(5,3),(5,2),(5,1),(5,0),(4,3),(4,2),(4,1),
More informationAppendix to Notes 8 (a)
Appendix to Notes 8 () 13 Comprison of the Riemnn nd Lebesgue integrls. Recll Let f : [, b] R be bounded. Let D be prtition of [, b] such tht Let D = { = x 0 < x 1
More information4 7x =250; 5 3x =500; Read section 3.3, 3.4 Announcements: Bell Ringer: Use your calculator to solve
Dte: 3/14/13 Objective: SWBAT pply properties of exponentil functions nd will pply properties of rithms. Bell Ringer: Use your clcultor to solve 4 7x =250; 5 3x =500; HW Requests: Properties of Log Equtions
More informationWaveguide Guide: A and V. Ross L. Spencer
Wveguide Guide: A nd V Ross L. Spencer I relly think tht wveguide fields re esier to understnd using the potentils A nd V thn they re using the electric nd mgnetic fields. Since Griffiths doesn t do it
More informationRiemann Sums and Riemann Integrals
Riemnn Sums nd Riemnn Integrls Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University August 26, 203 Outline Riemnn Sums Riemnn Integrls Properties Abstrct
More informationdt. However, we might also be curious about dy
Section 0. The Clculus of Prmetric Curves Even though curve defined prmetricly my not be function, we cn still consider concepts such s rtes of chnge. However, the concepts will need specil tretment. For
More informationDISCRETE MATHEMATICS HOMEWORK 3 SOLUTIONS
DISCRETE MATHEMATICS 21228 HOMEWORK 3 SOLUTIONS JC Due in clss Wednesdy September 17. You my collborte but must write up your solutions by yourself. Lte homework will not be ccepted. Homework must either
More informationFinite Automata. Informatics 2A: Lecture 3. Mary Cryan. 21 September School of Informatics University of Edinburgh
Finite Automt Informtics 2A: Lecture 3 Mry Cryn School of Informtics University of Edinburgh mcryn@inf.ed.c.uk 21 September 2018 1 / 30 Lnguges nd Automt Wht is lnguge? Finite utomt: recp Some forml definitions
More informationConvex Sets and Functions
B Convex Sets nd Functions Definition B1 Let L, +, ) be rel liner spce nd let C be subset of L The set C is convex if, for ll x,y C nd ll [, 1], we hve 1 )x+y C In other words, every point on the line
More information8 Laplace s Method and Local Limit Theorems
8 Lplce s Method nd Locl Limit Theorems 8. Fourier Anlysis in Higher DImensions Most of the theorems of Fourier nlysis tht we hve proved hve nturl generliztions to higher dimensions, nd these cn be proved
More informationDefinite Integrals. The area under a curve can be approximated by adding up the areas of rectangles = 1 1 +
Definite Integrls --5 The re under curve cn e pproximted y dding up the res of rectngles. Exmple. Approximte the re under y = from x = to x = using equl suintervls nd + x evluting the function t the left-hnd
More informationThe Banach algebra of functions of bounded variation and the pointwise Helly selection theorem
The Bnch lgebr of functions of bounded vrition nd the pointwise Helly selection theorem Jordn Bell jordn.bell@gmil.com Deprtment of Mthemtics, University of Toronto Jnury, 015 1 BV [, b] Let < b. For f
More information1. For each of the following theorems, give a two or three sentence sketch of how the proof goes or why it is not true.
York University CSE 2 Unit 3. DFA Clsses Converting etween DFA, NFA, Regulr Expressions, nd Extended Regulr Expressions Instructor: Jeff Edmonds Don t chet y looking t these nswers premturely.. For ech
More information10. AREAS BETWEEN CURVES
. AREAS BETWEEN CURVES.. Ares etween curves So res ove the x-xis re positive nd res elow re negtive, right? Wrong! We lied! Well, when you first lern out integrtion it s convenient fiction tht s true in
More informationA REVIEW OF CALCULUS CONCEPTS FOR JDEP 384H. Thomas Shores Department of Mathematics University of Nebraska Spring 2007
A REVIEW OF CALCULUS CONCEPTS FOR JDEP 384H Thoms Shores Deprtment of Mthemtics University of Nebrsk Spring 2007 Contents Rtes of Chnge nd Derivtives 1 Dierentils 4 Are nd Integrls 5 Multivrite Clculus
More informationBayesian Networks: Approximate Inference
pproches to inference yesin Networks: pproximte Inference xct inference Vrillimintion Join tree lgorithm pproximte inference Simplify the structure of the network to mkxct inferencfficient (vritionl methods,
More information7. Indefinite Integrals
7. Indefinite Integrls These lecture notes present my interprettion of Ruth Lwrence s lecture notes (in Herew) 7. Prolem sttement By the fundmentl theorem of clculus, to clculte n integrl we need to find
More informationTypes of Finite Automata. CMSC 330: Organization of Programming Languages. Comparing DFAs and NFAs. Comparing DFAs and NFAs (cont.) Finite Automata 2
CMSC 330: Orgniztion of Progrmming Lnguges Finite Automt 2 Types of Finite Automt Deterministic Finite Automt () Exctly one sequence of steps for ech string All exmples so fr Nondeterministic Finite Automt
More information1.9 C 2 inner variations
46 CHAPTER 1. INDIRECT METHODS 1.9 C 2 inner vritions So fr, we hve restricted ttention to liner vritions. These re vritions of the form vx; ǫ = ux + ǫφx where φ is in some liner perturbtion clss P, for
More informationUNIFORM CONVERGENCE. Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3
UNIFORM CONVERGENCE Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3 Suppose f n : Ω R or f n : Ω C is sequence of rel or complex functions, nd f n f s n in some sense. Furthermore,
More informationCM10196 Topic 4: Functions and Relations
CM096 Topic 4: Functions nd Reltions Guy McCusker W. Functions nd reltions Perhps the most widely used notion in ll of mthemtics is tht of function. Informlly, function is n opertion which tkes n input
More informationMATH34032: Green s Functions, Integral Equations and the Calculus of Variations 1
MATH34032: Green s Functions, Integrl Equtions nd the Clculus of Vritions 1 Section 1 Function spces nd opertors Here we gives some brief detils nd definitions, prticulrly relting to opertors. For further
More informationLecture 3: Curves in Calculus. Table of contents
Mth 348 Fll 7 Lecture 3: Curves in Clculus Disclimer. As we hve textook, this lecture note is for guidnce nd supplement only. It should not e relied on when prepring for exms. In this lecture we set up
More informationSection 6: Area, Volume, and Average Value
Chpter The Integrl Applied Clculus Section 6: Are, Volume, nd Averge Vlue Are We hve lredy used integrls to find the re etween the grph of function nd the horizontl xis. Integrls cn lso e used to find
More information1 From NFA to regular expression
Note 1: How to convert DFA/NFA to regulr expression Version: 1.0 S/EE 374, Fll 2017 Septemer 11, 2017 In this note, we show tht ny DFA cn e converted into regulr expression. Our construction would work
More informationRead section 3.3, 3.4 Announcements:
Dte: 3/1/13 Objective: SWBAT pply properties of exponentil functions nd will pply properties of rithms. Bell Ringer: 1. f x = 3x 6, find the inverse, f 1 x., Using your grphing clcultor, Grph 1. f x,f
More informationPositive Solutions of Operator Equations on Half-Line
Int. Journl of Mth. Anlysis, Vol. 3, 29, no. 5, 211-22 Positive Solutions of Opertor Equtions on Hlf-Line Bohe Wng 1 School of Mthemtics Shndong Administrtion Institute Jinn, 2514, P.R. Chin sdusuh@163.com
More informationDescribe in words how you interpret this quantity. Precisely what information do you get from x?
WAVE FUNCTIONS AND PROBABILITY 1 I: Thinking out the wve function In quntum mechnics, the term wve function usully refers to solution to the Schrödinger eqution, Ψ(x, t) i = 2 2 Ψ(x, t) + V (x)ψ(x, t),
More informationReversals of Signal-Posterior Monotonicity for Any Bounded Prior
Reversls of Signl-Posterior Monotonicity for Any Bounded Prior Christopher P. Chmbers Pul J. Hely Abstrct Pul Milgrom (The Bell Journl of Economics, 12(2): 380 391) showed tht if the strict monotone likelihood
More informationContinuous Random Variables
CPSC 53 Systems Modeling nd Simultion Continuous Rndom Vriles Dr. Anirn Mhnti Deprtment of Computer Science University of Clgry mhnti@cpsc.uclgry.c Definitions A rndom vrile is sid to e continuous if there
More informationHow do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique?
XII. LINEAR ALGEBRA: SOLVING SYSTEMS OF EQUATIONS Tody we re going to tlk bout solving systems of liner equtions. These re problems tht give couple of equtions with couple of unknowns, like: 6 2 3 7 4
More informationCS667 Lecture 6: Monte Carlo Integration 02/10/05
CS667 Lecture 6: Monte Crlo Integrtion 02/10/05 Venkt Krishnrj Lecturer: Steve Mrschner 1 Ide The min ide of Monte Crlo Integrtion is tht we cn estimte the vlue of n integrl by looking t lrge number of
More information63. Representation of functions as power series Consider a power series. ( 1) n x 2n for all 1 < x < 1
3 9. SEQUENCES AND SERIES 63. Representtion of functions s power series Consider power series x 2 + x 4 x 6 + x 8 + = ( ) n x 2n It is geometric series with q = x 2 nd therefore it converges for ll q =
More information10 Vector Integral Calculus
Vector Integrl lculus Vector integrl clculus extends integrls s known from clculus to integrls over curves ("line integrls"), surfces ("surfce integrls") nd solids ("volume integrls"). These integrls hve
More information