Explicit bounds for the return probability of simple random walk
|
|
- Catherine Doyle
- 5 years ago
- Views:
Transcription
1 Explct bouns for the return probablty of smple ranom walk The runnng hea shoul be the same as the ttle.) Karen Ball Jacob Sterbenz Contact nformaton: Karen Ball IMA Unversty of Mnnesota 4 Ln Hall, 7 Church St. SE Mnneapols, MN ) January 9, 4 Abstract We gve an exact computaton of the secon orer term n the asymptotc expanson of the return probablty, Pn, ), of a smple ranom walk on the -mensonal cubc lattce. We also gve an explct boun on the remaner. In partcular, we show that Pn, ) < ` 4πn / where n M s explctly gven. Key wors an phrases. smple ranom walk, ranom walk, return probablty, asymptotc probablty Introucton We stuy here the asymptotc propertes of the smple ranom walk on a mensonal lattce. That s, the sngle step probablty s gven by the formula: { P, j) =, f j =;, otherwse. Insttute for Mathematcs an ts Applcatons, Unversty of Mnnesota, Mnneapols, Mnnesota, kball@ma.umn.eu. Department of Mathematcs, Prnceton Unversty, Prnceton, New Jersey, sterbenz@math.prnceton.eu.
2 Usng ths notaton, one can wrte the probablty of startng at lattce pont an enng at j after n steps of the ranom walk as the convoluton of P wth tself n tmes: Pn, j) = [P ] n, j). In partcular, the probablty of startng at an returnng to the orgn after n steps s gven by the formula: P n, ) = n)! ) n n! n! k +...+k =n ) n!. k!... k! Ths s easly seen by a countng argument, or by evaluatng the constant term n the seres: [ n [ P ), )]n Θ) = e θ + e θ)]..) By orthogonalty, one can also compute the constant term on the rght han se of.) by ntegraton of the entre expresson over the mensonal torus T. That s, evaluaton of the ntegral: = Pn, ) = π) Θ [,π] ) n cos θ Θ..) By Taylor expanng the ntegran of.), one can show that one has the asymptotc: ) / Pn, ). 4πn Ths result s orgnally ue to Pólya, an an account can be foun, for nstance, n [4]. Recently, C. Rtzmann [3] has gven a local central lmt theorem for the strbuton Pnx, y) n the case of farly general ranom walks wth boune step sze on Z. The metho of proof s to agan Taylor expan ntegrals of the form.) whch arse from the Fourer transform of the strbuton functon. Our purpose here s to gve a smple an explct calculaton of a boun for) the ntegral.), whch nclues bouns for all the constants nvolve. Ths s partal progress on a conjecture of Russ Lyons, that n fact the followng boun hols: ) / Pn, ) for all,n..3) 4πn Ths s not ffcult to show for =,, so we concentrate on the case where 3. We prove here that for each fxe, fn M, form suffcently large, the nequalty n.3) s satsfe. Computer calculaton can be then be use to check.3) for the frst M ) terms for a fxe menson. Inee, we have
3 verfe ths for mensons up to an nclung =6. Ths work s use by Felker an Lyons n [] to prove rgorous lower bouns for the followng thermoynamc lmt. Let G n be the graph nuce by the cube of se length n n the -mensonal hypercubc lattce Z an let τg n ) be the number of spannng trees of G n. Then efne h = lm n n ln [ τg n ) ]. Felker an Lyons estmate h usng the followng formula: h =ln) n= Pn, )/n. Snce the terms of the summaton are all nonnegatve, a proof of nequalty.3 gves a metho for computng a rgorous lower boun for h.thus,ourresults can be use to prove a lower boun up to =6. In ths paper, we wll use the followng strct O notaton: hx) = O M fx)), to mean that hx) M fx). Ths notaton follows obvous rules for atons an multplcatons. We wll show that: Proposton. For all n an n, one has the boun: ) [ / Pn, ) 4πn 8n + 7 ) ] +) 4n + + n ) e n..4) Remark. In partcular, the expanson.4) shows that one has Pn, ) < / 4πn) when n M for an M whch can be rea off from the above formula. Ignorng the exponental error for a moment, we see that we nee to at least take n 7 4 +). Hence, M s of the orer 3.When = 3, one sees that the top term n the asymptotc s guarantee to take over at the pont n 79. It s lkely that ths number can be mprove by at least a factor of by tweakng 3
4 the analyss, an wll ncate how ths can be one as we go along. Of course we also nee to regar the exponental error term n the expanson.4), but t s easly seen that ths falls away quckly. In fact, t suffces to tack on one more unt to get n 7 4 +)+ to cover the exponental error. Ths can be seen as follows. We nee to show that for n 7 4 +)+,wehave: ) [ / 4πn 8n + 7 ) ] +) + + ) e n. 4n n Multplyng through by 4n 4πn ) /, estmatng + / n) by, an usng the assumton that n 7 4 +)+,wegetthattsuffcestoshowthatfor approprate an n, 8n ) / 4πn e n/..5) By takng a ervatve, t s easy to show that for fxe ths s a ecreasng functon of n for n n our range. Therefore, t s enough to prove the nequalty n.5) when n = 3 snce 3 < ) +, whch s the smallest value of n n our range) : 8 5 4π ) / e..6) To prove ths, we take another ervatve an show that the left-han se s ecreasng n when 3. Therefore, t suffces to check that.6) hols when = 3, whch t oes. As we have alreay mentone, for n< ) +, computer calculaton can be use to verfy.3) for a fxe menson. We have one ths for = 3, 4, 5, 6. In our analyss, we o not try to rectly compute the ntegral.), but nstea employ a carefully chosen substtute whch s a one mensonal ntegral that bouns the relevant part of).) whle at the same tme t preserves the frst two terms n the asymptotc expanson of.). It shoul be observe that t s also possble to obtan an equalty n.4) by rectly ealng wth.), but the computatons requre woul become qute a bt more nvolve. The man computaton We start wth the ntegral: ) n I = π) cos θ Θ. Θ [ π,π] The man contrbutons to ths ntegral come from near where the ntegran s equal to. That s, moulo an exponental error, we nee only concern ourselves 4
5 wth the ponts,...,) an π,...,π). In fact, by symmetry, we nee only concern ourselves wth the nterval [ π, π ]. Ths allows us to wrte: I = π) Θ N [ π, π ] ) n cos θ ) ) n Θ +O,.) where N s a neghborhoo of the pont,...,) whch we wll explan n a moment. Rearrangng the frst term on the rght han se of.) above, usng the trgonometrc entty cos θ = sn θ, an a rescalng, we may wrte the ntegral as: I = π Θ N [ π 4, π 4 ] ) n sn θ Θ. Now, performng the substtuton u =snθ,wemaywrte: I = π ) n u N [, u u, ] u where N s the mage of N uner ths change of varable. We now choose N so that N s the ball of raus centere at the orgn. Notce that ths s consstent wth the remaner secon term) on the rght han se of.). The choce of raus of ntegraton s the sngle most mportant factor n obtanng boun constants n Proposton. In partcular, the constant of 7 n the thr orer asymptotcs of.4) can probably be mprove by at least a factor of by takng the raus of ntegraton to be smaller. Ths wll of course ncrease the sze of the exponental error. Now, a smple nucton shows that n the range we conser:. u u Ths allows us to boun: I < S π ) n u u u, u where S enotes the volume of the stanar unt sphere n R. Therefore, moulo an exponental error an some constants, we have reuce the problem of bounng Pn, ) to that of stuyng the one mensonal the ntegral: I 3 = u ) n u u u. It s mportant for us to pont out that, although we o not make t explct here, the asymptotc expanson for I 3 matches the asymptotc expanson of the 5
6 orgnal multmensonal ntegral I n the frst two terms. Therefore, the ntegral I 3 ncorporates the mechansm whch s responsble for the boun.3) at least for n suffcently large),.e. a negatve secon asymptotc, whle at the same tme t elmnates many of the error terms that woul come up by tryng to treat I rectly. Ths s the mportant pont of the analyss here. The bouns we wll prouce are as follows: Lemma. For n> an 3, one has that: ln ) I 3 = e n s s ) s + O 4 s 4 ) s..) Proof of Lemma. The entty.) s a straght forwar consequence of Taylor s theorem wth remaner an the followng mplct change of varables: u = e s. Explctly, one has the formulas: s = ln u ),.3) u = e s )..4) Wth ths change of varables an the help of the Taylor expanson: = + u u + O 3 u 4 ), u [, ], we may wrte: ln ) I 3 = e n s s e u ) s + ) s u + O 3 u 4 ) s. Our task s now to gve a Taylor wth remaner formula for the prouct of the last three functons n the ntegran above. For ths, t s useful to note that by the formula.3), one has the boun s 3 over the range of ntegraton. Ths follows from he estmate: ln ) + ), whch can be prove wth th the help of Taylorsformula wth remaner. Therefore, we have that s 3 4. Ths fact wll be use mplctly n all the strct O notaton that follows. We frst compute the Taylor expansons: 6
7 e s = s + O )s4 ),.5) e s = s + ) s 4 + O 3! ) 3s6 )..6) Next, we substtute.6) nto the change of varable formula.4) to see that we may wrte: u = s ) s + O 3! )s4 ),.7) where the expresson s O 3! )s4 ) comes from an alternatng ecreasng seres that s omnate by s. In partcular, we have that ths expresson les n the nterval [, ]. Ths allows us to use the Taylor expanson: x) = x + O as well as the entty: 6 4 ) )max{, } x ), x [, ],.8) ) s O 3! )s4 ) = O 3 s4 ), to set: x = s + O 3! )s4 ), n.8) an expan thngs out an collect terms together to wrte: u s ) = s + O s 4 )..9) Fnally, we can agan use the entty.7) as well as the fact that u = O s) to wrte: + u + O 3 u 4 ) = + s + O 3 s 4 )..) The esre result now follows from multplyng through the expressons on lnes.5),.9), an.) an then usng some rect computatons to show the entty: 7
8 ) s + O )s4 ) ) s + O s 4 ) + ) s + O 3 s 4 ) Ths completes the proof of formula.). = s + O 4 s 4 ).. Wrappng thngs up To get bouns on each of the ntegrals on the rght han se of.), we use the fact that: an ln ) e n s s s < e n s s s, ln ) as well as the fact that: e n s s O 4 s 4 ) s = O 4 e n ln ) s s + s < e n e n s ) s + s < e n e n s s + ) + s < e n )/ s s + e n A lttle further computaton shows that we now have: e n s s +3 s), ) e n s s + s..) π S I 3 < 4πn )/ 4πn )/ 4n )+ 7+) 4πn )/ ) 4n ) + π S R.H.S.).)..) 8
9 We recall the gamma formulas: e s s l s = Γ l + ), S = π Γ ), an use the followng boun whch for nstance follows easly from the ntegral formula 8.3) on p. 87 of []): Γx) < π) / x x e x x /, x, to compute that: π S R.H.S.).) = 4 π Γ ) ) / n e 3 Γ 4n ) / ) / 4e < e n π n + πn < e n n, n. ) n ) /+ + Γ 4n ) 4, n Substtutng ths last nequalty nto the rght han se of.), an usng the nequalty: < e, to tack on the exponental error from lne.), we obtan the result of Proposton. 3 Acknowlegements We wsh to thank Russ Lyons for suggestng ths problem, for reang early versons, an for sharng hs Mathematca coe wth us. K. Ball s work was supporte by an NSF VIGRE grant to Inana Unversty. J. Sterbenz s supporte by an NSF postoctoral fellowshp. References [] Felker, J. L., Lyons, R. 3). Hgh-precson entropy values for spannng trees n lattces. J. Phys. A. 36, no. 3, [] Olver, F. W. J. 974). Asymptotcs an specal functons. Computer Scence an Apple Mathematcs, Acaemc Press. ) ) 9
10 [3] Rtzmann, C. ). Goo Local Bouns for Smple Ranom Walks. avalable at [4] Sptzer, F. 976). Prncples of ranom walks. Secon eton. Grauate Texts n Mathematcs, Vol. 34. Sprnger-Verlag, New York-Heelberg.
A MULTIDIMENSIONAL ANALOGUE OF THE RADEMACHER-GAUSSIAN TAIL COMPARISON
A MULTIDIMENSIONAL ANALOGUE OF THE RADEMACHER-GAUSSIAN TAIL COMPARISON PIOTR NAYAR AND TOMASZ TKOCZ Abstract We prove a menson-free tal comparson between the Euclean norms of sums of nepenent ranom vectors
More informationA MULTIDIMENSIONAL ANALOGUE OF THE RADEMACHER-GAUSSIAN TAIL COMPARISON
A MULTIDIMENSIONAL ANALOGUE OF THE RADEMACHER-GAUSSIAN TAIL COMPARISON PIOTR NAYAR AND TOMASZ TKOCZ Abstract We prove a menson-free tal comparson between the Euclean norms of sums of nepenent ranom vectors
More informationMore metrics on cartesian products
More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of
More informationSection 8.3 Polar Form of Complex Numbers
80 Chapter 8 Secton 8 Polar Form of Complex Numbers From prevous classes, you may have encountered magnary numbers the square roots of negatve numbers and, more generally, complex numbers whch are the
More informationOn a one-parameter family of Riordan arrays and the weight distribution of MDS codes
On a one-parameter famly of Roran arrays an the weght strbuton of MDS coes Paul Barry School of Scence Waterfor Insttute of Technology Irelan pbarry@wte Patrck Ftzpatrck Department of Mathematcs Unversty
More informationLECTURE 8-9: THE BAKER-CAMPBELL-HAUSDORFF FORMULA
LECTURE 8-9: THE BAKER-CAMPBELL-HAUSDORFF FORMULA As we have seen, 1. Taylor s expanson on Le group, Y ] a(y ). So f G s an abelan group, then c(g) : G G s the entty ap for all g G. As a consequence, a()
More informationENTROPIC QUESTIONING
ENTROPIC QUESTIONING NACHUM. Introucton Goal. Pck the queston that contrbutes most to fnng a sutable prouct. Iea. Use an nformaton-theoretc measure. Bascs. Entropy (a non-negatve real number) measures
More informationCompetitive Experimentation and Private Information
Compettve Expermentaton an Prvate Informaton Guseppe Moscarn an Francesco Squntan Omtte Analyss not Submtte for Publcaton Dervatons for te Gamma-Exponental Moel Dervaton of expecte azar rates. By Bayes
More informationHard Problems from Advanced Partial Differential Equations (18.306)
Har Problems from Avance Partal Dfferental Equatons (18.306) Kenny Kamrn June 27, 2004 1. We are gven the PDE 2 Ψ = Ψ xx + Ψ yy = 0. We must fn solutons of the form Ψ = x γ f (ξ), where ξ x/y. We also
More informationLarge-Scale Data-Dependent Kernel Approximation Appendix
Large-Scale Data-Depenent Kernel Approxmaton Appenx Ths appenx presents the atonal etal an proofs assocate wth the man paper [1]. 1 Introucton Let k : R p R p R be a postve efnte translaton nvarant functon
More informationChapter 2 Transformations and Expectations. , and define f
Revew for the prevous lecture Defnton: support set of a ranom varable, the monotone functon; Theorem: How to obtan a cf, pf (or pmf) of functons of a ranom varable; Eamples: several eamples Chapter Transformatons
More informationNUMERICAL DIFFERENTIATION
NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the
More informationDifference Equations
Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1
More informationTHE SUMMATION NOTATION Ʃ
Sngle Subscrpt otaton THE SUMMATIO OTATIO Ʃ Most of the calculatons we perform n statstcs are repettve operatons on lsts of numbers. For example, we compute the sum of a set of numbers, or the sum of the
More informationRandomness and Computation
Randomness and Computaton or, Randomzed Algorthms Mary Cryan School of Informatcs Unversty of Ednburgh RC 208/9) Lecture 0 slde Balls n Bns m balls, n bns, and balls thrown unformly at random nto bns usually
More informationGENERIC CONTINUOUS SPECTRUM FOR MULTI-DIMENSIONAL QUASIPERIODIC SCHRÖDINGER OPERATORS WITH ROUGH POTENTIALS
GENERIC CONTINUOUS SPECTRUM FOR MULTI-DIMENSIONAL QUASIPERIODIC SCHRÖDINGER OPERATORS WITH ROUGH POTENTIALS YANG FAN AND RUI HAN Abstract. We stuy the mult-mensonal operator (H xu) n = m n = um + f(t n
More informationAnalytical classical dynamics
Analytcal classcal ynamcs by Youun Hu Insttute of plasma physcs, Chnese Acaemy of Scences Emal: yhu@pp.cas.cn Abstract These notes were ntally wrtten when I rea tzpatrck s book[] an were later revse to
More informationA Note on the Numerical Solution for Fredholm Integral Equation of the Second Kind with Cauchy kernel
Journal of Mathematcs an Statstcs 7 (): 68-7, ISS 49-3644 Scence Publcatons ote on the umercal Soluton for Freholm Integral Equaton of the Secon Kn wth Cauchy kernel M. bulkaw,.m.. k Long an Z.K. Eshkuvatov
More informationC/CS/Phy191 Problem Set 3 Solutions Out: Oct 1, 2008., where ( 00. ), so the overall state of the system is ) ( ( ( ( 00 ± 11 ), Φ ± = 1
C/CS/Phy9 Problem Set 3 Solutons Out: Oct, 8 Suppose you have two qubts n some arbtrary entangled state ψ You apply the teleportaton protocol to each of the qubts separately What s the resultng state obtaned
More informationEPR Paradox and the Physical Meaning of an Experiment in Quantum Mechanics. Vesselin C. Noninski
EPR Paradox and the Physcal Meanng of an Experment n Quantum Mechancs Vesseln C Nonnsk vesselnnonnsk@verzonnet Abstract It s shown that there s one purely determnstc outcome when measurement s made on
More informationprinceton univ. F 13 cos 521: Advanced Algorithm Design Lecture 3: Large deviations bounds and applications Lecturer: Sanjeev Arora
prnceton unv. F 13 cos 521: Advanced Algorthm Desgn Lecture 3: Large devatons bounds and applcatons Lecturer: Sanjeev Arora Scrbe: Today s topc s devaton bounds: what s the probablty that a random varable
More informationComplete subgraphs in multipartite graphs
Complete subgraphs n multpartte graphs FLORIAN PFENDER Unverstät Rostock, Insttut für Mathematk D-18057 Rostock, Germany Floran.Pfender@un-rostock.de Abstract Turán s Theorem states that every graph G
More informationMath1110 (Spring 2009) Prelim 3 - Solutions
Math 1110 (Sprng 2009) Solutons to Prelm 3 (04/21/2009) 1 Queston 1. (16 ponts) Short answer. Math1110 (Sprng 2009) Prelm 3 - Solutons x a 1 (a) (4 ponts) Please evaluate lm, where a and b are postve numbers.
More informationRandić Energy and Randić Estrada Index of a Graph
EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS Vol. 5, No., 202, 88-96 ISSN 307-5543 www.ejpam.com SPECIAL ISSUE FOR THE INTERNATIONAL CONFERENCE ON APPLIED ANALYSIS AND ALGEBRA 29 JUNE -02JULY 20, ISTANBUL
More informationMaximizing the number of nonnegative subsets
Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum
More informationAnother converse of Jensen s inequality
Another converse of Jensen s nequalty Slavko Smc Abstract. We gve the best possble global bounds for a form of dscrete Jensen s nequalty. By some examples ts frutfulness s shown. 1. Introducton Throughout
More informationErrors for Linear Systems
Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch
More informationBOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS
BOUNDEDNESS OF THE IESZ TANSFOM WITH MATIX A WEIGHTS Introducton Let L = L ( n, be the functon space wth norm (ˆ f L = f(x C dx d < For a d d matrx valued functon W : wth W (x postve sem-defnte for all
More informationModelli Clamfim Equazione del Calore Lezione ottobre 2014
CLAMFIM Bologna Modell 1 @ Clamfm Equazone del Calore Lezone 17 15 ottobre 2014 professor Danele Rtell danele.rtell@unbo.t 1/24? Convoluton The convoluton of two functons g(t) and f(t) s the functon (g
More informationGeorgia Tech PHYS 6124 Mathematical Methods of Physics I
Georga Tech PHYS 624 Mathematcal Methods of Physcs I Instructor: Predrag Cvtanovć Fall semester 202 Homework Set #7 due October 30 202 == show all your work for maxmum credt == put labels ttle legends
More information2. High dimensional data
/8/00. Hgh mensons. Hgh mensonal ata Conser representng a ocument by a vector each component of whch correspons to the number of occurrences of a partcular wor n the ocument. The Englsh language has on
More informationBounds for Spectral Radius of Various Matrices Associated With Graphs
45 5 Vol.45, No.5 016 9 AVANCES IN MATHEMATICS (CHINA) Sep., 016 o: 10.11845/sxjz.015015b Bouns for Spectral Raus of Varous Matrces Assocate Wth Graphs CUI Shuyu 1, TIAN Guxan, (1. Xngzh College, Zhejang
More informationFinding Dense Subgraphs in G(n, 1/2)
Fndng Dense Subgraphs n Gn, 1/ Atsh Das Sarma 1, Amt Deshpande, and Rav Kannan 1 Georga Insttute of Technology,atsh@cc.gatech.edu Mcrosoft Research-Bangalore,amtdesh,annan@mcrosoft.com Abstract. Fndng
More informationAn efficient method for computing single parameter partial expected value of perfect information
An effcent metho for computng sngle parameter partal expecte value of perfect nformaton Mark Strong,, Jeremy E. Oakley 2. School of Health an Relate Research ScHARR, Unversty of Sheffel, UK. 2. School
More informationP exp(tx) = 1 + t 2k M 2k. k N
1. Subgaussan tals Defnton. Say that a random varable X has a subgaussan dstrbuton wth scale factor σ< f P exp(tx) exp(σ 2 t 2 /2) for all real t. For example, f X s dstrbuted N(,σ 2 ) then t s subgaussan.
More information= z 20 z n. (k 20) + 4 z k = 4
Problem Set #7 solutons 7.2.. (a Fnd the coeffcent of z k n (z + z 5 + z 6 + z 7 + 5, k 20. We use the known seres expanson ( n+l ( z l l z n below: (z + z 5 + z 6 + z 7 + 5 (z 5 ( + z + z 2 + z + 5 5
More informationFoundations of Arithmetic
Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an
More informationThe Order Relation and Trace Inequalities for. Hermitian Operators
Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence
More informationCHAPTER 17 Amortized Analysis
CHAPTER 7 Amortzed Analyss In an amortzed analyss, the tme requred to perform a sequence of data structure operatons s averaged over all the operatons performed. It can be used to show that the average
More informationMechanics Physics 151
Mechancs Physcs 5 Lecture 3 Contnuous Systems an Fels (Chapter 3) Where Are We Now? We ve fnshe all the essentals Fnal wll cover Lectures through Last two lectures: Classcal Fel Theory Start wth wave equatons
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
More informationLectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix
Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could
More informationVisualization of 2D Data By Rational Quadratic Functions
7659 Englan UK Journal of Informaton an Computng cence Vol. No. 007 pp. 7-6 Vsualzaton of D Data By Ratonal Quaratc Functons Malk Zawwar Hussan + Nausheen Ayub Msbah Irsha Department of Mathematcs Unversty
More informationSimultaneous approximation of polynomials
Smultaneous approxmaton of polynomals Anre Kupavsk * János Pach Abstract Let P enote the famly of all polynomals of egree at most n one varable x, wth real coeffcents. A sequence of postve numbers x 1
More informationTAIL BOUNDS FOR SUMS OF GEOMETRIC AND EXPONENTIAL VARIABLES
TAIL BOUNDS FOR SUMS OF GEOMETRIC AND EXPONENTIAL VARIABLES SVANTE JANSON Abstract. We gve explct bounds for the tal probabltes for sums of ndependent geometrc or exponental varables, possbly wth dfferent
More informationCanonical transformations
Canoncal transformatons November 23, 2014 Recall that we have defned a symplectc transformaton to be any lnear transformaton M A B leavng the symplectc form nvarant, Ω AB M A CM B DΩ CD Coordnate transformatons,
More informationLecture 21: Numerical methods for pricing American type derivatives
Lecture 21: Numercal methods for prcng Amercan type dervatves Xaoguang Wang STAT 598W Aprl 10th, 2014 (STAT 598W) Lecture 21 1 / 26 Outlne 1 Fnte Dfference Method Explct Method Penalty Method (STAT 598W)
More informationarxiv:math.nt/ v1 16 Feb 2005
A NOTE ON q-bernoulli NUMBERS AND POLYNOMIALS arv:math.nt/0502333 v1 16 Feb 2005 Taekyun Km Insttute of Scence Eucaton, Kongju Natonal Unversty, Kongju 314-701, S. Korea Abstract. By usng q-ntegraton,
More informationENGI9496 Lecture Notes Multiport Models in Mechanics
ENGI9496 Moellng an Smulaton of Dynamc Systems Mechancs an Mechansms ENGI9496 Lecture Notes Multport Moels n Mechancs (New text Secton 4..3; Secton 9.1 generalzes to 3D moton) Defntons Generalze coornates
More informationFor now, let us focus on a specific model of neurons. These are simplified from reality but can achieve remarkable results.
Neural Networks : Dervaton compled by Alvn Wan from Professor Jtendra Malk s lecture Ths type of computaton s called deep learnng and s the most popular method for many problems, such as computer vson
More informationCHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE
CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng
More informationMA 323 Geometric Modelling Course Notes: Day 13 Bezier Curves & Bernstein Polynomials
MA 323 Geometrc Modellng Course Notes: Day 13 Bezer Curves & Bernsten Polynomals Davd L. Fnn Over the past few days, we have looked at de Casteljau s algorthm for generatng a polynomal curve, and we have
More informationAffine transformations and convexity
Affne transformatons and convexty The purpose of ths document s to prove some basc propertes of affne transformatons nvolvng convex sets. Here are a few onlne references for background nformaton: http://math.ucr.edu/
More informationInner Product. Euclidean Space. Orthonormal Basis. Orthogonal
Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,
More informationAPPENDIX A Some Linear Algebra
APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,
More informationSELECTED PROOFS. DeMorgan s formulas: The first one is clear from Venn diagram, or the following truth table:
SELECTED PROOFS DeMorgan s formulas: The frst one s clear from Venn dagram, or the followng truth table: A B A B A B Ā B Ā B T T T F F F F T F T F F T F F T T F T F F F F F T T T T The second one can be
More information3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X
Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number
More informationComputing MLE Bias Empirically
Computng MLE Bas Emprcally Kar Wa Lm Australan atonal Unversty January 3, 27 Abstract Ths note studes the bas arses from the MLE estmate of the rate parameter and the mean parameter of an exponental dstrbuton.
More informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that
More informationIntroduction to Vapor/Liquid Equilibrium, part 2. Raoult s Law:
CE304, Sprng 2004 Lecture 4 Introducton to Vapor/Lqud Equlbrum, part 2 Raoult s Law: The smplest model that allows us do VLE calculatons s obtaned when we assume that the vapor phase s an deal gas, and
More informationField and Wave Electromagnetic. Chapter.4
Fel an Wave Electromagnetc Chapter.4 Soluton of electrostatc Problems Posson s s an Laplace s Equatons D = ρ E = E = V D = ε E : Two funamental equatons for electrostatc problem Where, V s scalar electrc
More informationA GENERALIZATION OF JUNG S THEOREM. M. Henk
A GENERALIZATION OF JUNG S THEOREM M. Henk Abstract. The theorem of Jung establshes a relaton between crcumraus an ameter of a convex boy. The half of the ameter can be nterprete as the maxmum of crcumra
More informationMath 702 Midterm Exam Solutions
Math 702 Mdterm xam Solutons The terms measurable, measure, ntegrable, and almost everywhere (a.e.) n a ucldean space always refer to Lebesgue measure m. Problem. [6 pts] In each case, prove the statement
More informationVapnik-Chervonenkis theory
Vapnk-Chervonenks theory Rs Kondor June 13, 2008 For the purposes of ths lecture, we restrct ourselves to the bnary supervsed batch learnng settng. We assume that we have an nput space X, and an unknown
More informationMath 426: Probability MWF 1pm, Gasson 310 Homework 4 Selected Solutions
Exercses from Ross, 3, : Math 26: Probablty MWF pm, Gasson 30 Homework Selected Solutons 3, p. 05 Problems 76, 86 3, p. 06 Theoretcal exercses 3, 6, p. 63 Problems 5, 0, 20, p. 69 Theoretcal exercses 2,
More informationChapter 7: Conservation of Energy
Lecture 7: Conservaton o nergy Chapter 7: Conservaton o nergy Introucton I the quantty o a subject oes not change wth tme, t means that the quantty s conserve. The quantty o that subject remans constant
More informationErratum: A Generalized Path Integral Control Approach to Reinforcement Learning
Journal of Machne Learnng Research 00-9 Submtted /0; Publshed 7/ Erratum: A Generalzed Path Integral Control Approach to Renforcement Learnng Evangelos ATheodorou Jonas Buchl Stefan Schaal Department of
More informationSpectral Graph Theory and its Applications September 16, Lecture 5
Spectral Graph Theory and ts Applcatons September 16, 2004 Lecturer: Danel A. Spelman Lecture 5 5.1 Introducton In ths lecture, we wll prove the followng theorem: Theorem 5.1.1. Let G be a planar graph
More informationNote on EM-training of IBM-model 1
Note on EM-tranng of IBM-model INF58 Language Technologcal Applcatons, Fall The sldes on ths subject (nf58 6.pdf) ncludng the example seem nsuffcent to gve a good grasp of what s gong on. Hence here are
More informationLecture 3. Ax x i a i. i i
18.409 The Behavor of Algorthms n Practce 2/14/2 Lecturer: Dan Spelman Lecture 3 Scrbe: Arvnd Sankar 1 Largest sngular value In order to bound the condton number, we need an upper bound on the largest
More informationDigital Signal Processing
Dgtal Sgnal Processng Dscrete-tme System Analyss Manar Mohasen Offce: F8 Emal: manar.subh@ut.ac.r School of IT Engneerng Revew of Precedent Class Contnuous Sgnal The value of the sgnal s avalable over
More informationProblem Solving in Math (Math 43900) Fall 2013
Problem Solvng n Math (Math 43900) Fall 2013 Week four (September 17) solutons Instructor: Davd Galvn 1. Let a and b be two nteger for whch a b s dvsble by 3. Prove that a 3 b 3 s dvsble by 9. Soluton:
More informationPolynomials. 1 More properties of polynomials
Polynomals 1 More propertes of polynomals Recall that, for R a commutatve rng wth unty (as wth all rngs n ths course unless otherwse noted), we defne R[x] to be the set of expressons n =0 a x, where a
More informationExercise Solutions to Real Analysis
xercse Solutons to Real Analyss Note: References refer to H. L. Royden, Real Analyss xersze 1. Gven any set A any ɛ > 0, there s an open set O such that A O m O m A + ɛ. Soluton 1. If m A =, then there
More informationHigh-Order Hamilton s Principle and the Hamilton s Principle of High-Order Lagrangian Function
Commun. Theor. Phys. Bejng, Chna 49 008 pp. 97 30 c Chnese Physcal Socety Vol. 49, No., February 15, 008 Hgh-Orer Hamlton s Prncple an the Hamlton s Prncple of Hgh-Orer Lagrangan Functon ZHAO Hong-Xa an
More informationLecture 10 Support Vector Machines II
Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed
More information1 GSW Iterative Techniques for y = Ax
1 for y = A I m gong to cheat here. here are a lot of teratve technques that can be used to solve the general case of a set of smultaneous equatons (wrtten n the matr form as y = A), but ths chapter sn
More informationEcon107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)
I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes
More informationIndeterminate pin-jointed frames (trusses)
Indetermnate pn-jonted frames (trusses) Calculaton of member forces usng force method I. Statcal determnacy. The degree of freedom of any truss can be derved as: w= k d a =, where k s the number of all
More informationCausal Diamonds. M. Aghili, L. Bombelli, B. Pilgrim
Causal Damonds M. Aghl, L. Bombell, B. Plgrm Introducton The correcton to volume of a causal nterval due to curvature of spacetme has been done by Myrhem [] and recently by Gbbons & Solodukhn [] and later
More informationUsing T.O.M to Estimate Parameter of distributions that have not Single Exponential Family
IOSR Journal of Mathematcs IOSR-JM) ISSN: 2278-5728. Volume 3, Issue 3 Sep-Oct. 202), PP 44-48 www.osrjournals.org Usng T.O.M to Estmate Parameter of dstrbutons that have not Sngle Exponental Famly Jubran
More informationNew Liu Estimators for the Poisson Regression Model: Method and Application
New Lu Estmators for the Posson Regresson Moel: Metho an Applcaton By Krstofer Månsson B. M. Golam Kbra, Pär Sölaner an Ghaz Shukur,3 Department of Economcs, Fnance an Statstcs, Jönköpng Unversty Jönköpng,
More informationAppendix B. The Finite Difference Scheme
140 APPENDIXES Appendx B. The Fnte Dfference Scheme In ths appendx we present numercal technques whch are used to approxmate solutons of system 3.1 3.3. A comprehensve treatment of theoretcal and mplementaton
More informationBounds for the Laplacian spectral radius of graphs Huiqing Liu a ; Mei Lu b a
Ths artcle was ownloae by: [Tsnghua Unversty] On: 16 December 2009 Access etals: Access Detals: [subscrpton number 912295224] Publsher Taylor & Francs Informa Lt Regstere n Englan an Wales Regstere Number:
More informationThis document has been downloaded from Tampub The Institutional Repository of University of Tampere. Publisher's version
Ths ocument has been ownloae from Tampub The Insttutonal Repostory of Unversty of Tampere Publsher's verson Authors: Haukkanen Pentt Name of artcle: Some characterzatons of specally multplcatve functons
More informationChapter 3 Differentiation and Integration
MEE07 Computer Modelng Technques n Engneerng Chapter Derentaton and Integraton Reerence: An Introducton to Numercal Computatons, nd edton, S. yakowtz and F. zdarovsky, Mawell/Macmllan, 990. Derentaton
More informationDECOUPLING THEORY HW2
8.8 DECOUPLIG THEORY HW2 DOGHAO WAG DATE:OCT. 3 207 Problem We shall start by reformulatng the problem. Denote by δ S n the delta functon that s evenly dstrbuted at the n ) dmensonal unt sphere. As a temporal
More informationprinceton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg
prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there
More informationThe Expectation-Maximization Algorithm
The Expectaton-Maxmaton Algorthm Charles Elan elan@cs.ucsd.edu November 16, 2007 Ths chapter explans the EM algorthm at multple levels of generalty. Secton 1 gves the standard hgh-level verson of the algorthm.
More informationHomological methods in Non-commutative Geometry Tokyo, 2007/2008 1
Homologcal methos n Non-commutatve Geometry Tokyo, 2007/2008 1 Lecture 2. Secon bcomplex for cyclc homology. Connes fferental. Cyclc homology an the e Rham cohomology n the HKR case. Homology of small
More informationDONALD M. DAVIS. 1. Main result
v 1 -PERIODIC 2-EXPONENTS OF SU(2 e ) AND SU(2 e + 1) DONALD M. DAVIS Abstract. We determne precsely the largest v 1 -perodc homotopy groups of SU(2 e ) and SU(2 e +1). Ths gves new results about the largest
More informationUnit 5: Quadratic Equations & Functions
Date Perod Unt 5: Quadratc Equatons & Functons DAY TOPIC 1 Modelng Data wth Quadratc Functons Factorng Quadratc Epressons 3 Solvng Quadratc Equatons 4 Comple Numbers Smplfcaton, Addton/Subtracton & Multplcaton
More informationACTM State Calculus Competition Saturday April 30, 2011
ACTM State Calculus Competton Saturday Aprl 30, 2011 ACTM State Calculus Competton Sprng 2011 Page 1 Instructons: For questons 1 through 25, mark the best answer choce on the answer sheet provde Afterward
More informationMarkov Chain Monte Carlo (MCMC), Gibbs Sampling, Metropolis Algorithms, and Simulated Annealing Bioinformatics Course Supplement
Markov Chan Monte Carlo MCMC, Gbbs Samplng, Metropols Algorthms, and Smulated Annealng 2001 Bonformatcs Course Supplement SNU Bontellgence Lab http://bsnuackr/ Outlne! Markov Chan Monte Carlo MCMC! Metropols-Hastngs
More informationChapter 11: Simple Linear Regression and Correlation
Chapter 11: Smple Lnear Regresson and Correlaton 11-1 Emprcal Models 11-2 Smple Lnear Regresson 11-3 Propertes of the Least Squares Estmators 11-4 Hypothess Test n Smple Lnear Regresson 11-4.1 Use of t-tests
More informationGrover s Algorithm + Quantum Zeno Effect + Vaidman
Grover s Algorthm + Quantum Zeno Effect + Vadman CS 294-2 Bomb 10/12/04 Fall 2004 Lecture 11 Grover s algorthm Recall that Grover s algorthm for searchng over a space of sze wors as follows: consder the
More informationCopyright 2014 Tech Science Press CMC, vol.43, no.2, pp.87-95, 2014
Copyrght 2014 Tech Scence Press CMC, vol.43, no.2, pp.87-95, 2014 Analytcal Treatment of the Isotropc and Tetragonal Lattce Green Functons for the Face-centered Cubc, Body-centered Cubc and Smple Cubc
More informationEconomics 101. Lecture 4 - Equilibrium and Efficiency
Economcs 0 Lecture 4 - Equlbrum and Effcency Intro As dscussed n the prevous lecture, we wll now move from an envronment where we looed at consumers mang decsons n solaton to analyzng economes full of
More informationLinear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space.
Lnear, affne, and convex sets and hulls In the sequel, unless otherwse specfed, X wll denote a real vector space. Lnes and segments. Gven two ponts x, y X, we defne xy = {x + t(y x) : t R} = {(1 t)x +
More informationSolutions Homework 4 March 5, 2018
1 Solutons Homework 4 March 5, 018 Soluton to Exercse 5.1.8: Let a IR be a translaton and c > 0 be a re-scalng. ˆb1 (cx + a) cx n + a (cx 1 + a) c x n x 1 cˆb 1 (x), whch shows ˆb 1 s locaton nvarant and
More information