Pathwise description of dynamic pitchfork bifurcations with additive noise

Size: px
Start display at page:

Download "Pathwise description of dynamic pitchfork bifurcations with additive noise"

Transcription

1 Pahwie decripion of dynamic pichfork bifurcaion wih addiive noie Nil Berglund and Barbara Genz Abrac The low drif (wih peed ) of a parameer hrough a pichfork bifurcaion poin, known a he dynamic pichfork bifurcaion, i characerized by a ignifican delay of he raniion from he unable o he able ae. We decribe he effec of an addiive noie, of ineniy σ, by giving precie eimae on he behaviour of he individual pah. We how ha unil ime afer he bifurcaion, he pah are concenraed in a region of ize σ/ /4 around he bifurcaing equilibrium. Wih high probabiliy, hey leave a neighbourhood of hi equilibrium during a ime inerval [, c log σ ], afer which hey are likely o ay cloe o he correponding deerminiic oluion. We derive exponenially mall upper bound for he probabiliy of he e of excepional pah, wih explici value for he exponen. Dae. Augu 4, 2. Revied. April 9, 2. 2 Mahemaic Subjec Claificaion. 37H2, 6H (primary), 34E5, 93E3 (econdary). Keyword and phrae. Dynamic bifurcaion, pichfork bifurcaion, addiive noie, bifurcaion delay, ingular perurbaion, ochaic differenial equaion, dynamical yem, pahwie decripion, concenraion of meaure. Inroducion Phyical yem are ofen decribed by ordinary differenial equaion (ODE) of he form dx d = f(x, λ), (.) where x i he ae of he yem, λ a parameer, and denoe ime. The model (.) may however be oo crude, ince i neglec all kind of perurbaion acing on he yem. We are inereed here in he combined effec of wo perurbaion: a low drif of he parameer, and an addiive noie. A lowly drifing parameer λ =, (wih ), may model he deerminiic change in ime of ome exerior influence, uch a he climae acing on an ecoyem or a magneic field acing on a ferromagne. Obviouly, nonrivial dynamic can only be expeced when λ i allowed o vary by an amoun of order, and hu he yem ha o be conidered on he ime cale. Thi i uually done by inroducing he low ime =, which ranform (.) ino he ingularly perurbed equaion dx d = f(x, ). (.2) I i known ha oluion of hi yem end o ay cloe o able equilibrium branche of f [Gr, Ti], ee Fig. a. New, and omeime urpriing phenomena occur when uch an

2 µ µ Ü Øµ Ü Ø Ø Ü Ø Ø Ü Øµ Ü Øµ Figure. Soluion of he lowly ime-dependen equaion (.2) repreened in he (, x)- plane. (a) Sable cae: A able equilibrium branch x () arac nearby oluion x de. Two oluion wih differen iniial condiion are hown. They converge exponenially fa o each oher, a well a o a neighbourhood of order of x (). (b) Pichfork bifurcaion: The able equilibrium x = become unable a = (broken line) and expel wo able equilibrium branche ±x (). A oluion x de i hown, which i araced by x =, and ay cloe o he origin for a finie ime afer he bifurcaion. Thi phenomenon i known a bifurcaion delay. ÙÖ ½º Æ Ð Ö ÐÙÒ Ò Ö Ö ÒØÞ ÝÒ Ñ Ô Ø ÓÖ ÙÖ Ø ÓÒ Û Ø Ø Ú ÒÓ equilibrium branch undergoe a bifurcaion. Thee phenomena are uually called dynamic bifurcaion [Ben]. In he cae of he Hopf bifurcaion, when he equilibrium ge unable while expelling a able periodic orbi, he bifurcaion i ubanially delayed: oluion of (.2) rack he unable equilibrium (for a non-vanihing ime inerval in he limi ) before jumping o he limi cycle [Sh, Ne]. A imilar phenomenon exi for he dynamic pichfork bifurcaion of an equilibrium wihou drif, he imple example being f(x, ) = x x 3 (Fig. b). The delay ha been oberved experimenally, for inance, in laer [ME] and in a damped roaing pendulum [BK]. Thee phenomena have he advanage of providing a genuinely dynamic poin of view for he concep of a bifurcaion. Alhough one ofen ay ha a bifurcaion diagram (repreening he aympoic ae of he yem a a funcion of he parameer) i obained by varying he conrol parameer λ, he impaien experimenali aking hi lierally may have he urprie o dicover unable aionary ae of he yem ()he inveigae. The aympoic ae of he yem (.) wih lowly varying parameer λ() = λ() may depend no only on he iniial condiion (x, ½ ), bu alo on he hiory of variaion of he parameer λ()}. The perurbaion of (.) by addiive noie can be modeled by a ochaic differenial equaion (SDE) of he form dx = f(x, λ) d + σ dw, (.3) where W denoe he andard Wiener proce, and σ meaure he noie ineniy. A widepread approach i o analye he probabiliy deniy of x, which aifie he Fokker Planck equaion. In paricular, if f can be wrien a he gradien of a poenial funcion F, hen here i a unique aionary deniy p(x, λ) = e F (x,λ)/σ2 /N, where N i he normalizaion. Thi formula how ha for mall noie ineniy, he aionary deniy i harply peaked around able equilibria of f. Unforunaely, he erm dynamical bifurcaion i ued in a differen ene in he conex of random dynamical yem, namely o decribe a bifurcaion of he family of invarian meaure a oppoed o a phenomenological bifurcaion, ee for inance [Ar]. 2

3 Tha mehod ha, however, wo major limiaion. The fir one i ha he Fokker Planck equaion i difficul o olve, excep in he linear and in he gradien cae. The econd limiaion i more eriou: he deniy give no informaion on correlaion in ime, and even when he deniy i rongly localized, individual pah can perform large excurion. Thi i why oher approache are imporan. A claical one i baed on he compuaion of fir exi ime from he neighbourhood of able equilibria [FW, FJ]. The effec of bifurcaion ha been udied more recenly by mehod baed on he concep of random aracor [CF94, Schm, Ar]. In paricular, Crauel and Flandoli howed ha according o heir definiion, Addiive noie deroy a pichfork bifurcaion [CF98]. The phyical inerpreaion of random aracor i, however, no raighforward, and alernaive characerizaion of ochaic bifurcaion are deirable. In he ame way a lowly varying parameer help our underanding of bifurcaion in he deerminiic cae, i can provide a new poin of view in he cae of random dynamical yem. Le u conider he combined effec of a lowly drifing parameer and addiive noie on he ODE (.). We will focu on he cae of a pichfork bifurcaion, where he queion How doe he addiive noie affec he bifurcaion delay? and Where doe he pah go afer croing he bifurcaion poin? are of major phyical inere. The iuaion of he drif erm f in (.3) depending explicily on ime i coniderably more difficul han he auonomou cae, and hu much le underood. One can expec, however, ha a low ime dependence make he problem acceible o perurbaion heory, and ha one may ake advanage of echnique developed o udy ingularly perurbed equaion uch a (.2). Wih λ =, Equaion (.3) become dx = f(x, ) d + σ dw. (.4) If we inroduce again he low ime =, he Brownian moion i recaled, reuling in he SDE dx = f(x, ) d + σ dw. (.5) Our analyi of (.5) i rericed o one-dimenional x. The noie ineniy σ hould be conidered a a funcion of. Indeed, ince we now conider he equaion on he ime cale, a conan noie ineniy would lead o an infinie preading of rajecorie a. In he cae of he pichfork bifurcaion, we will need o aume ha σ. Variou paricular cae of equaion (.5) have been udied before, from a mahemaically non-rigorou poin of view. In he linear cae f(x, λ) = λx, he diribuion of fir exi ime wa inveigaed and compared wih experimen in [TM, SMC, SHA], while [JL] derived a formula for he la croing of zero. In he cae f(x, λ) = λx x 3, [Ga] udied he dependence of he delay on and σ numerically, while [Ku] conidered he aociaed Fokker Planck equaion, he oluion of which he approximaed by a Gauian anaz. In he preen work, we analye (.5) for a general cla of odd funcion f(x, λ) undergoing a pichfork bifurcaion. We ue a differen approach, baed on a precie conrol of he whole pah x } of he proce. The reul hu conain much more informaion han he probabiliy deniy. I alo urn ou ha he echnique we ue allow o deal wih nonlineariie in quie a naural way. Our reul can be ummarized in he following way (ee Fig. 2): Soluion of he deerminiic equaion (.2) aring near a able equilibrium branch of f are known o reach a neighbourhood of order of ha branch in a ime of order log. We how ha he pah of he SDE (.5) wih he ame iniial condiion 3

4 Ü µ Ü Ø Ø Ü Øµ Ü Øµ µ Ü Ø Ø ¼ Ô Ø Figure 2. A ypical pah x of he ochaic differenial equaion (.5) near a pichfork bifurcaion. We prove ha wih probabiliy exponenially cloe o, he pah ha he following behaviour. For, i ay in a rip B(h) conruced around he deerminiic oluion wih he ame iniial condiion. Afer =, i leave he domain D a a random ime τ = τ D, which i ypically of he order log σ. Then i ay (up o ime of order a lea) in a rip A τ (h) conruced around he deerminiic oluion x de,τ aring a ime τ on he boundary of D. The widh of B(h) and A τ (h) are proporional o a parameer h aifying σ h. ÙÖ ¾º Æ Ð Ö ÐÙÒ Ò Ö Ö ÒØÞ ÝÒ Ñ Ô Ø ÓÖ ÙÖ Ø ÓÒ Û Ø Ø Ú ÒÓ are ypically concenraed in a neighbourhood of order σ of he deerminiic oluion (Theorem 2.4). A paricular oluion of he deerminiic equaion (.2) i known o exi in a neighbourhood of order of each unable equilibrium branch of f. Pah ha ar in a neighbourhood of order σ of hi oluion are likely o leave ha neighbourhood in a ime of order log (Theorem 2.6). When a pichfork bifurcaion occur a x =, =, he ypical pah are concenraed in a neighbourhood of order σ/ /4 of he deerminiic oluion wih he ame iniial condiion up o ime (Theorem 2.). Afer he bifurcaion poin, he pah are likely o leave a neighbourhood of order of he unable equilibrium before a ime of order log σ (Theorem 2.). ½ Once hey have lef hi neighbourhood, he pah remain wih high probabiliy in a region of ize σ/ around he correponding deerminiic oluion, which approache a able equilibrium branch of f like / 3/2 (Theorem 2.2). Thee reul how ha he bifurcaion delay, which i oberved in he dynamical yem (.2), i deroyed by addiive noie a oon a he noie i no exponenially mall. Do hey mean ha he dynamic bifurcaion ielf i deroyed by addiive noie? Thi i mainly a maer of definiion. On he one hand, we will ee ha independenly of he iniial condiion, he probabiliy of reaching he upper, raher han he lower branch emerging from he bifurcaion poin, i cloe o 2. The aympoic ae i hu eleced by he noie, and no by he iniial condiion. Hence, he bifurcaion i deroyed in he ene of [CF98]. On he oher hand, individual pah are concenraed near he able 4

5 equilibrium branche of f, which mean ha he bifurcaion diagram will be made viible by he noie, much more o han in he deerminiic cae. So we do oberve a qualiaive change in behaviour when λ change i ign, which can be conidered a a bifurcaion. The precie aemen and a dicuion of heir conequence are given in Secion 2. In Secion 2.2, we analye he moion near equilibrium branche away from bifurcaion poin. The acual pichfork bifurcaion i dicued in Secion 2.3. A few conequence are derived in Secion 2.4. Secion 3 conain he proof of he fir wo heorem on he moion near nonbifurcaing equilibria, while he proof of he la hree heorem on he pichfork bifurcaion are given in Secion 4. Acknowledgemen: I a grea pleaure o hank Anon Bovier for haring our enhuiam. We enjoyed lively dicuion and hi conan inere in he progre of our work. The cenral idea were developed during muual vii in Berlin rep. Alana. N. B. hank he WIAS and B. G. hank Turgay Uzer and he School of Phyic a Georgia Tech for heir kind hopialiy. N. B. wa parially uppored by he Fond Naional Suie de la Recherche Scienifique, and by he Nonlinear Conrol Nework of he European Communiy, Gran ERB FMRXCT Saemen of reul 2. Preliminarie We conider nonlinear SDE of he form dx = f(x, ) d + σ dw, x = x, (2.) where W } i a andard Wiener proce on ome probabiliy pace (Ω, F, P). Iniial condiion x are alway aumed o be quare-inegrable wih repec o P and independen of W }. All ochaic inegral are conidered a Iô inegral, bu noe ha Iô and Sraonovich inegral agree for inegrand depending only on ime and ω. Wihou furher menioning we alway aume ha f aifie he uual (local) Lipchiz and bounded-growh condiion which guaranee exience and (pahwie) uniquene of a (rong) oluion x } of (2.). Under hee condiion, here exi a coninuou verion of x }. Therefore we may aume ha he pah ω x (ω) are coninuou for P-almo all ω Ω. We inroduce he noaion P,x for he law of he proce x }, aring in x a ime, and ue E,x o denoe expecaion wih repec o P,x. Noe ha he ochaic proce x } i an (inhomogeneou) Markov proce. We are inereed in fir exi ime of x from pace ime e. Le A R [, ] be Borel-meaurable. Auming ha A conain (x, ), we define he fir exi ime of (x, ) from A by τ A = inf [, ]: (x, ) A }, (2.2) and agree o e τ A (ω) = for hoe ω Ω which aify (x (ω), ) A for all [, ]. For convenience, we hall call τ A he fir exi ime of x from A. Typically, we will conider e of he form A = (x, ) R [, ]: g () < x < g 2 ()} wih coninuou 5

6 funcion g < g 2. Noe ha in hi cae, τ A i a opping ime 2 wih repec o he canonical filraion of (Ω, F, P) generaed by x }. Before urning o he precie aemen of our reul, le u inroduce ome noaion. We hall ue y for y o denoe he malle ineger which i greaer han or equal o y, and y z and y z o denoe he maximum or minimum, repecively, of wo real number y and z. By g(u) = O(u) we indicae ha here exi δ > and K > uch ha g(u) Ku for all u [, δ], where δ and K of coure do no depend on or σ. Similarly, g(u) = O(u) i o be underood a lim u g(u)/u =. From ime o ime, we wrie g(u) = OT () a a horhand for lim T up u T g(u) =. Finally, le u poin ou ha mo eimae hold for mall enough only, and ofen only for P-almo all ω Ω. We will re hee fac only when confuion migh arie. 2.2 Nonbifurcaing equilibria We ar by conidering he nonlinear SDE (2.) in he cae of f admiing a nonbifurcaing equilibrium branch. We will make he following aumpion. Aumpion 2.. There exi an inerval I = [, T ] or [, ) and a conan d > uch ha he following properie hold: here exi a funcion x : I R, called equilibrium branch, uch ha f(x (), ) = I; (2.3) f i wice coninuouly differeniable wih repec o x and for x x () d and I, wih uniformly bounded derivaive. In paricular, here exi a conan M > uch ha xx f(x, ) 2M in ha domain; he linearizaion of f a x (), defined a a() = x f(x (), ), (2.4) i bounded away from zero, ha i, here exi a conan a > uch ha a() a I. (2.5) We need no addiional aumpion on σ in hi ecion. However, he reul are only of inere for σ = O(). In he deerminiic cae σ =, he following reul i known (ee Fig. a): Theorem 2.2 (Deerminiic cae [Ti, Gr]). Conider he equaion dx d = f(x, ). (2.6) There are conan, c, c >, depending only on f, uch ha for <, (2.6) admi a paricular oluion x de uch ha x de x () c I; (2.7) 2 For a general Borel-meaurable e A, he fir exi ime τ A i ill a opping ime wih repec o he canonical filraion, compleed by he null e. 6

7 if x x () c and a() a for all I (ha i, when x () i a able equilibrium branch), hen he oluion x de of (2.6) wih iniial condiion x de = x aifie x de x de x x de e a /2 I. (2.8) Remark 2.3. The paricular oluion x de i ofen called low oluion or adiabaic oluion of Equaion (2.6). I i no unique in general, a uggeed by (2.8). We reurn now o he SDE (2.) wih σ >. Le u fir conider he able cae, ha i, we aume ha a() a < for all I. We aume ha a =, x ar a ome (deerminiic) x ufficienly cloe o x (). Theorem 2.2 how ha he deerminiic oluion x de of x () exponenially fa. wih he ame iniial condiion x de = x reache a neighbourhood of order We are inereed in he ochaic proce y = x x de due o noie from he deerminiic oluion x de dy = [ f(x de, which decribe he deviaion. I obey he SDE + y, ) f(x de, ) ] d + σ dw, y =. (2.9) We will prove ha y remain in a neighbourhood of wih high probabiliy. I i inrucive o conider fir he linearizaion of (2.9) around y =, which ha he form where dy = ā()y d + σ dw, (2.) ā() = x f(x de, ) = a() + O() + O ( x x () e a /2 ). (2.) Taking and x x () ufficienly mall, we may aume ha ā() i negaive and bounded away from zero. The oluion of (2.) wih arbirary iniial condiion y i given by y = y e α()/ + σ e α(,)/ dw, α(, ) = ā(u) du, (2.2) where we wrie α(, ) = α() for breviy. Noe ha α(, ) con( ) whenever. If y ha variance v, hen y ha variance v() = v e 2α()/ + σ2 e 2α(,)/ d. (2.3) Since he fir erm decreae exponenially fa, he iniial variance v i forgoen a oon a e 2α()/ i mall enough, which happen already for > O( log ). For y =, (2.2) implie in paricular ha for any δ >, P, y δ } e δ2 /2v(), (2.4) and hu he probabiliy of finding y, a any given I, ouide a rip of widh much larger han 2v() i very mall. Our fir main reul ae ha he whole pah x } of he oluion of he nonlinear equaion (2.) lie wih high probabiliy in a imilar rip, cenred around x de. We only need o make one conceion: he widh of he rip ha o be bounded away from zero. Therefore, we define he rip a B (h) = (x, ) R I : x x de < h ζ() }, (2.5) 7

8 where ζ() = 2 ā() e2α()/ + e 2α(,)/ d. (2.6) Here σ 2 ζ() can be inerpreed a he variance (2.3) a ime of he proce (2.2) aring wih iniial variance v = σ 2 /(2 ā() ). We hall how in Lemma 3. ha ζ() = 2 a() + O() + O( x x () e a /2 ). (2.7) Le τ B(h) denoe he fir exi ime of x from B (h). Theorem 2.4 (Sable cae). There exi, d and h, depending only on f, uch ha for <, h h and x x () d, where P,x τ B(h) < } C(, ) exp 2 h 2 σ 2 [ O() O(h) ] }, (2.8) C(, ) = α() 2 + 2, (2.9) and O() and O(h) do no depend on. The proof, given in Secion 3., i divided ino wo main ep. Fir, we how ha an eimae of he form (2.8), bu wihou he erm O(h), hold for he oluion of he linearized equaion (2.). Then we how ha whenever y < h ζ() for, he bound y < h( + O(h)) ζ() almo urely hold for. Remark 2.5. The reul of he preceding heorem remain rue when /2 ā() in he definiion (2.6) of ζ() i replaced be an arbirary ζ, provided ζ >. The erm O( ) may hen depend on ζ. Noe ha ζ() and v()/σ 2 are boh oluion of he ame differenial equaion z = 2ā()z +, wih poibly differen iniial condiion. If x x () = O(), ζ() i an adiabaic oluion (in he ene of Theorem 2.2) of he differenial equaion, aying cloe o he equilibrium branch z = / 2ā(). The eimae (2.8) ha been deigned for iuaion where σ, and i ueful for σ h. We expec he exponen o be opimal in hi cae, bu did no aemp o opimize he prefacor C(, ), which lead o ubexponenial correcion. If we aume, for inance, ha σ = q, q >, and ake h = p wih < p < q, (2.8) can be wrien a P,x τ B(h) < } ( + 2 ) exp [ O() O( p 2 2(q p) ) O( 2(q p) log ) ]}. (2.2) The -dependence of he prefacor i o be expeced. I i due o he fac ha a ime increae, he probabiliy of x ecaping from a neighbourhood of x de alo increae, bu very lowly if σ i mall. The eimae (2.8) how ha for a fracion γ of rajecorie o leave he rip B (h), we have o wai a lea for a ime γ given by α( γ ) = γ 2 h 2 [ ] } exp O() O(h) 2 σ 2 2 2, (2.2) which i compaible wih reul on he auonomou cae. Le u now conider he unable cae, ha i, we now aume ha he linearizaion a() = x f(x (), ) aifie a() a > for all I. Theorem 2.2 how he exience of 8

9 a paricular oluion x de of he deerminiic equaion (2.6) uch ha x de x () c for all I. We define ā() = x f( x de, ) = a() + O() > and α() = ā() d. The linearizaion of (2.) around x de again admi a oluion y of he form (2.2). Unlike in he able cae, he variance (2.3) grow exponenially fa (a lea wih e a/ ), and hu one expec he probabiliy of x remaining cloe o x de o be mall. Indeed, if ρ y, hen we have P,y up y < ρ } P,y y < ρ } = ρ y e α()/ 2πv() dx ρ y eα()/ e x2/2v() 2ρ 2πv(), (2.22) which goe o zero a ρσ e α()/ for. In hi eimae, however, we neglec all rajecorie which leave he inerval ( ρ, ρ) before ime and come back. We will derive a more precie eimae for he general, nonlinear cae. Thi i he conen of he econd main reul of hi ecion. Le } B u (h) = (x, ) R I : x x de h < (2.23) 2ā() and denoe by τ Bu(h) he fir exi ime of x from B u (h). Theorem 2.6 (Unable cae). There exi and h, depending only on f, uch ha for all h σ h, all and all x aifying (x, ) B u (h), we have P,x τ Bu(h) } e exp κ σ2 α() } h 2, (2.24) where κ = π 2e( O(h) O() ) doe no depend on. The proof, given in Secion 3.2, i baed on a pariion of he inerval [, ] ino mall inerval, and a comparion of he nonlinear equaion wih i linearizaion on each inerval. The above reul how ha x i unlikely o remain in B u (h) a oon a h 2 /σ 2. A major limiaion of (2.24) i ha i require h σ. Obaining an eimae for larger h i poible, bu require coniderably more work. We will provide uch an eimae in he more difficul, bu alo more inereing cae of he pichfork bifurcaion, ee Theorem 2. below. 2.3 Pichfork bifurcaion We now conider he SDE (2.) in he cae of f undergoing a pichfork bifurcaion. We will aume he following. Aumpion 2.7. There exi a neighbourhood N of he origin (, ) uch ha f i hree ime coninuouly differeniable wih repec o x and in N, and here exi a conan M > uch ha xxx f(x, ) 6M for all (x, ) N ; f(x, ) = f( x, ) for all (x, ) N ; f exhibi a upercriical pichfork bifurcaion a he origin, i.e., x f(, ) =, x f(, ) > and xxx f(, ) <. (2.25) 9

10 By recaling x and, we may and will aume ha x f(, ) =, x f(, ) = and xxx f(, ) = 6 (2.26) a in he andard cae f(x, ) = x x 3. Noe ha he aumpion ha f be odd i no neceary for he exience of a pichfork bifurcaion. However, he deerminiic yem behave very differenly if x = i no alway an equilibrium. The mo naural iuaion in which f(, ) = for all i he one where f i odd. The proof below can eaily be exended o he cae where f i no necearily odd provided f exhibi a upercriical pichfork bifurcaion wih x() being he equilibrium branch which become unable a he bifurcaion poin. Uing (2.26), we find ha he linearizaion of f a x = aifie a() = x f(, ) = + O( 2 ). (2.27) A andard reul of bifurcaion heory [GH, IJ] ae ha under hee aumpion, here exi a neighbourhood N N of (, ) in which he only oluion of f(x, ) = are he line x = and he curve x = ±x (), x () = [ + O() ],. (2.28) If N i mall enough, he equilibrium x = i able for < and unable for >, while x = ±x () are able equilibria wih linearizaion a () = x f(x (), ) = 2 [ + O() ]. (2.29) The only oluion of x f(x, ) = in N are he curve x = ± x(), x() = /3 [ + O() ],. (2.3) If f i four ime coninuouly differeniable, he erm O() in he la hree equaion can be replaced by O(). We briefly ae wha i known for he deerminiic equaion dx d = f(x, ), (2.3) where we ake an iniial condiion (x, ) N wih x > and <, ee Fig. b. Oberve ha α(, ) = a() d i decreaing for < < and increaing for >. Definiion 2.8. The bifurcaion delay i defined a Π( ) = inf > : α(, ) > }, (2.32) wih he convenion Π( ) = if α(, ) < for all >, for which α(, ) i defined. One eaily how ha Π( ) i differeniable for ufficienly cloe o, and aifie lim Π( ) = and lim Π ( ) =. Theorem 2.9 (Deerminiic cae). Le x de be he oluion of (2.3) wih iniial condiion = x. Then here exi conan, c, c depending only on f, and ime x de = + O( log ) 2 = Π( ) = Π( ) O( log ) 3 = Π( ) + O( log ) (2.33)

11 uch ha, if < x c, < and (x de, ) N, < x de c e α(, )/ for 2 x de x () c for 3. (2.34) The proof i a raighforward conequence of differenial inequaliie, ee for inance [Ber, Propoiion 4.6 and 4.8]. We now conider he SDE (2.) for σ >. The reul in hi ecion are only inereing for σ = O( ), while one of hem (Theorem 2.) require a condiion of he form σ log σ 3/2 = O( ) (where we have no ried o opimize he exponen 3/2). Le u fix an iniial condiion (x, ) N wih <. For any T (, ), we can apply Theorem 2.4 on he inerval [, T ] o how ha x T i likely o be a mo of order σ δ + c e α( T, )/ for any δ >. We can alo apply he heorem for > T o how ha he curve ±x () arac nearby rajecorie. Hence here i no limiaion in conidering he SDE (2.) in a domain of he form x d, T where d and T can be aken mall (independenly of and σ of coure!), wih an iniial condiion x T = x aifying x d. From now on, we will alway aume ha N = (x, ) R 2 : x d, T } (2.35) for ome d, T >. We fir how ha x i likely o remain mall for T. Acually, i urn ou o be convenien o how ha x remain cloe o he oluion x e α(, T )/ of he linearizaion of (2.3). We define he variance-like funcion ζ() = 2 a( T ) e2α(, T )/ + e 2α(,)/ d. (2.36) T We hall how in Lemma 4.2 ha for ufficienly mall, here exi conan c ± uch ha c ζ() c + for T, (2.37) c ζ() c+ for. (2.38) The funcion ζ() i ued o define he rip B(h) = (x, ) [ d, d] [ T, ]: x x e α(, T )/ < h ζ() }. (2.39) Le τ B(h) denoe he fir exi ime of x from B(h). Theorem 2. (Behaviour for ). There exi conan and h, depending only on f, T and d, uch ha for <, h h, x h/ /4 and T, where P T,x τ B(h) < } C(, ) exp 2 C(, ) = h 2 σ 2 [ r() O ( )]} h 2 (2.4) α(, T ) + O() 2 (2.4) and r() = O() for T, and r() = O( ) for.

12 The proof (given in Secion 4.2) and he inerpreaion of hi reul are very cloe in piri o hoe of Theorem 2.4. The only difference lie in he kind of -dependence of he error erm. The eimae (2.4) i ueful when σ h, and how ha he ypical preading of pah around he deerminiic oluion will lowly grow unil =, where i i of order σ/ /4, ee Fig. 2. Le u now examine wha happen for. We fir how ha x i likely o leave quie oon a uiably defined region D conaining he line x =. We define D = D(κ) by D(κ) = (x, ) [ d, d] [, T ]: x f(x, ) κa() }, (2.42) where κ (, ) i a free parameer. The upper and lower boundary of D(κ) are given by ± x(), where x() aifie x() = κ OT () a(). (2.43) Laer, we will aume κ (/2, 2/3). Thi will implify he analyi of he dynamic afer x ha lef D(κ). The upper bound on κ implie x() x() x (), while he lower bound guaranee ha he oluion of he correponding deerminiic equaion doe no reurn o D(κ) once i ha lef hi e, cf. Propoiion 4. below. Le τ D(κ) denoe he fir exi ime of x from D(κ). Then we have he following reul. Theorem 2. (Ecape from D(κ)). Chooe κ (, 2/3) and le (x, ) D(κ). Aume ha σ log σ 3/2 = O( ). Then for T, P,x τd(κ) } C x() ( log σ a() + α(, ) ) e κα(, )/ σ, (2.44) e 2κα(, )/ where C > i a (numerical) conan. The proof of hi reul (given in Secion 4.3) i by far he mo involved of he preen work. We ar by eimaing, in a imilar way a in Theorem 2.6, he fir exi ime from a rip S of widh lighly larger han σ/ a(). The probabiliy of reurning o zero afer leaving S can be eimaed; i i mall bu no exponenially mall. However, he probabiliy of neiher leaving D(κ) nor reurning o zero i exponenially mall. Thi fac can be ued o devie an ieraive cheme ha lead o he exponenial eimae (2.44). We poin ou ha for any ube D D(κ), we have he rivial eimae P,x τ D } P,x τ D(κ) }, and hu (2.44) alo provide an upper bound for he fir exi ime from maller e. Le u finally conider wha happen afer he pah ha lef D(κ) a ime τ = τ D(κ) (wih κ (/2, 2/3)). Fir noe ha (2.43) immediaely implie ha for T and x x(), x f(x, ) ã() = x f( x(), ) ηa() provided η 2 3κ OT (). (2.45) Le x de,τ denoe he oluion of he deerminiic equaion (2.3) aring in x() a ime τ (he cae where one ar a x() i obained by ymmery). We hall how in Propoiion 4. ha x de,τ alway remain beween x() and x (), and approache x () according o x de,τ ( ) = x () O 3/2 O ( τ e ηα(,τ)/). (2.46) 2

13 Moreover, deerminiic oluion aring a differen ime approach each oher like x de, x de,τ ( x de, τ x(τ) ) e ηα(,τ)/ [τ, T ]. (2.47) The linearizaion of f a x de,τ aifie a τ () = x f(x de,τ, ) = a () + O For given τ, we conruc a rip A τ (h) around x de,τ of he form ( ) + O ( e ηα(,τ)/). (2.48) A τ (h) = (x, ): τ T, x x de,τ < h ζ τ () }, (2.49) where he funcion ζ τ () i defined by ζ τ () = and aifie 2 ã(τ) e2ατ (,τ)/ + ζ τ () = τ e 2ατ (,)/ d, α τ (, ) = a τ (u) du, (2.5) ( ) 2 a () + O 3 + O( e ηα(,τ)/), (2.5) cf. Lemma 4.2. Le τ A τ (h) denoe he fir exi ime of x from A τ (h). Theorem 2.2 (Approach o x ). Le κ (/2, 2/3). Then here exi conan and h, depending only on f, T and d, uch ha for <, h < h τ and τ T, where P τ, x(τ) τ A τ (h) < } C τ (, ) exp 2 h 2 [ σ 2 ( h )]} O() O τ (2.52) C τ (, ) = ατ (, τ) a () d + 2. (2.53) The proof i given in Secion 4.4. Thi reul i ueful for σ h τ, and how ha he ypical preading of pah around x de,τ i of order σ/, ee Fig Dicuion Le u now examine ome of he conequence of hee reul. Fir of all, hey allow o characerize he influence of addiive noie on he bifurcaion delay. In he deerminiic cae, hi delay i defined a he fir exi ime from a rip of widh around x =, ee Theorem 2.9. A poible definiion of he delay in he ochaic cae i hu he fir exi ime τ delay from a imilar rip. An appropriae choice for he widh of he rip i x( ) = O( /4 ), ince uch a rip will conain B(h) for every admiible h, and he par of he rip wih will be conained in D(κ). Theorem 2. and 2. hen imply ha if, P T,x τ delay < } C(, ) e O(/σ2 ) P T,x τ delay } C x() a() log σ σ ( + α(, ) (2.54) ) e κα(, )/ e. (2.55) 2κα(, )/ If we chooe in uch a way ha α(, ) = c log σ for ome c >, he la expreion reduce o P T,x τ delay } = O ( σ κc log σ 2), (2.56) 3

14 which become mall a oon a c > /κ. The bifurcaion delay will hu lie wih overwhelming probabiliy in he inerval [, O ( log σ )]. (2.57) Theorem 2.2 implie ha for ime larger han O( log σ ), he pah are unlikely o reurn o zero in a ime of order. The wilde behaviour of he pah i o be expeced in he inerval (2.57), becaue a region of inabiliy i croed, where x f >. Our reul on he pichfork bifurcaion require σ, while he eimae (2.57) i ueful a long a σ i no exponenially mall. We can hu diinguih hree regime, depending on he noie ineniy: σ : A modificaion of Theorem 2. how ha for < σ, he ypical preading of pah i of order σ/. Near he bifurcaion poin, he proce i dominaed by noie, becaue he drif erm f x 3 i oo weak o counerac he diffuion. Depending on he global rucure of f, an appreciable fracion of he pah migh ecape quie early from a neighbourhood of he bifurcaion poin. In ha iuaion, he noion of bifurcaion delay become meaningle. e /p σ for ome p < : The bifurcaion delay lie in he inerval (2.57) wih high probabiliy, where log σ ( p)/2 i ill microcopic. σ e K/ for ome K > : The noie i o mall ha he pah remain concenraed around he deerminiic oluion for a ime inerval of order. The ypical preading i of order σ ζ(), which behave like σ e α()/ / /4 for, ee Lemma 4.2. Thu he pah remain cloe o he origin unil α() log σ K. If log σ > α(π( )) = α( ), hey follow he deerminiic oluion which make a quick raniion o x () a = Π( ). The expreion (2.57) characerizing he delay i in accordance wih experimenal reul [TM, SMC], and wih he approximae calculaion of he la croing of zero [JL]. The numerical reul in [Ga], which are fied, a =., o τ delay σ.5 for weak noie and τ delay e 85 σ for rong noie, eem raher myeriou. Finally, he reul in [Ku], who approximae he probabiliy deniy by a Gauian cenered a he deerminiic oluion, can obviouly only apply o he regime of exponenially mall noie. Noe ha he eimae (2.57) ugge how o chooe he peed a which he bifurcaion parameer i wep when deermining a bifurcaion diagram experimenally: Since we wan he bifurcaion delay o be microcopic, hould no exceed a cerain value depending on he noie ineniy σ. In fac, repeaing he experimen for differen value of yield an eimae for log σ. On he oher hand, increaing arificially he noie level σ allow o work wih larger weeping rae, reducing he ime co of he experimen. Anoher inereing queion i how fa he pah concenrae near he equilibrium branche ±x (). The deerminiic oluion, aring a x( ) a ome ime >, all rack x () a a diance which i aympoically of order / 3/2. Therefore, we can chooe one of hem, ay x de,, and meaure he diance of x from ha deerminiic oluion. We reric our aenion o hoe pah which are ill in a neighbourhood of he origin a ime, a mo pah are. We wan o how ha for uiably choen (, ) and (, ), mo pah will leave D(κ) unil ime and reach a δ-neighbourhood of x de, 4

15 a ime τ D(κ) +. Le u eimae P,x ( τ D(κ) <, P },x τd(κ) + E,x up [τ D(κ) +,] τd(κ) < } P τ D(κ), x(τ D(κ) ) ) c } x x de, < δ up [τ D(κ) +,] x x de, }} δ. (2.58) The fir erm decreae roughly like σ e κα(, )/ and become mall a oon a α(, ) log σ. The econd ummand i bounded above by con E,x τd(κ) < } exp 2 [ σ 2 δ O ( τd(κ) e ηα(τ D(κ)+,τ D(κ) )/ ) ]}} 2. (2.59) Therefore, δ hould be large compared o σ/ and we alo need ha i a lea of order O( log σ ). Then we ee ha afer a ime of order O( log σ ), he ypical pah will have lef D(κ) and, afer anoher ime of he ame order, will reach a neighbourhood of, which cale wih σ/. Finally, we can alo eimae he probabiliy of reaching he poiive raher han he negaive branch. Conider x, aring in x a ime <, and le >. Wihou lo of generaliy, we may aume ha x >. The ymmery of f implie x de, P,x x } = 2 P,x [, ) : x = }, (2.6) and herefore i i ufficien o eimae he probabiliy for x o reach zero before ime zero, for inance. We linearize he SDE (2.) and ue he fac ha he oluion x of he linearized equaion dx = a()x d + σ dw, x = x (2.6) aifie x x a long a x doe no reach zero. For he Gauian proce x we know P,x [, ) : x = } ( = 2 P,x x }) = u() e y2 /2 dy, (2.62) 2π u() where u() = x e α(,)/ / v(, ) and v(, ) denoe he variance of x. For =, u() i of order x /4 σ e con 2 /, ee Lemma 4.2. Thu he probabiliy in (2.62) i exponenially cloe o one for mall, and we conclude ha he probabiliy for x o reach he poiive branch raher han he negaive one i exponenially cloe o /2. When he global behaviour of f i known, we can alo inveigae he long-ime behaviour of he oluion x. For inance, in he pecial cae f(x, ) = x x 3, under he aumpion σ 2 con/ log, i i unlikely ha a pah which i cloe o one of he able equilibrium branche ± a ome ime of order, will wich o he oher equilibrium branch again. Thi i a conequence of he fac ha he diance beween he equilibrium branche increae while he branche become more and more aracive. Along he line of Secion 3. i can be hown ha he probabiliy of ever reaching zero again decay like e con/σ2 in ha cae. 5

16 3 The moion near nonbifurcaing equilibria In hi ecion we conider he nonlinear SDE (2.) under Aumpion 2. which guaranee he exience of a hyperbolic equilibrium branch. Secion 3. i devoed o he able cae, while in Secion 3.2, we conider he unable cae. 3. Sable cae We fir conider he cae of a able equilibrium, ha i, we aume ha a() a for all I. We will ar by analying he linearizaion of (2.) around a given deerminiic oluion. Propoiion 3.4 how ha he oluion of he linearized equaion are likely o remain in a rip of widh h ζ() around he deerminiic oluion. Here ζ() i relaed o he variance and will be analyed in Lemma 3.. Propoiion 3.7 allow o compare he rajecorie of he linear and he nonlinear equaion, and hu complee he proof of Theorem 2.4. By Theorem 2.2, here exi a c > uch ha he deerminiic oluion x de of (2.6) wih iniial condiion x de = x aifie x de x () 2c + x x () e a /2 I, (3.) provided x x () c. Le x denoe he oluion of he SDE (2.), aring a ime = in ome x. We are inereed in he ochaic proce y = x x de, which decribe he deviaion due o noie from he deerminiic oluion x de. I obey an SDE of he form dy = [ā()y + b(y, ) ] d + σ dw, y =, (3.2) where we have inroduced he noaion ā() = ā () = x f(x de, ) b(y, ) = b (y, ) = f(x de + y, ) f(x de, ) ā()y. (3.3) Taking and x x () ufficienly mall, we may aume ha here exi a conan d > uch ha x de + y x () d whenever y d. I follow from Taylor formula ha for all (y, ) [ d, d] I, b(y, ) My 2 (3.4) ā() a() M ( 2c + x x () e a /2 ). (3.5) We may furher aume ha here are conan ā + ā > a /4 uch ha Finally, he relaion ā () = x f(x de a conan c 2 > uch ha ā + ā() ā I. (3.6), ) + xx f(x de, ) f(xde, ) implie he exience of ( ā () c 2 + x x () e a /2 ). (3.7) Our analyi will be baed on a comparion beween oluion of (3.2) and hoe of he linearized equaion dy = ā()y d + σ dw, y =. (3.8) 6

17 I oluion y a ime i a Gauian random variable wih mean zero and variance v() = σ2 e 2α(,)/ d where α(, ) = ā(u) du. (3.9) Noe ha (3.6) implie ha α(, ) ā ( ) whenever, which implie in paricular, ha v() i no larger han σ 2 /2ā. We can, however, derive a more precie bound, which i ueful when and e a/2 are mall. To do o, we inroduce he funcion ζ() = 2 ā() e2α()/ + e 2α(,)/ d, where α() = α(, ). (3.) Noe ha v() σ 2 ζ(), and ha boh funcion differ by a erm which become negligible a oon a > O( log ). The behaviour of ζ() i characerized in he following lemma. Lemma 3.. The funcion ζ() aifie he following relaion for all I. ζ() = 2 ā() + O() + O( x x () e a /2 ) (3.) ζ() 2ā + 2ā (3.2) ζ () Proof: By inegraion by par, we obain ha ζ() = Uing (3.6) and (3.7) we ge ā () ā() 2 e2α(,)/ d c 2 ā 2 c 2 2ā 3 + c 2 ā 2 2ā() 2 e 2ā ( )/ d + c 2 x x () ā 2 (3.3) ā () ā() 2 e2α(,)/ d. (3.4) e [ 2ā ( ) a /2]/ d x x () 2ā a /2 e a /2, (3.5) which prove (3.). We now oberve ha ζ() i a oluion of he linear ODE dζ d = ( ) 2ā()ζ +, ζ() = 2 ā(). (3.6) Since ζ() > and ā() <, we have ζ () /. We alo ee ha ζ () whenever ζ() /2ā + and ζ () whenever ζ() /2ā. Since ζ() belong o he inerval [/2ā +, /2ā ], ζ() mu remain in hi inerval for all. A we have already een in (2.4), he probabiliy of finding y ouide a rip of widh much larger han 2v() i very mall. By Lemma 3., we now know ha 2v() behave approximaely like σ a() /2. One of he key poin of he preen work i o how ha he whole pah y } remain in a rip of imilar widh wih high probabiliy. The rip will be defined wih he help of ζ() inead of v(), becaue we need he widh o be bounded away from zero, even for mall. 7

18 To inveigae y we need o eimae he ochaic inegral eα(,u)/ dw u. To do o, we would like o ue he Bernein-ype inequaliy } δ 2 } P up ϕ(u) dw u δ exp 2, (3.7) ϕ(u)2 du valid for Borel-meaurable deerminiic funcion ϕ(u). Unforunaely, hi eimae canno be applied direcly, becaue in our cae, he inegrand depend explicily on he upper inegraion limi. Thi i why we inroduce a pariion of he inerval [, ]. Lemma 3.2. Le ρ : I R + be a meaurable, ricly poiive funcion. Fix K N, and le = u u < < u K = be a pariion of he inerval [, ]. Then P, up σ ρ() } e α(,u)/ dw u h 2 where P k = exp h 2 ( )( 2 σ 2 inf ρ() 2 e 2α(u k,)/ u k u k Proof: We have P, up σ } e α(,u)/ dw u h ρ() = P, k,..., K} : up u k u k ρ() 2 K k= P, up u k u k uk e α(u)/ dw u h σ K P k, (3.8) k= ) } e 2α(uk,)/ d. (3.9) e α(,u)/ h } dw u σ inf ρ() e α()/}. u k u k Applying he Bernein inequaliy (3.7) o he la expreion, we obain (3.8). (3.2) Remark 3.3. Noe ha in he proof of Lemma 3.2 we have no ued he monooniciy of α(, ) o ha he eimae (3.8) can alo be applied in he cae where ā() change ign. We are now ready o derive an upper bound for he probabiliy ha y leave a rip of appropriae widh hρ() before ime. Taking ρ() = ζ() will be a good choice ince i lead o approximaely conan P k in (3.8). Propoiion 3.4. There exi an r = r(ā +, ā ) uch ha P, y } up h C(, ) exp ζ() 2 h 2 } σ 2 ( r), (3.2) where C(, ) = α() (3.22) 8

19 Proof: Le α() K = 2 2. (3.23) For k =,..., K, we define he pariion ime u k by he relaion α(u k ) = 2 2 k, (3.24) which i poible ince α() i coninuou and decreaing. Thi definiion implie in paricular ha α(u k, u k ) = 2 2 and, herefore, u k u k 2 2 /ā. Bounding he inegral in (3.9) by ζ(u k ), we obain P k exp 2 We have e 2α(u k,)/ e 4 and h 2 σ 2 ζ() ζ(u k ) = Since ζ(u k ) /2ā +, hi implie P k exp 2 and he reul follow from Lemma 3.2. inf u k u k uk ζ() ζ(u k ) e2α(u k,)/ }. (3.25) ζ (u) du u k. (3.26) h 2 ( ) σ 2 4ā+ e 4}, (3.27) ā Remark 3.5. If we only aume ha ā i Borel-meaurable wih ā() ā for all I, we ill have P, up y h/ } 2ā C(, ) exp h 2 2 σ 2 e 4}. (3.28) To prove hi, we chooe he ame pariion a before and bound he inegral in (3.9) by /2ā. We now reurn o he nonlinear equaion (3.2), he oluion of which we wan o compare o hoe of i linearizaion (3.8). To hi end, we inroduce he even Ω (h) = ω : y (ω) < h } ζ() [, ] (3.29) Ω (h) = ω : y(ω) < h } ζ() [, ]. (3.3) Propoiion 3.4 give u an upper bound on he probabiliy of he complemen of Ω (h). The key poin o conrol he nonlinear cae i a relaion beween he e Ω and Ω (for lighly differen value of h). Thi i done in Propoiion 3.7 below. Noaion 3.6. For wo even Ω and Ω 2, we wrie Ω a.. Ω 2 if P-almo all ω Ω belong o Ω 2. Propoiion 3.7. Le γ = 2 2ā + M/ā 2 and aume ha h < d ā /2 γ. Then Ω (h) a.. ( [ Ω γ ) + 4 h] h (3.3) Ω (h) a.. Ω ( [ + γh ] h ). (3.32) 9

20 Proof:. The difference z = y y aifie wih z = P-a.. Now, which implie dz d = [ā()z + b(y + z, ) ] (3.33) z = z e α(,u)/ b(y u + z u, u) du, (3.34) for all [, ]. 2. Le u aume ha ω Ω (h). Then we have for all [, ] and hu by (3.35), e α(,u)/ b(y u, u) du (3.35) y (ω) h ζ() h 2ā d 2, (3.36) z (ω) α(,u)/ Mh2 e du. (3.37) 2ā The inegral on he righ-hand ide can be eimaed by (3.2), yielding Therefore, e α(,u)/ du 2ζ 2 () ā. (3.38) z (ω) Mh2 2ā 2 M ā + h 2ā 2 h ζ(), (3.39) which prove (3.3) becaue y (ω) y (ω) + z (ω). 3. Le u now aume ha ω Ω (h). Then we have y (ω) d/2 for all [, ] a in (3.36). For δ = γh, we have δ < by aumpion. We conider he fir exi ime and he even τ = inf [, ]: z δh ζ() } [, ] } (3.4) A = Ω (h) ω : τ(ω) < }. (3.4) If ω A, hen for all [, τ(ω)], we have y (ω) ( + δ)h ζ() d, and hu by (3.35) and (3.38), z (ω) e α(,u)/ M( + δ)2 h 2 2ā du M( + δ)2 h 2 2ā 2 < δh ζ(). (3.42) However, by he definiion of τ, we have z τ(ω) (ω) = δh ζ(τ(ω)), which conradic (3.42) for = τ(ω). Therefore PA} =, which implie ha for almo all ω Ω, we have z (ω) < δh ζ() for all [, ], and hence for hee ω, which prove (3.32). y (ω) < ( + δ)h ζ() [, ] (3.43) 2

21 We cloe hi ubecion wih a corollary which i Theorem 2.4, reaed in erm of he proce y. I i a direc conequence of Propoiion 3.7 and 3.4. Corollary 3.8. There exi h and, depending only on f, uch ha for < and h < h, P, y } up > h C(, ) exp h 2 [ ] } O() O(h) ζ() 2 σ 2. (3.44) 3.2 Unable cae We now conider a imilar iuaion a in Secion 3., bu wih an unable equilibrium branch, ha i, we aume ha a() a > for all I. Our aim i o prove Theorem 2.6 which i equivalen o Propoiion 3. below. The proof i again baed on a comparion of oluion of he nonlinear equaion (2.) and i linearizaion around a given deerminiic oluion. Theorem 2.2 how he exience of a paricular oluion x de of he deerminiic equaion (2.6) uch ha x de x () c for all I. We are inereed in he ochaic proce y = x x de, which decribe he deviaion due o noie from hi deerminiic oluion x de. I obey he SDE where dy = [ā()y + b(y, ) ] d + σ dw, (3.45) ā() = ā () = x f( x de, ) b(y, ) = b (y, ) = f( x de + y, ) f( x de, ) ā()y (3.46) are he analog of ā and b defined in (3.3). Taking ufficienly mall, we may aume ha here exi conan ā, ā, d >, uch ha he following eimae hold for all I and all y uch ha y d: ā() ā, ā () ā, b(y, ) My 2. (3.47) The bound on ā () i a conequence of he analog of (3.7) ogeher wih he fac ha x de x () = O(). We fir conider he linear equaion dy = ā()y d + σ dw. (3.48) Given he iniial value y, he oluion y mean y eα()/ and variance a ime i a Gauian random variable wih v() = σ2 e 2α(,)/ d, (3.49) where α(, ) = ā(u) du ā ( ) for. The variance, which i growing exponenially fa, can be eimaed wih he help of he following lemma. Lemma 3.9. For < < 2ā 2 /ā, one ha e 2α(,)/ d = [ e 2α()/ 2ā() ] [ ] + O(). (3.5) 2ā() 2

22 Proof: By inegraion by par, we obain ha e 2α(,)/ d = 2ā() e2α()/ 2ā() 2 ā () ā() 2 e2α(,)/ d, (3.5) which implie ha [ 2 ā ā 2 ] e 2α(,)/ d 2ā() e2α()/ [ 2ā() + 2 ā ā 2 ] e 2α(,)/ d. (3.52) By our hypohei on, he fir erm in bracke i poiive. The following propoiion, which reae Theorem 2.6 in erm of y, i he main reul of hi ubecion. Propoiion 3.. There exi conan, h > uch ha for all h σ h, all and for any given y wih y 2ā() < h, we have where κ = π 2e( O(h) O() ). P,y up y } 2ā() < h e exp κ σ2 α() } h 2, (3.53) Proof:. Le K N and le = u < u < < u K = be any pariion of he inerval [, ]. We define he even A k = ω : up y } 2ā() < h u k u k+ B k = ω : y uk } (3.54) 2ā(u k ) < h A k. Le q k be a deerminiic upper bound on P k = P u k,y uk A k }, valid on B k. Then we have by he Markov propery P,y y } 2ā() < h up K } = P,y A k = E,y } } K 2 k= A E,y AK y k } uk = E,y k= } K 2 k= A P K k K 2 q K P,y k= A k } K k= q k. (3.55) 2. To define he pariion, we e K = γ α() σ 2 h 2 (3.56) for ome γ (, ] o be choen laer, and α(u k+, u k ) = γ h2, k =,..., K 2. (3.57) σ2 22

23 Since α(u k+, u k ) ā (u k+ u k ), we have u k+ u k h2 γ σ 2 ā, and uing Taylor formula, we find for all [u k, u k+ ] and all k =,..., K h2 ā σ 2 γ ā() h2 ā + ā(u k ) σ 2 γ, (3.58) ā 2 where ā i he upper bound on ā, ee (3.47). In order o eimae P k, we inroduce linear approximaion (y (k) ) [uk,u k+ ] for k,..., K 2}, defined by dy (k) = ā()y(k) ā 2 + σ dw (k), y (k) u k = y uk, (3.59) where W (k) = W W uk i a Brownian moion wih W u (k) k = which i independen of W : u k }. If ω A k, we have for all [u k, u k+ ] y (ω) y (k) (ω) Mh2 2ā u k e α(,u)/ b(y u, u) du e α(uk+,uk)/ ā(u k ) where r = M e(2ā 3 ) /2 + O(). Thi how ha on A k, [ + O() ] r h 2 2ā(), (3.6) y (k) (ω) [ + r h ] h 2ā() [u k, u k+ ]. (3.6) 3. We are now ready o eimae P k. (3.6) how ha on B k, P k P u k,y uk up } 2ā() < h( + r h) u k u k+ y (k) P u k,y uk y (k) u k+ 2ā(u k+ ) < h( + r h) } (3.62) 2h( + r h) 2πv u (k) 2ā(uk+ ), k+ where v u (k) k+ denoe he condiional variance of y u (k) k+, given y uk. A in (3.5), v u (k) k+ = σ2 uk+ [ e 2α(uk+,)/ d = σ2 e 2α(u k+,u k ] )/ [ ] + O(). (3.63) u k 2 ā(u k ) ā(u k+ ) I follow ha ā(u k+ )v u (k) k+ σ2 2 σ2 2 [ e 2γh2 /σ 2 ā(u k+) ā(u k ) [( + 2γ h2 σ 2 )( ā γh 2[ ā 2ā 2 γh 2[ O() ]. ] [ ] O() h 2 ) ā 2 σ 2 γ ( ) ] [ ] + 2γ O() ] [ ] O() Inering hi ino (3.62), we obain for each k =,..., K 2 on B k he eimae (3.64) P k 2h( + r h) [ ] [ ] + O() = + O() + O(h) =: q. (3.65) 2π 2γh 2 πγ 23

24 Noe ha for any γ (/π, ], here exi h > and > uch ha q < for all h h and all. Since q K = i an obviou bound, we obain from (3.55) P,y up y } 2ā() < h q K q exp α() σ 2 h 2 2γq 2 q2 log ( /q 2)}. (3.66) Chooing γ o ha q 2 = / e hold, yield almo he opimal exponen, and we obain P,y up y } 2ā() < h e exp κ α() σ 2 } h 2. (3.67) 4 Pichfork bifurcaion 4. Preliminarie In hi ecion, we conider he nonlinear SDE (2.) in he cae where f undergoe a upercriical pichfork bifurcaion, i.e., we require Aumpion 2.7 o hold in a region N = (x, ) R 2 : x d, T } N. The noie ineniy σ i aumed o aify σ = O( ) hroughou Secion 4. Only in Subecion 4.3, hi condiion will be lighly renghened o σ log σ 3/2 = O( ). Recall ha we recaled pace and ime in order o obain (2.26). Uing Taylor erie and he ymmery aumpion, we may wrie for all (x, ) N f(x, ) = a()x + b(x, ) = x [ a() + g (x, ) ] x f(x, ) = a() + g (x, ) where a(), g (x, ), g (x, ) are wice coninuouly differeniable funcion aifying a() = x f(, ) = + O( 2 ) (4.) g (x, ) = [ + γ (x, ) ] x 2 g (x, ) Mx 2 (4.2) g (x, ) = [ 3 + γ (x, ) ] x 2 g (x, ) 3Mx 2, wih γ, γ ome coninuou funcion uch ha γ (, ) = γ (, ) =. The following andard reul from bifurcaion heory i eaily obained by applying he implici funcion heorem, ee [GH, p. 5] or [IJ, Secion II.4] for inance. We ae i wihou proof. Propoiion 4.. If T and d are ufficienly mall, here exi wice coninuouly differeniable funcion x, x : (, T ] R + of he form x () = [ + OT () ] wih he following properie: x() = /3 [ + OT () ] (4.3) he only oluion of f(x, ) = in N are eiher of he form (, ), or of he form (±x (), ) wih > ; he only oluion of x f(x, ) = in N are of he form (± x(), ) wih ; he derivaive of f a ±x () i a () = x f(x (), ) = 2 [ + OT () ]. (4.4) 24

25 he derivaive of x () and x() aify dx d = 2 [ + O T ()], d x d = 2 3 [ + O T ()]. (4.5) A already poined ou in Secion 2.3, here i no rericion in auming T and d o be mall. Thu we may aume ha he erm OT () are ufficienly mall o do no harm. For inance, we may and will alway aume ha a () <. In he following ubecion, we are going o analye he dynamic in hree differen region of he (, x)-plane: near x = for, near x = for, and near x = x () for. Fir, in Subecion 4.2, we analye he behaviour for. Theorem 2. i proved in he ame way a Theorem 2.4, he main difference lying in he behaviour of he variance which i inveigaed in Lemma 4.2. Subecion 4.3 i devoed o he raher involved proof of Theorem 2.. We ar by giving ome preparaory reul. Propoiion 4.7 eimae he probabiliy of remaining in a maller rip S in a imilar way a Propoiion 3.. We hen how in Lemma 4.8 ha he pah are likely o leave D(κ) a well, unle he oluion of a uiably choen linear SDE reurn o zero. The probabiliy of uch a reurn o zero i udied in Lemma 4.9. Finally, Theorem 2. i proved, he proof being baed on an ieraive cheme. The la ubecion analye he moion afer τ D(κ). Here, he main difficuly i o conrol he behaviour of he deerminiic oluion, which are hown o approach x (), cf. Propoiion 4.. We hen prove ha he pah of he random proce are likely o ay in a neighbourhood of he deerminiic oluion. The proof i imilar o he correponding proof in Secion The behaviour for We begin by conidering he linear SDE wih iniial condiion x = x a ime [ T, ). Le dx = a()x d + σ dw (4.6) v(, ) = σ2 e 2α(,)/ d (4.7) denoe he variance of x. A before, we now inroduce a funcion ζ() which will allow u o define a rip ha he proce x i unlikely o leave before ime, ee Corollary 4.5 below. Le ζ() = 2 a( ) e2α(, )/ + e 2α(,)/ d. (4.8) The following lemma decribe he behaviour of ζ(). Lemma 4.2. There exi conan c ± > uch ha c ζ() c + for c ζ() c+ for (4.9) c e 2α()/ ζ() c+ e 2α()/ for T. If, moreover, a () > on [, ], hen ζ() i increaing on [, ]. 25

26 Proof: Fir noe ha Equaion (4.2) implie he exience of conan a + a > uch ha a + a() a for T a a() a + for T. (4.) For, hi implie a + ( 2 2 ) 2α(, ) a ( 2 2 ). Inegraion by par yield he relaion e a ±(2 2 )/ d = 2a ± e a±(2 2 )/ 2a ± e a±(2 2)/ 2a ± 2 d. (4.) Since he la wo erm on he righ-hand ide are negaive, he upper bound for i immediae. For he correponding lower bound, we ue ζ() e2α(, )/ 2 a( ) 2 e a +( 2 2 )/ d e a +(( 2) 2 2 )/, (4.2) 2a + 2 where he la inequaliy i obained by replacing e a +( 2 2 )/ by on he righ-hand ide of (4.). For /2, we hu ge ζ() /(4a + ), while for /2 <, we find ζ() ( e 3a + )/(4a + ). In he cae, we ue he relaion ζ() = ζ( ) e 2α(, )/ + e 2α(,)/ d. (4.3) Since α(, ) = O() for,, we conclude ha ζ() remain of order / for. For, we have e 2α()/ ζ() = ζ( ) e 2α( )/ + e 2α()/ d. (4.4) Now, 2α() a 2 for implie ha he righ-hand ide remain of order / for all. Finally, aume ha a () > for all, and recall ha ζ() i he oluion of he iniial value problem dζ d = 2a() ζ +, ζ( ) = 2 a( ). (4.5) Since ζ(), ζ > for all poiive. For negaive, ζ i poiive whenever he funcion V () = ζ() + /2a() i negaive. We have V ( ) = and dv d = 2a() V a () 2a() 2. (4.6) Since V < whenever V =, V can never become poiive. Thi implie ζ. The following propoiion how ha he oluion x of he linearized equaion (4.6) i likely o rack he oluion of he correponding deerminiic equaion. 26

27 Propoiion 4.3. Aume ha T <. For ufficienly mall, P,x up x x e α(, )/ ζ() } > h C(, ) exp 2 h 2 σ 2 [ r() ] }, (4.7) where C(, ) = α(, ) 2 + a and where r() = O() for, and r() = O( ) for. (4.8) Proof: We will only give he proof in he cae a hi i he more inereing par. By Lemma 3.2, he probabiliy in (4.7) i bounded by 2 K k= P k, where P k = exp 2 h 2 σ 2 ζ(u k ) } inf ζ(u) e 2α(u k,u)/ (4.9) u k u u k for any pariion = u < < u K = of he inerval [, ]. The choice of he pariion hould reflec he differen behaviour of x for and for. We e α(, ) + K = 2 2, K = K + (4.2) and define he pariion ime by α(u k, ) = 2 2 k for k K, u k = + (k K ) for K k K. (4.2) Eimaing P k a in he proof of Propoiion 3.4, we obain P k exp P k exp Finally, le u noe ha h 2 ( 2 σ 2 2 ) e 4} for k K, (4.22) a c h 2 ( ) } 2 σ 2 [ + 2a + c + ] e a + for K k K. (4.23) c 2K α(, ) ( + ) + 4 α(, ) 2 + a , (4.24) which conclude he proof of he propoiion. Le u now compare oluion of he wo SDE dx = a()x d + σ dw x = x (4.25) dx = f(x, ) d + σ dw x = x, (4.26) where [ T, ). We define he even Ω (h) = ω : x (ω) x e α(, )/ h } ζ() [, ] (4.27) Ω (h) = ω : x (ω) x e α(, )/ h } ζ() [, ]. (4.28) Propoiion 4.3 give u an upper bound on he probabiliy of he complemen of Ω (h). We now give relaion beween hee even. 27

Fractional Ornstein-Uhlenbeck Bridge

Fractional Ornstein-Uhlenbeck Bridge WDS'1 Proceeding of Conribued Paper, Par I, 21 26, 21. ISBN 978-8-7378-139-2 MATFYZPRESS Fracional Ornein-Uhlenbeck Bridge J. Janák Charle Univeriy, Faculy of Mahemaic and Phyic, Prague, Czech Republic.

More information

Introduction to SLE Lecture Notes

Introduction to SLE Lecture Notes Inroducion o SLE Lecure Noe May 13, 16 - The goal of hi ecion i o find a ufficien condiion of λ for he hull K o be generaed by a imple cure. I urn ou if λ 1 < 4 hen K i generaed by a imple curve. We will

More information

Laplace Transform. Inverse Laplace Transform. e st f(t)dt. (2)

Laplace Transform. Inverse Laplace Transform. e st f(t)dt. (2) Laplace Tranform Maoud Malek The Laplace ranform i an inegral ranform named in honor of mahemaician and aronomer Pierre-Simon Laplace, who ued he ranform in hi work on probabiliy heory. I i a powerful

More information

Randomized Perfect Bipartite Matching

Randomized Perfect Bipartite Matching Inenive Algorihm Lecure 24 Randomized Perfec Biparie Maching Lecurer: Daniel A. Spielman April 9, 208 24. Inroducion We explain a randomized algorihm by Ahih Goel, Michael Kapralov and Sanjeev Khanna for

More information

6.8 Laplace Transform: General Formulas

6.8 Laplace Transform: General Formulas 48 HAP. 6 Laplace Tranform 6.8 Laplace Tranform: General Formula Formula Name, ommen Sec. F() l{ f ()} e f () d f () l {F()} Definiion of Tranform Invere Tranform 6. l{af () bg()} al{f ()} bl{g()} Lineariy

More information

EECE 301 Signals & Systems Prof. Mark Fowler

EECE 301 Signals & Systems Prof. Mark Fowler EECE 31 Signal & Syem Prof. Mark Fowler Noe Se #27 C-T Syem: Laplace Tranform Power Tool for yem analyi Reading Aignmen: Secion 6.1 6.3 of Kamen and Heck 1/18 Coure Flow Diagram The arrow here how concepual

More information

Chapter 7: Inverse-Response Systems

Chapter 7: Inverse-Response Systems Chaper 7: Invere-Repone Syem Normal Syem Invere-Repone Syem Baic Sar ou in he wrong direcion End up in he original eady-ae gain value Two or more yem wih differen magniude and cale in parallel Main yem

More information

, the. L and the L. x x. max. i n. It is easy to show that these two norms satisfy the following relation: x x n x = (17.3) max

, the. L and the L. x x. max. i n. It is easy to show that these two norms satisfy the following relation: x x n x = (17.3) max ecure 8 7. Sabiliy Analyi For an n dimenional vecor R n, he and he vecor norm are defined a: = T = i n i (7.) I i eay o how ha hee wo norm aify he following relaion: n (7.) If a vecor i ime-dependen, hen

More information

Algorithmic Discrete Mathematics 6. Exercise Sheet

Algorithmic Discrete Mathematics 6. Exercise Sheet Algorihmic Dicree Mahemaic. Exercie Shee Deparmen of Mahemaic SS 0 PD Dr. Ulf Lorenz 7. and 8. Juni 0 Dipl.-Mah. David Meffer Verion of June, 0 Groupwork Exercie G (Heap-Sor) Ue Heap-Sor wih a min-heap

More information

Mathematische Annalen

Mathematische Annalen Mah. Ann. 39, 33 339 (997) Mahemaiche Annalen c Springer-Verlag 997 Inegraion by par in loop pace Elon P. Hu Deparmen of Mahemaic, Norhweern Univeriy, Evanon, IL 628, USA (e-mail: elon@@mah.nwu.edu) Received:

More information

Generalized Orlicz Spaces and Wasserstein Distances for Convex-Concave Scale Functions

Generalized Orlicz Spaces and Wasserstein Distances for Convex-Concave Scale Functions Generalized Orlicz Space and Waerein Diance for Convex-Concave Scale Funcion Karl-Theodor Surm Abrac Given a ricly increaing, coninuou funcion ϑ : R + R +, baed on he co funcional ϑ (d(x, y dq(x, y, we

More information

Stability in Distribution for Backward Uncertain Differential Equation

Stability in Distribution for Backward Uncertain Differential Equation Sabiliy in Diribuion for Backward Uncerain Differenial Equaion Yuhong Sheng 1, Dan A. Ralecu 2 1. College of Mahemaical and Syem Science, Xinjiang Univeriy, Urumqi 8346, China heng-yh12@mail.inghua.edu.cn

More information

ESTIMATES FOR THE DERIVATIVE OF DIFFUSION SEMIGROUPS

ESTIMATES FOR THE DERIVATIVE OF DIFFUSION SEMIGROUPS Elec. Comm. in Probab. 3 (998) 65 74 ELECTRONIC COMMUNICATIONS in PROBABILITY ESTIMATES FOR THE DERIVATIVE OF DIFFUSION SEMIGROUPS L.A. RINCON Deparmen of Mahemaic Univeriy of Wale Swanea Singleon Par

More information

Introduction to Congestion Games

Introduction to Congestion Games Algorihmic Game Theory, Summer 2017 Inroducion o Congeion Game Lecure 1 (5 page) Inrucor: Thoma Keelheim In hi lecure, we ge o know congeion game, which will be our running example for many concep in game

More information

The Residual Graph. 11 Augmenting Path Algorithms. Augmenting Path Algorithm. Augmenting Path Algorithm

The Residual Graph. 11 Augmenting Path Algorithms. Augmenting Path Algorithm. Augmenting Path Algorithm Augmening Pah Algorihm Greedy-algorihm: ar wih f (e) = everywhere find an - pah wih f (e) < c(e) on every edge augmen flow along he pah repea a long a poible The Reidual Graph From he graph G = (V, E,

More information

EE Control Systems LECTURE 2

EE Control Systems LECTURE 2 Copyrigh F.L. Lewi 999 All righ reerved EE 434 - Conrol Syem LECTURE REVIEW OF LAPLACE TRANSFORM LAPLACE TRANSFORM The Laplace ranform i very ueful in analyi and deign for yem ha are linear and ime-invarian

More information

Explicit form of global solution to stochastic logistic differential equation and related topics

Explicit form of global solution to stochastic logistic differential equation and related topics SAISICS, OPIMIZAION AND INFOMAION COMPUING Sa., Opim. Inf. Compu., Vol. 5, March 17, pp 58 64. Publihed online in Inernaional Academic Pre (www.iapre.org) Explici form of global oluion o ochaic logiic

More information

u(t) Figure 1. Open loop control system

u(t) Figure 1. Open loop control system Open loop conrol v cloed loop feedbac conrol The nex wo figure preen he rucure of open loop and feedbac conrol yem Figure how an open loop conrol yem whoe funcion i o caue he oupu y o follow he reference

More information

The Residual Graph. 12 Augmenting Path Algorithms. Augmenting Path Algorithm. Augmenting Path Algorithm

The Residual Graph. 12 Augmenting Path Algorithms. Augmenting Path Algorithm. Augmenting Path Algorithm Augmening Pah Algorihm Greedy-algorihm: ar wih f (e) = everywhere find an - pah wih f (e) < c(e) on every edge augmen flow along he pah repea a long a poible The Reidual Graph From he graph G = (V, E,

More information

Problem Set If all directed edges in a network have distinct capacities, then there is a unique maximum flow.

Problem Set If all directed edges in a network have distinct capacities, then there is a unique maximum flow. CSE 202: Deign and Analyi of Algorihm Winer 2013 Problem Se 3 Inrucor: Kamalika Chaudhuri Due on: Tue. Feb 26, 2013 Inrucion For your proof, you may ue any lower bound, algorihm or daa rucure from he ex

More information

FIXED POINTS AND STABILITY IN NEUTRAL DIFFERENTIAL EQUATIONS WITH VARIABLE DELAYS

FIXED POINTS AND STABILITY IN NEUTRAL DIFFERENTIAL EQUATIONS WITH VARIABLE DELAYS PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 136, Number 3, March 28, Page 99 918 S 2-9939(7)989-2 Aricle elecronically publihed on November 3, 27 FIXED POINTS AND STABILITY IN NEUTRAL DIFFERENTIAL

More information

To become more mathematically correct, Circuit equations are Algebraic Differential equations. from KVL, KCL from the constitutive relationship

To become more mathematically correct, Circuit equations are Algebraic Differential equations. from KVL, KCL from the constitutive relationship Laplace Tranform (Lin & DeCarlo: Ch 3) ENSC30 Elecric Circui II The Laplace ranform i an inegral ranformaion. I ranform: f ( ) F( ) ime variable complex variable From Euler > Lagrange > Laplace. Hence,

More information

CHAPTER 7: SECOND-ORDER CIRCUITS

CHAPTER 7: SECOND-ORDER CIRCUITS EEE5: CI RCUI T THEORY CHAPTER 7: SECOND-ORDER CIRCUITS 7. Inroducion Thi chaper conider circui wih wo orage elemen. Known a econd-order circui becaue heir repone are decribed by differenial equaion ha

More information

18.03SC Unit 3 Practice Exam and Solutions

18.03SC Unit 3 Practice Exam and Solutions Sudy Guide on Sep, Dela, Convoluion, Laplace You can hink of he ep funcion u() a any nice mooh funcion which i for < a and for > a, where a i a poiive number which i much maller han any ime cale we care

More information

Physics 127b: Statistical Mechanics. Fokker-Planck Equation. Time Evolution

Physics 127b: Statistical Mechanics. Fokker-Planck Equation. Time Evolution Physics 7b: Saisical Mechanics Fokker-Planck Equaion The Langevin equaion approach o he evoluion of he velociy disribuion for he Brownian paricle migh leave you uncomforable. A more formal reamen of his

More information

1 Motivation and Basic Definitions

1 Motivation and Basic Definitions CSCE : Deign and Analyi of Algorihm Noe on Max Flow Fall 20 (Baed on he preenaion in Chaper 26 of Inroducion o Algorihm, 3rd Ed. by Cormen, Leieron, Rive and Sein.) Moivaion and Baic Definiion Conider

More information

Flow networks. Flow Networks. A flow on a network. Flow networks. The maximum-flow problem. Introduction to Algorithms, Lecture 22 December 5, 2001

Flow networks. Flow Networks. A flow on a network. Flow networks. The maximum-flow problem. Introduction to Algorithms, Lecture 22 December 5, 2001 CS 545 Flow Nework lon Efra Slide courey of Charle Leieron wih mall change by Carola Wenk Flow nework Definiion. flow nework i a direced graph G = (V, E) wih wo diinguihed verice: a ource and a ink. Each

More information

23.2. Representing Periodic Functions by Fourier Series. Introduction. Prerequisites. Learning Outcomes

23.2. Representing Periodic Functions by Fourier Series. Introduction. Prerequisites. Learning Outcomes Represening Periodic Funcions by Fourier Series 3. Inroducion In his Secion we show how a periodic funcion can be expressed as a series of sines and cosines. We begin by obaining some sandard inegrals

More information

Discussion Session 2 Constant Acceleration/Relative Motion Week 03

Discussion Session 2 Constant Acceleration/Relative Motion Week 03 PHYS 100 Dicuion Seion Conan Acceleraion/Relaive Moion Week 03 The Plan Today you will work wih your group explore he idea of reference frame (i.e. relaive moion) and moion wih conan acceleraion. You ll

More information

Notes on cointegration of real interest rates and real exchange rates. ρ (2)

Notes on cointegration of real interest rates and real exchange rates. ρ (2) Noe on coinegraion of real inere rae and real exchange rae Charle ngel, Univeriy of Wiconin Le me ar wih he obervaion ha while he lieraure (mo prominenly Meee and Rogoff (988) and dion and Paul (993))

More information

Rough Paths and its Applications in Machine Learning

Rough Paths and its Applications in Machine Learning Pah ignaure Machine learning applicaion Rough Pah and i Applicaion in Machine Learning July 20, 2017 Rough Pah and i Applicaion in Machine Learning Pah ignaure Machine learning applicaion Hiory and moivaion

More information

Vehicle Arrival Models : Headway

Vehicle Arrival Models : Headway Chaper 12 Vehicle Arrival Models : Headway 12.1 Inroducion Modelling arrival of vehicle a secion of road is an imporan sep in raffic flow modelling. I has imporan applicaion in raffic flow simulaion where

More information

Physics 235 Chapter 2. Chapter 2 Newtonian Mechanics Single Particle

Physics 235 Chapter 2. Chapter 2 Newtonian Mechanics Single Particle Chaper 2 Newonian Mechanics Single Paricle In his Chaper we will review wha Newon s laws of mechanics ell us abou he moion of a single paricle. Newon s laws are only valid in suiable reference frames,

More information

CHAPTER 7. Definition and Properties. of Laplace Transforms

CHAPTER 7. Definition and Properties. of Laplace Transforms SERIES OF CLSS NOTES FOR 5-6 TO INTRODUCE LINER ND NONLINER PROBLEMS TO ENGINEERS, SCIENTISTS, ND PPLIED MTHEMTICINS DE CLSS NOTES COLLECTION OF HNDOUTS ON SCLR LINER ORDINRY DIFFERENTIL EQUTIONS (ODE")

More information

Chapter 6. Laplace Transforms

Chapter 6. Laplace Transforms Chaper 6. Laplace Tranform Kreyzig by YHLee;45; 6- An ODE i reduced o an algebraic problem by operaional calculu. The equaion i olved by algebraic manipulaion. The reul i ranformed back for he oluion of

More information

NECESSARY AND SUFFICIENT CONDITIONS FOR LATENT SEPARABILITY

NECESSARY AND SUFFICIENT CONDITIONS FOR LATENT SEPARABILITY NECESSARY AND SUFFICIENT CONDITIONS FOR LATENT SEPARABILITY Ian Crawford THE INSTITUTE FOR FISCAL STUDIES DEPARTMENT OF ECONOMICS, UCL cemmap working paper CWP02/04 Neceary and Sufficien Condiion for Laen

More information

ARTIFICIAL INTELLIGENCE. Markov decision processes

ARTIFICIAL INTELLIGENCE. Markov decision processes INFOB2KI 2017-2018 Urech Univeriy The Neherland ARTIFICIAL INTELLIGENCE Markov deciion procee Lecurer: Silja Renooij Thee lide are par of he INFOB2KI Coure Noe available from www.c.uu.nl/doc/vakken/b2ki/chema.hml

More information

U T,0. t = X t t T X T. (1)

U T,0. t = X t t T X T. (1) Gauian bridge Dario Gabarra 1, ommi Soinen 2, and Eko Valkeila 3 1 Deparmen of Mahemaic and Saiic, PO Box 68, 14 Univeriy of Helinki,Finland dariogabarra@rnihelinkifi 2 Deparmen of Mahemaic and Saiic,

More information

CSC 364S Notes University of Toronto, Spring, The networks we will consider are directed graphs, where each edge has associated with it

CSC 364S Notes University of Toronto, Spring, The networks we will consider are directed graphs, where each edge has associated with it CSC 36S Noe Univeriy of Torono, Spring, 2003 Flow Algorihm The nework we will conider are direced graph, where each edge ha aociaed wih i a nonnegaive capaciy. The inuiion i ha if edge (u; v) ha capaciy

More information

13.1 Accelerating Objects

13.1 Accelerating Objects 13.1 Acceleraing Objec A you learned in Chaper 12, when you are ravelling a a conan peed in a raigh line, you have uniform moion. However, mo objec do no ravel a conan peed in a raigh line o hey do no

More information

Physics 240: Worksheet 16 Name

Physics 240: Worksheet 16 Name Phyic 4: Workhee 16 Nae Non-unifor circular oion Each of hee proble involve non-unifor circular oion wih a conan α. (1) Obain each of he equaion of oion for non-unifor circular oion under a conan acceleraion,

More information

Exponential Sawtooth

Exponential Sawtooth ECPE 36 HOMEWORK 3: PROPERTIES OF THE FOURIER TRANSFORM SOLUTION. Exponenial Sawooh: The eaie way o do hi problem i o look a he Fourier ranform of a ingle exponenial funcion, () = exp( )u(). From he able

More information

Network Flows: Introduction & Maximum Flow

Network Flows: Introduction & Maximum Flow CSC 373 - lgorihm Deign, nalyi, and Complexiy Summer 2016 Lalla Mouaadid Nework Flow: Inroducion & Maximum Flow We now urn our aenion o anoher powerful algorihmic echnique: Local Search. In a local earch

More information

1 CHAPTER 14 LAPLACE TRANSFORMS

1 CHAPTER 14 LAPLACE TRANSFORMS CHAPTER 4 LAPLACE TRANSFORMS 4 nroducion f x) i a funcion of x, where x lie in he range o, hen he funcion p), defined by p) px e x) dx, 4 i called he Laplace ranform of x) However, in hi chaper, where

More information

18 Extensions of Maximum Flow

18 Extensions of Maximum Flow Who are you?" aid Lunkwill, riing angrily from hi ea. Wha do you wan?" I am Majikhie!" announced he older one. And I demand ha I am Vroomfondel!" houed he younger one. Majikhie urned on Vroomfondel. I

More information

Let. x y. denote a bivariate time series with zero mean.

Let. x y. denote a bivariate time series with zero mean. Linear Filer Le x y : T denoe a bivariae ime erie wih zero mean. Suppoe ha he ime erie {y : T} i conruced a follow: y a x The ime erie {y : T} i aid o be conruced from {x : T} by mean of a Linear Filer.

More information

FLAT CYCLOTOMIC POLYNOMIALS OF ORDER FOUR AND HIGHER

FLAT CYCLOTOMIC POLYNOMIALS OF ORDER FOUR AND HIGHER #A30 INTEGERS 10 (010), 357-363 FLAT CYCLOTOMIC POLYNOMIALS OF ORDER FOUR AND HIGHER Nahan Kaplan Deparmen of Mahemaic, Harvard Univeriy, Cambridge, MA nkaplan@mah.harvard.edu Received: 7/15/09, Revied:

More information

Linear Response Theory: The connection between QFT and experiments

Linear Response Theory: The connection between QFT and experiments Phys540.nb 39 3 Linear Response Theory: The connecion beween QFT and experimens 3.1. Basic conceps and ideas Q: How do we measure he conduciviy of a meal? A: we firs inroduce a weak elecric field E, and

More information

5.2 GRAPHICAL VELOCITY ANALYSIS Polygon Method

5.2 GRAPHICAL VELOCITY ANALYSIS Polygon Method ME 352 GRHICL VELCITY NLYSIS 52 GRHICL VELCITY NLYSIS olygon Mehod Velociy analyi form he hear of kinemaic and dynamic of mechanical yem Velociy analyi i uually performed following a poiion analyi; ie,

More information

NEUTRON DIFFUSION THEORY

NEUTRON DIFFUSION THEORY NEUTRON DIFFUSION THEORY M. Ragheb 4//7. INTRODUCTION The diffuion heory model of neuron ranpor play a crucial role in reacor heory ince i i imple enough o allow cienific inigh, and i i ufficienly realiic

More information

EE202 Circuit Theory II

EE202 Circuit Theory II EE202 Circui Theory II 2017-2018, Spring Dr. Yılmaz KALKAN I. Inroducion & eview of Fir Order Circui (Chaper 7 of Nilon - 3 Hr. Inroducion, C and L Circui, Naural and Sep epone of Serie and Parallel L/C

More information

Time Varying Multiserver Queues. W. A. Massey. Murray Hill, NJ Abstract

Time Varying Multiserver Queues. W. A. Massey. Murray Hill, NJ Abstract Waiing Time Aympoic for Time Varying Mulierver ueue wih Abonmen Rerial A. Melbaum Technion Iniue Haifa, 3 ISRAEL avim@x.echnion.ac.il M. I. Reiman Bell Lab, Lucen Technologie Murray Hill, NJ 7974 U.S.A.

More information

ON FRACTIONAL ORNSTEIN-UHLENBECK PROCESSES

ON FRACTIONAL ORNSTEIN-UHLENBECK PROCESSES Communicaion on Sochaic Analyi Vol. 5, No. 1 211 121-133 Serial Publicaion www.erialpublicaion.com ON FRACTIONAL ORNSTEIN-UHLENBECK PROCESSES TERHI KAARAKKA AND PAAVO SALMINEN Abrac. In hi paper we udy

More information

Chapter 2. First Order Scalar Equations

Chapter 2. First Order Scalar Equations Chaper. Firs Order Scalar Equaions We sar our sudy of differenial equaions in he same way he pioneers in his field did. We show paricular echniques o solve paricular ypes of firs order differenial equaions.

More information

The multisubset sum problem for finite abelian groups

The multisubset sum problem for finite abelian groups Alo available a hp://amc-journal.eu ISSN 1855-3966 (prined edn.), ISSN 1855-3974 (elecronic edn.) ARS MATHEMATICA CONTEMPORANEA 8 (2015) 417 423 The muliube um problem for finie abelian group Amela Muraović-Ribić

More information

Mon Apr 2: Laplace transform and initial value problems like we studied in Chapter 5

Mon Apr 2: Laplace transform and initial value problems like we studied in Chapter 5 Mah 225-4 Week 2 April 2-6 coninue.-.3; alo cover par of.4-.5, EP 7.6 Mon Apr 2:.-.3 Laplace ranform and iniial value problem like we udied in Chaper 5 Announcemen: Warm-up Exercie: Recall, The Laplace

More information

Main Reference: Sections in CLRS.

Main Reference: Sections in CLRS. Maximum Flow Reied 09/09/200 Main Reference: Secion 26.-26. in CLRS. Inroducion Definiion Muli-Source Muli-Sink The Ford-Fulkeron Mehod Reidual Nework Augmening Pah The Max-Flow Min-Cu Theorem The Edmond-Karp

More information

Research Article Existence and Uniqueness of Solutions for a Class of Nonlinear Stochastic Differential Equations

Research Article Existence and Uniqueness of Solutions for a Class of Nonlinear Stochastic Differential Equations Hindawi Publihing Corporaion Abrac and Applied Analyi Volume 03, Aricle ID 56809, 7 page hp://dx.doi.org/0.55/03/56809 Reearch Aricle Exience and Uniquene of Soluion for a Cla of Nonlinear Sochaic Differenial

More information

Buckling of a structure means failure due to excessive displacements (loss of structural stiffness), and/or

Buckling of a structure means failure due to excessive displacements (loss of structural stiffness), and/or Buckling Buckling of a rucure mean failure due o exceive diplacemen (lo of rucural iffne), and/or lo of abiliy of an equilibrium configuraion of he rucure The rule of humb i ha buckling i conidered a mode

More information

Math 10B: Mock Mid II. April 13, 2016

Math 10B: Mock Mid II. April 13, 2016 Name: Soluions Mah 10B: Mock Mid II April 13, 016 1. ( poins) Sae, wih jusificaion, wheher he following saemens are rue or false. (a) If a 3 3 marix A saisfies A 3 A = 0, hen i canno be inverible. True.

More information

Average Case Lower Bounds for Monotone Switching Networks

Average Case Lower Bounds for Monotone Switching Networks Average Cae Lower Bound for Monoone Swiching Nework Yuval Filmu, Toniann Piai, Rober Robere, Sephen Cook Deparmen of Compuer Science Univeriy of Torono Monoone Compuaion (Refreher) Monoone circui were

More information

6.302 Feedback Systems Recitation : Phase-locked Loops Prof. Joel L. Dawson

6.302 Feedback Systems Recitation : Phase-locked Loops Prof. Joel L. Dawson 6.32 Feedback Syem Phae-locked loop are a foundaional building block for analog circui deign, paricularly for communicaion circui. They provide a good example yem for hi cla becaue hey are an excellen

More information

Math 2142 Exam 1 Review Problems. x 2 + f (0) 3! for the 3rd Taylor polynomial at x = 0. To calculate the various quantities:

Math 2142 Exam 1 Review Problems. x 2 + f (0) 3! for the 3rd Taylor polynomial at x = 0. To calculate the various quantities: Mah 4 Eam Review Problems Problem. Calculae he 3rd Taylor polynomial for arcsin a =. Soluion. Le f() = arcsin. For his problem, we use he formula f() + f () + f ()! + f () 3! for he 3rd Taylor polynomial

More information

Convergence of the gradient algorithm for linear regression models in the continuous and discrete time cases

Convergence of the gradient algorithm for linear regression models in the continuous and discrete time cases Convergence of he gradien algorihm for linear regreion model in he coninuou and dicree ime cae Lauren Praly To cie hi verion: Lauren Praly. Convergence of he gradien algorihm for linear regreion model

More information

Final Spring 2007

Final Spring 2007 .615 Final Spring 7 Overview The purpose of he final exam is o calculae he MHD β limi in a high-bea oroidal okamak agains he dangerous n = 1 exernal ballooning-kink mode. Effecively, his corresponds o

More information

CONTROL SYSTEMS. Chapter 10 : State Space Response

CONTROL SYSTEMS. Chapter 10 : State Space Response CONTROL SYSTEMS Chaper : Sae Space Repone GATE Objecive & Numerical Type Soluion Queion 5 [GATE EE 99 IIT-Bombay : Mark] Conider a econd order yem whoe ae pace repreenaion i of he form A Bu. If () (),

More information

6. Stochastic calculus with jump processes

6. Stochastic calculus with jump processes A) Trading sraegies (1/3) Marke wih d asses S = (S 1,, S d ) A rading sraegy can be modelled wih a vecor φ describing he quaniies invesed in each asse a each insan : φ = (φ 1,, φ d ) The value a of a porfolio

More information

Graphs III - Network Flow

Graphs III - Network Flow Graph III - Nework Flow Flow nework eup graph G=(V,E) edge capaciy w(u,v) 0 - if edge doe no exi, hen w(u,v)=0 pecial verice: ource verex ; ink verex - no edge ino and no edge ou of Aume every verex v

More information

LAPLACE TRANSFORM AND TRANSFER FUNCTION

LAPLACE TRANSFORM AND TRANSFER FUNCTION CHBE320 LECTURE V LAPLACE TRANSFORM AND TRANSFER FUNCTION Professor Dae Ryook Yang Spring 2018 Dep. of Chemical and Biological Engineering 5-1 Road Map of he Lecure V Laplace Transform and Transfer funcions

More information

2. VECTORS. R Vectors are denoted by bold-face characters such as R, V, etc. The magnitude of a vector, such as R, is denoted as R, R, V

2. VECTORS. R Vectors are denoted by bold-face characters such as R, V, etc. The magnitude of a vector, such as R, is denoted as R, R, V ME 352 VETS 2. VETS Vecor algebra form he mahemaical foundaion for kinemaic and dnamic. Geomer of moion i a he hear of boh he kinemaic and dnamic of mechanical em. Vecor anali i he imehonored ool for decribing

More information

Price of Stability and Introduction to Mechanism Design

Price of Stability and Introduction to Mechanism Design Algorihmic Game Theory Summer 2017, Week 5 ETH Zürich Price of Sabiliy and Inroducion o Mechanim Deign Paolo Penna Thi i he lecure where we ar deigning yem which involve elfih player. Roughly peaking,

More information

EXERCISES FOR SECTION 1.5

EXERCISES FOR SECTION 1.5 1.5 Exisence and Uniqueness of Soluions 43 20. 1 v c 21. 1 v c 1 2 4 6 8 10 1 2 2 4 6 8 10 Graph of approximae soluion obained using Euler s mehod wih = 0.1. Graph of approximae soluion obained using Euler

More information

CHAPTER. Forced Equations and Systems { } ( ) ( ) 8.1 The Laplace Transform and Its Inverse. Transforms from the Definition.

CHAPTER. Forced Equations and Systems { } ( ) ( ) 8.1 The Laplace Transform and Its Inverse. Transforms from the Definition. CHAPTER 8 Forced Equaion and Syem 8 The aplace Tranform and I Invere Tranform from he Definiion 5 5 = b b {} 5 = 5e d = lim5 e = ( ) b {} = e d = lim e + e d b = (inegraion by par) = = = = b b ( ) ( )

More information

23.5. Half-Range Series. Introduction. Prerequisites. Learning Outcomes

23.5. Half-Range Series. Introduction. Prerequisites. Learning Outcomes Half-Range Series 2.5 Inroducion In his Secion we address he following problem: Can we find a Fourier series expansion of a funcion defined over a finie inerval? Of course we recognise ha such a funcion

More information

An introduction to the (local) martingale problem

An introduction to the (local) martingale problem An inroducion o he (local) maringale problem Chri Janjigian Ocober 14, 214 Abrac Thee are my preenaion noe for a alk in he Univeriy of Wiconin - Madion graduae probabiliy eminar. Thee noe are primarily

More information

On the Exponential Operator Functions on Time Scales

On the Exponential Operator Functions on Time Scales dvance in Dynamical Syem pplicaion ISSN 973-5321, Volume 7, Number 1, pp. 57 8 (212) hp://campu.m.edu/ada On he Exponenial Operaor Funcion on Time Scale laa E. Hamza Cairo Univeriy Deparmen of Mahemaic

More information

Systems of nonlinear ODEs with a time singularity in the right-hand side

Systems of nonlinear ODEs with a time singularity in the right-hand side Syem of nonlinear ODE wih a ime ingulariy in he righ-hand ide Jana Burkoová a,, Irena Rachůnková a, Svaolav Saněk a, Ewa B. Weinmüller b, Sefan Wurm b a Deparmen of Mahemaical Analyi and Applicaion of

More information

MODULE 3 FUNCTION OF A RANDOM VARIABLE AND ITS DISTRIBUTION LECTURES PROBABILITY DISTRIBUTION OF A FUNCTION OF A RANDOM VARIABLE

MODULE 3 FUNCTION OF A RANDOM VARIABLE AND ITS DISTRIBUTION LECTURES PROBABILITY DISTRIBUTION OF A FUNCTION OF A RANDOM VARIABLE Topics MODULE 3 FUNCTION OF A RANDOM VARIABLE AND ITS DISTRIBUTION LECTURES 2-6 3. FUNCTION OF A RANDOM VARIABLE 3.2 PROBABILITY DISTRIBUTION OF A FUNCTION OF A RANDOM VARIABLE 3.3 EXPECTATION AND MOMENTS

More information

Additional Methods for Solving DSGE Models

Additional Methods for Solving DSGE Models Addiional Mehod for Solving DSGE Model Karel Meren, Cornell Univeriy Reference King, R. G., Ploer, C. I. & Rebelo, S. T. (1988), Producion, growh and buine cycle: I. he baic neoclaical model, Journal of

More information

The Asymptotic Behavior of Nonoscillatory Solutions of Some Nonlinear Dynamic Equations on Time Scales

The Asymptotic Behavior of Nonoscillatory Solutions of Some Nonlinear Dynamic Equations on Time Scales Advances in Dynamical Sysems and Applicaions. ISSN 0973-5321 Volume 1 Number 1 (2006, pp. 103 112 c Research India Publicaions hp://www.ripublicaion.com/adsa.hm The Asympoic Behavior of Nonoscillaory Soluions

More information

FUZZY n-inner PRODUCT SPACE

FUZZY n-inner PRODUCT SPACE Bull. Korean Mah. Soc. 43 (2007), No. 3, pp. 447 459 FUZZY n-inner PRODUCT SPACE Srinivaan Vijayabalaji and Naean Thillaigovindan Reprined from he Bullein of he Korean Mahemaical Sociey Vol. 43, No. 3,

More information

SOLUTIONS TO ECE 3084

SOLUTIONS TO ECE 3084 SOLUTIONS TO ECE 384 PROBLEM 2.. For each sysem below, specify wheher or no i is: (i) memoryless; (ii) causal; (iii) inverible; (iv) linear; (v) ime invarian; Explain your reasoning. If he propery is no

More information

MATH 4330/5330, Fourier Analysis Section 6, Proof of Fourier s Theorem for Pointwise Convergence

MATH 4330/5330, Fourier Analysis Section 6, Proof of Fourier s Theorem for Pointwise Convergence MATH 433/533, Fourier Analysis Secion 6, Proof of Fourier s Theorem for Poinwise Convergence Firs, some commens abou inegraing periodic funcions. If g is a periodic funcion, g(x + ) g(x) for all real x,

More information

u(x) = e x 2 y + 2 ) Integrate and solve for x (1 + x)y + y = cos x Answer: Divide both sides by 1 + x and solve for y. y = x y + cos x

u(x) = e x 2 y + 2 ) Integrate and solve for x (1 + x)y + y = cos x Answer: Divide both sides by 1 + x and solve for y. y = x y + cos x . 1 Mah 211 Homework #3 February 2, 2001 2.4.3. y + (2/x)y = (cos x)/x 2 Answer: Compare y + (2/x) y = (cos x)/x 2 wih y = a(x)x + f(x)and noe ha a(x) = 2/x. Consequenly, an inegraing facor is found wih

More information

Section 3.5 Nonhomogeneous Equations; Method of Undetermined Coefficients

Section 3.5 Nonhomogeneous Equations; Method of Undetermined Coefficients Secion 3.5 Nonhomogeneous Equaions; Mehod of Undeermined Coefficiens Key Terms/Ideas: Linear Differenial operaor Nonlinear operaor Second order homogeneous DE Second order nonhomogeneous DE Soluion o homogeneous

More information

Admin MAX FLOW APPLICATIONS. Flow graph/networks. Flow constraints 4/30/13. CS lunch today Grading. in-flow = out-flow for every vertex (except s, t)

Admin MAX FLOW APPLICATIONS. Flow graph/networks. Flow constraints 4/30/13. CS lunch today Grading. in-flow = out-flow for every vertex (except s, t) /0/ dmin lunch oday rading MX LOW PPLIION 0, pring avid Kauchak low graph/nework low nework direced, weighed graph (V, ) poiive edge weigh indicaing he capaciy (generally, aume ineger) conain a ingle ource

More information

KEY. Math 334 Midterm I Fall 2008 sections 001 and 003 Instructor: Scott Glasgow

KEY. Math 334 Midterm I Fall 2008 sections 001 and 003 Instructor: Scott Glasgow 1 KEY Mah 4 Miderm I Fall 8 secions 1 and Insrucor: Sco Glasgow Please do NOT wrie on his eam. No credi will be given for such work. Raher wrie in a blue book, or on our own paper, preferabl engineering

More information

ANSWERS TO ODD NUMBERED EXERCISES IN CHAPTER

ANSWERS TO ODD NUMBERED EXERCISES IN CHAPTER John Riley 6 December 200 NWER TO ODD NUMBERED EXERCIE IN CHPTER 7 ecion 7 Exercie 7-: m m uppoe ˆ, m=,, M (a For M = 2, i i eay o how ha I implie I From I, for any probabiliy vecor ( p, p 2, 2 2 ˆ ( p,

More information

CS4445/9544 Analysis of Algorithms II Solution for Assignment 1

CS4445/9544 Analysis of Algorithms II Solution for Assignment 1 Conider he following flow nework CS444/944 Analyi of Algorihm II Soluion for Aignmen (0 mark) In he following nework a minimum cu ha capaciy 0 Eiher prove ha hi aemen i rue, or how ha i i fale Uing he

More information

Chapter 6. Laplace Transforms

Chapter 6. Laplace Transforms 6- Chaper 6. Laplace Tranform 6.4 Shor Impule. Dirac Dela Funcion. Parial Fracion 6.5 Convoluion. Inegral Equaion 6.6 Differeniaion and Inegraion of Tranform 6.7 Syem of ODE 6.4 Shor Impule. Dirac Dela

More information

Macroeconomics 1. Ali Shourideh. Final Exam

Macroeconomics 1. Ali Shourideh. Final Exam 4780 - Macroeconomic 1 Ali Shourideh Final Exam Problem 1. A Model of On-he-Job Search Conider he following verion of he McCall earch model ha allow for on-he-job-earch. In paricular, uppoe ha ime i coninuou

More information

Hamilton- J acobi Equation: Weak S olution We continue the study of the Hamilton-Jacobi equation:

Hamilton- J acobi Equation: Weak S olution We continue the study of the Hamilton-Jacobi equation: M ah 5 7 Fall 9 L ecure O c. 4, 9 ) Hamilon- J acobi Equaion: Weak S oluion We coninue he sudy of he Hamilon-Jacobi equaion: We have shown ha u + H D u) = R n, ) ; u = g R n { = }. ). In general we canno

More information

Math 333 Problem Set #2 Solution 14 February 2003

Math 333 Problem Set #2 Solution 14 February 2003 Mah 333 Problem Se #2 Soluion 14 February 2003 A1. Solve he iniial value problem dy dx = x2 + e 3x ; 2y 4 y(0) = 1. Soluion: This is separable; we wrie 2y 4 dy = x 2 + e x dx and inegrae o ge The iniial

More information

TP B.2 Rolling resistance, spin resistance, and "ball turn"

TP B.2 Rolling resistance, spin resistance, and ball turn echnical proof TP B. olling reiance, pin reiance, and "ball urn" upporing: The Illuraed Principle of Pool and Billiard hp://billiard.coloae.edu by Daid G. Alciaore, PhD, PE ("Dr. Dae") echnical proof originally

More information

Ordinary dierential equations

Ordinary dierential equations Chaper 5 Ordinary dierenial equaions Conens 5.1 Iniial value problem........................... 31 5. Forward Euler's mehod......................... 3 5.3 Runge-Kua mehods.......................... 36

More information

Reminder: Flow Networks

Reminder: Flow Networks 0/0/204 Ma/CS 6a Cla 4: Variou (Flow) Execie Reminder: Flow Nework A flow nework i a digraph G = V, E, ogeher wih a ource verex V, a ink verex V, and a capaciy funcion c: E N. Capaciy Source 7 a b c d

More information

Chapter 7 Response of First-order RL and RC Circuits

Chapter 7 Response of First-order RL and RC Circuits Chaper 7 Response of Firs-order RL and RC Circuis 7.- The Naural Response of RL and RC Circuis 7.3 The Sep Response of RL and RC Circuis 7.4 A General Soluion for Sep and Naural Responses 7.5 Sequenial

More information

Temperature control for simulated annealing

Temperature control for simulated annealing PHYSICAL REVIEW E, VOLUME 64, 46127 Temperaure conrol for imulaed annealing Toyonori Munakaa 1 and Yauyuki Nakamura 2 1 Deparmen of Applied Mahemaic and Phyic, Kyoo Univeriy, Kyoo 66, Japan 2 Deparmen

More information

Chapter 9 - The Laplace Transform

Chapter 9 - The Laplace Transform Chaper 9 - The Laplace Tranform Selece Soluion. Skech he pole-zero plo an region of convergence (if i exi) for hee ignal. ω [] () 8 (a) x e u = 8 ROC σ ( ) 3 (b) x e co π u ω [] ( ) () (c) x e u e u ROC

More information

Matrix Versions of Some Refinements of the Arithmetic-Geometric Mean Inequality

Matrix Versions of Some Refinements of the Arithmetic-Geometric Mean Inequality Marix Versions of Some Refinemens of he Arihmeic-Geomeric Mean Inequaliy Bao Qi Feng and Andrew Tonge Absrac. We esablish marix versions of refinemens due o Alzer ], Carwrigh and Field 4], and Mercer 5]

More information