Quantum ergodicity on regular graphs

Size: px
Start display at page:

Download "Quantum ergodicity on regular graphs"

Transcription

1 Quantum ergodcty on regular graphs Naln Anantharaman Unversté de Strasbourg 23 août 2016

2 M Remannan manfold Let (ψ k ) k N be an orthonormal bass of L 2 (M), wth QE theorem (smplfed) : ψ k = λ k ψ k, λ k λ k+1. Theorem (Shnrelman 74, Zeldtch 85, Coln de Verdère 85) Assume that the acton of the geodesc flow s ergodc for the Louvlle measure. Let a C 0 (M). Then 1 N(λ) λ k λ M a(x) ψ k (x) 2 dvol(x) M a(x)dvol(x) 2 0. λ

3 Equvalently, there exsts a subset S N of densty 1, such that a(x) ψ k (x) 2 dvol(x) a(x)dvol(x). M k S k + M Equvalently, n the weak topology. ψ k (x) 2 dvol(x) k S dvol(x) k +

4 The Quantum Unque Ergodcty conjecture QUE conjecture : Conjecture (Rudnck, Sarnak 94) On a negatvely curved manfold, we have convergence of the whole sequence : M a(x) ψ k(x) 2 dvol(x) M a(x)dvol(x) (for all a). and more generally, ψ k, a(x, D x )ψ k L 2 (M) (x,ξ) SM a(x, ξ)dxdξ.

5 Other questons or conjectures Random wave Ansatz. In the case of a chaotc geodesc flow, M. Berry Ansatz s that egenfunctons of should locally resemble a monochromatc gaussan random feld ψ λ (x) = N a α e λu α x α=1 wth the u α equdstrbuted over the unt sphere, a α d gaussan random varables, N +. Spectral statstcs : egenvalues of, λ k (E E 1/2, E + E 1/2 ) (E + ) should after sutable rescalng resemble the egenvalues of large N N gaussan symmetrc matrces.

6 QE on dscrete graphs Snce the 90s there has been the dea of usng graphs as a testng ground / toy model for quantum chaos. Smlansky, Kottos, Elon,... Bogomolny, Keatng, Berkolako, Wnn, Potet, Marklof, Gnutzmann... studed mostly metrc graphs wth Krchhoff matchng condtons for the dervatves at the vertces.

7 For a fxed metrc graph, t s known that QE does NOT hold n the lmt λ j + (at least for ratonally lengths of the edges : Coln de Verdère 2014, Tanner 2001).

8 For a fxed metrc graph, t s known that QE does NOT hold n the lmt λ j + (at least for ratonally lengths of the edges : Coln de Verdère 2014, Tanner 2001). For the lmt of large graphs, spectral statstcs have been studed (star graphs), scarrng, as well as as the valdty of random wave ansatz.

9 Here we focus on the case of large regular (dscrete) graphs (cf Smlansky). Let G = (V, E) be a (q + 1)-regular graph. Dscrete laplacan : f : V C, f (x) = (f (y) f (x)) = y x y x f (y) (q + 1)f (x). = A (q + 1)I

10 Sp(A) [ (q + 1), q + 1] Let V = N. We look at the lmt N +.

11 Sp(A) [ (q + 1), q + 1] Let V = N. We look at the lmt N +. We assume that G N has few short loops (= converges to a tree n the sense of Benjamn-Schramm).

12 Sp(A) [ (q + 1), q + 1] Let V = N. We look at the lmt N +. We assume that G N has few short loops (= converges to a tree n the sense of Benjamn-Schramm). Ths mples convergence of the spectral measure (Kesten-McKay) 1 N {, λ I } m(λ)dλ N + for any nterval I. m s a completely explct densty, supported n ( 2 q, 2 q) I

13 Theorem (Brooks-Lndenstrauss 2011) Assume that G N has few loops of length c log N. For ɛ > 0, there exsts δ > 0 s.t. for every egenfuncton φ, B V N, x B φ(x) 2 ɛ = B N δ. Proof also yelds that φ log N 1/4.

14 Theorem (A-Le Masson, 2013) Assume that G N has few short loops and that t forms an expander famly = unform spectral gap for A. Let (φ (N) ) N =1 be an ONB of egenfunctons of the laplacan on G N. Let a = a N : V N C be such that a(x) 1 for all x V N. Then lm N + 1 N N a(x) φ (N) (x) 2 a x V N =1 a = 1 a(x) N x V N Also works on shrnkng spectral ntervals 2 = 0.

15 Examples Determnstc examples : the Ramanujan graphs of Lubotzky-Phllps-Sarnak 1988 (arthmetc quotents of the q-adc symmetrc space PGL(2, Q q )/PGL(2, Z q )).

16 Examples Determnstc examples : the Ramanujan graphs of Lubotzky-Phllps-Sarnak 1988 (arthmetc quotents of the q-adc symmetrc space PGL(2, Q q )/PGL(2, Z q )). Cayley graphs of SL 2 (Z/pZ), p ranges over the prmes, (Bourgan-Gamburd, based on Helfgott 2005) Extended to all smple Chevalley groups (Breullard-Green-Tao), perfect groups and square-free p (Saleh-Golsefdy Varju)

17 Random regular graphs Our result apples n partcular to random regular graphs. In that case there also exsts a probablstc proof (Gesnger 2013) n the case where a(x) s chosen ndependently of G N.

18 Just as a comparson... the Erdös-Reny model

19 More general verson Theorem (A-Le Masson, 2013) Assume that G N has few short loops and that t forms an expander famly. Let (φ (N) ) N =1 be an ONB of egenfunctons of the laplacan on G N. Let K = K N : V N V N C be a matrx such that d(x, y) > D = K(x, y) = 0. Assume K(x, y) 1. Then lm N + 1 N N φ (N) =1, Kφ (N) K λ 2 = 0. K λ = 1 K(x, y)φ sph,λ (d(x, y)). N x,y

20 K λ = 1 K(x, y)φ sph,λ (d(x, y)). N x,y Φ sph,λ s the sphercal functon of parameter λ on the (q + 1)-regular tree.

21 K λ = 1 K(x, y)φ sph,λ (d(x, y)). N x,y Φ sph,λ s the sphercal functon of parameter λ on the (q + 1)-regular tree. Φ λ (d) = q d/2 ( 2 q + 1 cos(ds ln q) + q 1 q + 1 f λ = q 1/2+s + q 1/2 s = 2 q cos(s ln q). ) sn((d + 1)s ln q) sn(s ln q)

22 Our result says that φ (N) for most., Kφ (N) = x,y φ (N) (x)k(x, y)φ (N) (y) 1 K(x, y)φ sph,λ (d(x, y)) N x,y

23 Sketch of proof : phase space analyss on regular graphs Fourer-Helgason transform on the (q + 1)-regular tree ; phase space analyss on the tree and on a fnte regular graph ; use of the geodesc dynamcs to study egenfunctons of the laplacan.

24 Fourer-Helgason transform on the (q + 1)-regular tree f : X C. Its Fourer transform s ˆf (ω, s) = x X f (x)e s,ω (x) where s T q = R/(2π/ log q), ω X, and e s,ω (x) = q (1/2+s)hω(x) satsfes Ae s,ω = 2 q cos(s log q)e s,ω.

25 Inverson formula, Plancherel theorem f (x) = s T q,ω X f (x) 2 = x X s T q,ω X ˆf (ω, s)e s,ω (x)dm(s)dν o (ω) ˆf (ω, s) 2 dm(s)dν o (ω)

26 Paley-Wener type theorem (Cowlng-Sett) Decay of f (x) when d(x, o) smoothness of ˆf (ω, s).

27 Phase space We defne t as X X T q

28 Pseudodfferental calculus on a regular tree For a functon a(x, ω, s) on X X T q, we defne an operator Op(a) on l 2 (X) by n other words Op(a)f (x) = Op(a)e s,ω (x) = a(x, ω, s)e s,ω s T q,ω X The adjacency operator A corresponds to a(x, ω, s) = 2 q cos(s log q). a(x, ω, s)ˆf (ω, s)e s,ω (x)dm(s)dν o (ω).

29 Accordng to the Paley-Wener theorem, Decay of K a (x, y) when d(x, y) smoothness of a(x, ω, s) wrt (ω, s). Le Masson (2012) studed the operators Op(a) (behavour under composton, boundedness on l 2 (X) etc).

30 Defnton of Op(a) on a fnte regular graph G N = (V N, E N ) = Γ N \X where Γ s a group of automorphsms actng wthout fxed pont on the regular tree X. Op(a) preserves the Γ-nvarant functons on X (and thus act on l 2 (V )) ff a(x, ω, s) s Γ-nvarant (a(γ x, γ ω, s) = a(x, ω, s) for γ Γ)

31 Quantum varance G N = (V N, E N ) = Γ N \X, N = V N. Aφ (N) = λ (N) φ (N) Var(K) = 1 N N =1 φ (N), Kφ (N) 2. Trvally, Var([A, K]) = 0 for any operator K.

32 Classcal dynamcs? Trvally, Var([A, K]) = 0 for any operator K. [A, Op(a)] = Op(b)

33 Classcal dynamcs? Trvally, Var([A, K]) = 0 for any operator K. [A, Op(a)] = Op(b) where b(x, ω, s) = sn(s ln q)(a σ La) + cos(s ln q)(a σ + La 2a)

34 Although we do not know f φ (N), Op(a σ a)φ (N) s small for every, we can prove that Var(Op(a σ a)) 0. N +

35 Although we do not know f φ (N), Op(a σ a)φ (N) s small for every, we can prove that Var(Op(a σ a)) 0. N + We deduce (densty argument) that Var(Op(a)) 0 (as N ) f 1 a(x, ω, s)dν x (ω) = 0 N X T q for all s. x D N

36 Although we do not know f φ (N), Op(a σ a)φ (N) s small for every, we can prove that Var(Op(a σ a)) 0. N + We deduce (densty argument) that Var(Op(a)) 0 (as N ) f 1 a(x, ω, s)dν x (ω) = 0 = K a N λ(s) X T q for all s. x D N

37 Although we do not know f φ (N), Op(a σ a)φ (N) s small for every, we can prove that Var(Op(a σ a)) 0. N + Var(Op(a)) 1 N x D N X T q a(x, ω, s) 2 dν x (ω)dm(s) We deduce (densty argument) that Var(Op(a)) 0 (as N ) f 1 a(x, ω, s)dν x (ω) = 0 = K a N λ(s) X T q for all s. x D N

38 Do graphs teach us somethng about manfolds? By approxmaton of a manfold by graphs (trangulaton)? A pror NO.

39 Contnuous analogue of our theorem... Let (S N ) be a sequence of hyperbolc surfaces, whose genus goes to. Assume the frst egenvalue λ 1 (N) of s bounded away from 0 as N. Assume there are few short geodescs. Fx an nterval I (1/4, + ). Let (φ (N) ) be an ONB of egenfunctons of the laplacan on S N. Let a = a N : S N C be such that a(x) 1 for all x S N.

40 Contnuous analogue of our theorem... Let (S N ) be a sequence of hyperbolc surfaces, whose genus goes to. Assume the frst egenvalue λ 1 (N) of s bounded away from 0 as N. Assume there are few short geodescs. Fx an nterval I (1/4, + ). Let (φ (N) ) be an ONB of egenfunctons of the laplacan on S N. Let a = a N : S N C be such that a(x) 1 for all x S N. Then lm N + 1 Vol(S N ) λ (N) I (Le Masson Sahlsten 2016) a(x) φ (N) (x) 2 dx a S N 2 = 0.

41 Applcaton to Arthmetc Quantum Unque Ergodcty M arthmetc surface. Assume ψ k, a(x, D x )ψ k L 2 (M) λ k (x,ξ) SM a(x, ξ)dµ(x, ξ). Lndenstrauss 2001 : f the ψ k are egenfunctons of and ALL the Hecke operators, then µ s the Louvlle (unform) measure.

42 Applcaton to Arthmetc Quantum Unque Ergodcty M arthmetc surface. Assume ψ k, a(x, D x )ψ k L 2 (M) λ k (x,ξ) SM a(x, ξ)dµ(x, ξ). Lndenstrauss 2001 : f the ψ k are egenfunctons of and ALL the Hecke operators, then µ s the Louvlle (unform) measure. One step s to prove that all the ergodc components of µ have postve Kolmogorov-Sna entropy

43 Applcaton to Arthmetc Quantum Unque Ergodcty (on arthmetc surfaces) Assume ψ k, a(x, D x )ψ k L 2 (M) (x,ξ) SM a(x, ξ)dµ(x, ξ). Brooks-Lndenstrauss 2011 : f the ψ k are egenfunctons of and ONE Hecke operator, then µ s the Louvlle (unform) measure. Idea : approxmate Hecke trees by fnte regular graphs, use a modfcaton of the prevously quoted result of BL.

44 QE on the sphere, revsted (Brooks-Le Masson-Lndenstrauss 2015) For g 1,..., g k a fnte set of rotatons n SO(3), commutes wth S 2. Theorem T k f (x) = k j=1 (f (g j x) + f (g 1 j Assume that g 1,..., g k generate a free subgroup of SO(3). For each l, let (ψ (l) j ) 2l+1 j=1 be an o-n famly of egenfunctons of S 2 of egenvalue l(l + 1), that are also egenfunctons of T k. Then for any contnuous functon a on S 2, we have 1 2l + 1 2l+1 j=1 M a(x) ψ (l) j (x) 2 dvol(x) M x)) a(x)dvol(x) 2 0. l

III. Quantum ergodicity on graphs, perspectives

III. Quantum ergodicity on graphs, perspectives III. Quantum ergodicity on graphs, perspectives Nalini Anantharaman Université de Strasbourg 24 août 2016 Yesterday we focussed on the case of large regular (discrete) graphs. Let G = (V, E) be a (q +

More information

Quantum ergodicity. Nalini Anantharaman. 22 août Université de Strasbourg

Quantum ergodicity. Nalini Anantharaman. 22 août Université de Strasbourg Quantum ergodicity Nalini Anantharaman Université de Strasbourg 22 août 2016 I. Quantum ergodicity on manifolds. II. QE on (discrete) graphs : regular graphs. III. QE on graphs : other models, perspectives.

More information

APPENDIX A Some Linear Algebra

APPENDIX 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 information

Eigenvalues of Random Graphs

Eigenvalues of Random Graphs Spectral Graph Theory Lecture 2 Egenvalues of Random Graphs Danel A. Spelman November 4, 202 2. Introducton In ths lecture, we consder a random graph on n vertces n whch each edge s chosen to be n the

More information

U.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017

U.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 information

Georgia Tech PHYS 6124 Mathematical Methods of Physics I

Georgia 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 information

REAL ANALYSIS I HOMEWORK 1

REAL ANALYSIS I HOMEWORK 1 REAL ANALYSIS I HOMEWORK CİHAN BAHRAN The questons are from Tao s text. Exercse 0.0.. If (x α ) α A s a collecton of numbers x α [0, + ] such that x α

More information

CS 468 Lecture 16: Isometry Invariance and Spectral Techniques

CS 468 Lecture 16: Isometry Invariance and Spectral Techniques CS 468 Lecture 16: Isometry Invarance and Spectral Technques Justn Solomon Scrbe: Evan Gawlk Introducton. In geometry processng, t s often desrable to characterze the shape of an object n a manner that

More information

More metrics on cartesian products

More 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 information

C/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/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 information

Deriving LQC Dynamics from Diffeomorphism Invariance

Deriving LQC Dynamics from Diffeomorphism Invariance Dervng LQC Dynamcs from Dffeomorphsm Invarance Ilya Vlensky work n collaboraton wth J. Engle arxv:1802.01543 Internatonal Loop Quantum Gravty Semnar Feb 6, 2018 Ilya Vlensky FAU LQC Dynamcs from Dffeomorphsm

More information

Dynamic Systems on Graphs

Dynamic Systems on Graphs Prepared by F.L. Lews Updated: Saturday, February 06, 200 Dynamc Systems on Graphs Control Graphs and Consensus A network s a set of nodes that collaborates to acheve what each cannot acheve alone. A network,

More information

Quantum groups and quantized q-difference birational Weyl group actions

Quantum groups and quantized q-difference birational Weyl group actions q Weyl Quantum groups and quantzed q-dfference bratonal Weyl group actons ( ) Gen KUROKI (Tohoku Unversty, Japan) 24 September 2010 2010 2010 9 22 25 (24 September 2010, Verson 1.7) Quantum bratonal Weyl

More information

Projective change between two Special (α, β)- Finsler Metrics

Projective change between two Special (α, β)- Finsler Metrics Internatonal Journal of Trend n Research and Development, Volume 2(6), ISSN 2394-9333 www.jtrd.com Projectve change between two Specal (, β)- Fnsler Metrcs Gayathr.K 1 and Narasmhamurthy.S.K 2 1 Assstant

More information

Math1110 (Spring 2009) Prelim 3 - Solutions

Math1110 (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 information

U.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016

U.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016 U.C. Berkeley CS94: Spectral Methods and Expanders Handout 8 Luca Trevsan February 7, 06 Lecture 8: Spectral Algorthms Wrap-up In whch we talk about even more generalzatons of Cheeger s nequaltes, and

More information

Changing Topology and Communication Delays

Changing Topology and Communication Delays Prepared by F.L. Lews Updated: Saturday, February 3, 00 Changng Topology and Communcaton Delays Changng Topology The graph connectvty or topology may change over tme. Let G { G, G,, G M } wth M fnte be

More information

10-801: Advanced Optimization and Randomized Methods Lecture 2: Convex functions (Jan 15, 2014)

10-801: Advanced Optimization and Randomized Methods Lecture 2: Convex functions (Jan 15, 2014) 0-80: Advanced Optmzaton and Randomzed Methods Lecture : Convex functons (Jan 5, 04) Lecturer: Suvrt Sra Addr: Carnege Mellon Unversty, Sprng 04 Scrbes: Avnava Dubey, Ahmed Hefny Dsclamer: These notes

More information

Strong Markov property: Same assertion holds for stopping times τ.

Strong Markov property: Same assertion holds for stopping times τ. Brownan moton Let X ={X t : t R + } be a real-valued stochastc process: a famlty of real random varables all defned on the same probablty space. Defne F t = nformaton avalable by observng the process up

More information

Lecture 12: Discrete Laplacian

Lecture 12: Discrete Laplacian Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly

More information

CSCE 790S Background Results

CSCE 790S Background Results CSCE 790S Background Results Stephen A. Fenner September 8, 011 Abstract These results are background to the course CSCE 790S/CSCE 790B, Quantum Computaton and Informaton (Sprng 007 and Fall 011). Each

More information

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal

Inner 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 information

Dirichlet s Theorem In Arithmetic Progressions

Dirichlet s Theorem In Arithmetic Progressions Drchlet s Theorem In Arthmetc Progressons Parsa Kavkan Hang Wang The Unversty of Adelade February 26, 205 Abstract The am of ths paper s to ntroduce and prove Drchlet s theorem n arthmetc progressons,

More information

The Feynman path integral

The Feynman path integral The Feynman path ntegral Aprl 3, 205 Hesenberg and Schrödnger pctures The Schrödnger wave functon places the tme dependence of a physcal system n the state, ψ, t, where the state s a vector n Hlbert space

More information

MATH 5707 HOMEWORK 4 SOLUTIONS 2. 2 i 2p i E(X i ) + E(Xi 2 ) ä i=1. i=1

MATH 5707 HOMEWORK 4 SOLUTIONS 2. 2 i 2p i E(X i ) + E(Xi 2 ) ä i=1. i=1 MATH 5707 HOMEWORK 4 SOLUTIONS CİHAN BAHRAN 1. Let v 1,..., v n R m, all lengths v are not larger than 1. Let p 1,..., p n [0, 1] be arbtrary and set w = p 1 v 1 + + p n v n. Then there exst ε 1,..., ε

More information

Uniqueness of Weak Solutions to the 3D Ginzburg- Landau Model for Superconductivity

Uniqueness of Weak Solutions to the 3D Ginzburg- Landau Model for Superconductivity Int. Journal of Math. Analyss, Vol. 6, 212, no. 22, 195-114 Unqueness of Weak Solutons to the 3D Gnzburg- Landau Model for Superconductvty Jshan Fan Department of Appled Mathematcs Nanjng Forestry Unversty

More information

Lecture 3. Ax x i a i. i i

Lecture 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 information

3.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

3.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 information

Lagrangian Field Theory

Lagrangian Field Theory Lagrangan Feld Theory Adam Lott PHY 391 Aprl 6, 017 1 Introducton Ths paper s a summary of Chapter of Mandl and Shaw s Quantum Feld Theory [1]. The frst thng to do s to fx the notaton. For the most part,

More information

Composite Hypotheses testing

Composite Hypotheses testing Composte ypotheses testng In many hypothess testng problems there are many possble dstrbutons that can occur under each of the hypotheses. The output of the source s a set of parameters (ponts n a parameter

More information

Introduction. - The Second Lyapunov Method. - The First Lyapunov Method

Introduction. - The Second Lyapunov Method. - The First Lyapunov Method Stablty Analyss A. Khak Sedgh Control Systems Group Faculty of Electrcal and Computer Engneerng K. N. Toos Unversty of Technology February 2009 1 Introducton Stablty s the most promnent characterstc of

More information

Appendix B. The Finite Difference Scheme

Appendix 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 information

A Quantum Gauss-Bonnet Theorem

A Quantum Gauss-Bonnet Theorem A Quantum Gauss-Bonnet Theorem Tyler Fresen November 13, 2014 Curvature n the plane Let Γ be a smooth curve wth orentaton n R 2, parametrzed by arc length. The curvature k of Γ s ± Γ, where the sgn s postve

More information

DISCRIMINANTS AND RAMIFIED PRIMES. 1. Introduction A prime number p is said to be ramified in a number field K if the prime ideal factorization

DISCRIMINANTS AND RAMIFIED PRIMES. 1. Introduction A prime number p is said to be ramified in a number field K if the prime ideal factorization DISCRIMINANTS AND RAMIFIED PRIMES KEITH CONRAD 1. Introducton A prme number p s sad to be ramfed n a number feld K f the prme deal factorzaton (1.1) (p) = po K = p e 1 1 peg g has some e greater than 1.

More information

Representation theory and quantum mechanics tutorial Representation theory and quantum conservation laws

Representation theory and quantum mechanics tutorial Representation theory and quantum conservation laws Representaton theory and quantum mechancs tutoral Representaton theory and quantum conservaton laws Justn Campbell August 1, 2017 1 Generaltes on representaton theory 1.1 Let G GL m (R) be a real algebrac

More information

Modelli Clamfim Equazione del Calore Lezione ottobre 2014

Modelli 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 information

Convergence of random processes

Convergence of random processes DS-GA 12 Lecture notes 6 Fall 216 Convergence of random processes 1 Introducton In these notes we study convergence of dscrete random processes. Ths allows to characterze phenomena such as the law of large

More information

The equation of motion of a dynamical system is given by a set of differential equations. That is (1)

The equation of motion of a dynamical system is given by a set of differential equations. That is (1) Dynamcal Systems Many engneerng and natural systems are dynamcal systems. For example a pendulum s a dynamcal system. State l The state of the dynamcal system specfes t condtons. For a pendulum n the absence

More information

MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS

MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS These are nformal notes whch cover some of the materal whch s not n the course book. The man purpose s to gve a number of nontrval examples

More information

Geometry of Müntz Spaces

Geometry of Müntz Spaces WDS'12 Proceedngs of Contrbuted Papers, Part I, 31 35, 212. ISBN 978-8-7378-224-5 MATFYZPRESS Geometry of Müntz Spaces P. Petráček Charles Unversty, Faculty of Mathematcs and Physcs, Prague, Czech Republc.

More information

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:

More information

Modelli Clamfim Integrali Multipli 7 ottobre 2015

Modelli Clamfim Integrali Multipli 7 ottobre 2015 CLAMFIM Bologna Modell 1 @ Clamfm Integral Multpl 7 ottobre 2015 professor Danele Rtell danele.rtell@unbo.t 1/30? roduct of σ-algebras Let (Ω 1, A 1, µ 1 ), (Ω 2, A 2, µ 2 ) two measure spaces. ut Ω :=

More information

Google PageRank with Stochastic Matrix

Google PageRank with Stochastic Matrix Google PageRank wth Stochastc Matrx Md. Sharq, Puranjt Sanyal, Samk Mtra (M.Sc. Applcatons of Mathematcs) Dscrete Tme Markov Chan Let S be a countable set (usually S s a subset of Z or Z d or R or R d

More information

CME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 13

CME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 13 CME 30: NUMERICAL LINEAR ALGEBRA FALL 005/06 LECTURE 13 GENE H GOLUB 1 Iteratve Methods Very large problems (naturally sparse, from applcatons): teratve methods Structured matrces (even sometmes dense,

More information

THEOREMS OF QUANTUM MECHANICS

THEOREMS OF QUANTUM MECHANICS THEOREMS OF QUANTUM MECHANICS In order to develop methods to treat many-electron systems (atoms & molecules), many of the theorems of quantum mechancs are useful. Useful Notaton The matrx element A mn

More information

Lecture 3: Probability Distributions

Lecture 3: Probability Distributions Lecture 3: Probablty Dstrbutons Random Varables Let us begn by defnng a sample space as a set of outcomes from an experment. We denote ths by S. A random varable s a functon whch maps outcomes nto the

More information

MATH 281A: Homework #6

MATH 281A: Homework #6 MATH 28A: Homework #6 Jongha Ryu Due date: November 8, 206 Problem. (Problem 2..2. Soluton. If X,..., X n Bern(p, then T = X s a complete suffcent statstc. Our target s g(p = p, and the nave guess suggested

More information

NUMERICAL DIFFERENTIATION

NUMERICAL 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 information

SUPPLEMENTARY INFORMATION

SUPPLEMENTARY INFORMATION do: 0.08/nature09 I. Resonant absorpton of XUV pulses n Kr + usng the reduced densty matrx approach The quantum beats nvestgated n ths paper are the result of nterference between two exctaton paths of

More information

A particle in a state of uniform motion remain in that state of motion unless acted upon by external force.

A particle in a state of uniform motion remain in that state of motion unless acted upon by external force. The fundamental prncples of classcal mechancs were lad down by Galleo and Newton n the 16th and 17th centures. In 1686, Newton wrote the Prncpa where he gave us three laws of moton, one law of gravty,

More information

Discrete Mathematics

Discrete Mathematics Dscrete Mathematcs 311 (011) 76 81 Contents lsts avalable at ScenceDrect Dscrete Mathematcs journal homepage: www.elsever.com/locate/dsc A lattce pont problem on the regular tree Femke Douma Department

More information

MATH Homework #2

MATH Homework #2 MATH609-601 Homework #2 September 27, 2012 1. Problems Ths contans a set of possble solutons to all problems of HW-2. Be vglant snce typos are possble (and nevtable). (1) Problem 1 (20 pts) For a matrx

More information

Chapter 4 The Wave Equation

Chapter 4 The Wave Equation Chapter 4 The Wave Equaton Another classcal example of a hyperbolc PDE s a wave equaton. The wave equaton s a second-order lnear hyperbolc PDE that descrbes the propagaton of a varety of waves, such as

More information

TAIL BOUNDS FOR SUMS OF GEOMETRIC AND EXPONENTIAL VARIABLES

TAIL 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 information

Using T.O.M to Estimate Parameter of distributions that have not Single Exponential Family

Using 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 information

Randić Energy and Randić Estrada Index of a Graph

Randić 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 information

ALGEBRA HW 7 CLAY SHONKWILER

ALGEBRA HW 7 CLAY SHONKWILER ALGEBRA HW 7 CLAY SHONKWILER 1 Whch of the followng rngs R are dscrete valuaton rngs? For those that are, fnd the fracton feld K = frac R, the resdue feld k = R/m (where m) s the maxmal deal), and a unformzer

More information

Stanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011

Stanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011 Stanford Unversty CS359G: Graph Parttonng and Expanders Handout 4 Luca Trevsan January 3, 0 Lecture 4 In whch we prove the dffcult drecton of Cheeger s nequalty. As n the past lectures, consder an undrected

More information

Causal Diamonds. M. Aghili, L. Bombelli, B. Pilgrim

Causal 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 information

Additional Codes using Finite Difference Method. 1 HJB Equation for Consumption-Saving Problem Without Uncertainty

Additional Codes using Finite Difference Method. 1 HJB Equation for Consumption-Saving Problem Without Uncertainty Addtonal Codes usng Fnte Dfference Method Benamn Moll 1 HJB Equaton for Consumpton-Savng Problem Wthout Uncertanty Before consderng the case wth stochastc ncome n http://www.prnceton.edu/~moll/ HACTproect/HACT_Numercal_Appendx.pdf,

More information

SUPER PRINCIPAL FIBER BUNDLE WITH SUPER ACTION

SUPER PRINCIPAL FIBER BUNDLE WITH SUPER ACTION talan journal of pure appled mathematcs n. 33 2014 (63 70) 63 SUPER PRINCIPAL FIBER BUNDLE WITH SUPER ACTION M.R. Farhangdoost Department of Mathematcs College of Scences Shraz Unversty Shraz, 71457-44776

More information

Maximizing the number of nonnegative subsets

Maximizing 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 information

Affine and Riemannian Connections

Affine and Riemannian Connections Affne and Remannan Connectons Semnar Remannan Geometry Summer Term 2015 Prof Dr Anna Wenhard and Dr Gye-Seon Lee Jakob Ullmann Notaton: X(M) space of smooth vector felds on M D(M) space of smooth functons

More information

Salmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2

Salmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2 Salmon: Lectures on partal dfferental equatons 5. Classfcaton of second-order equatons There are general methods for classfyng hgher-order partal dfferental equatons. One s very general (applyng even to

More information

Stability Properties of Rotational Catenoids in the Heisenberg Groups

Stability Properties of Rotational Catenoids in the Heisenberg Groups 3.Perre 2014/8/22 11:17 page 37 #1 Matemátca Contemporânea, Vol. 43, 37 60 c2014, Socedade Braslera de Matemátca Stablty Propertes of Rotatonal Catenods n the Hesenberg Groups Perre Bérard Marcos P. Cavalcante

More information

Journal of Number Theory

Journal of Number Theory Journal of Number Theory 132 2012 2499 2509 Contents lsts avalable at ScVerse ScenceDrect Journal of Number Theory www.elsever.com/locate/jnt Algebrac numbers, hyperbolcty, and densty modulo one A. Gorodnk,S.Kadyrov

More information

CONDITIONS FOR INVARIANT SUBMANIFOLD OF A MANIFOLD WITH THE (ϕ, ξ, η, G)-STRUCTURE. Jovanka Nikić

CONDITIONS FOR INVARIANT SUBMANIFOLD OF A MANIFOLD WITH THE (ϕ, ξ, η, G)-STRUCTURE. Jovanka Nikić 147 Kragujevac J. Math. 25 (2003) 147 154. CONDITIONS FOR INVARIANT SUBMANIFOLD OF A MANIFOLD WITH THE (ϕ, ξ, η, G)-STRUCTURE Jovanka Nkć Faculty of Techncal Scences, Unversty of Nov Sad, Trg Dosteja Obradovća

More information

Exercise Solutions to Real Analysis

Exercise 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 information

Matrix Approximation via Sampling, Subspace Embedding. 1 Solving Linear Systems Using SVD

Matrix Approximation via Sampling, Subspace Embedding. 1 Solving Linear Systems Using SVD Matrx Approxmaton va Samplng, Subspace Embeddng Lecturer: Anup Rao Scrbe: Rashth Sharma, Peng Zhang 0/01/016 1 Solvng Lnear Systems Usng SVD Two applcatons of SVD have been covered so far. Today we loo

More information

PSEUDO ORBIT EXPANSION FOR THE RESONANCE CONDITION ON QUANTUM GRAPHS AND THE RESONANCE ASYMPTOTICS

PSEUDO ORBIT EXPANSION FOR THE RESONANCE CONDITION ON QUANTUM GRAPHS AND THE RESONANCE ASYMPTOTICS PSEUDO ORBIT EXPANSION FOR THE RESONANCE CONDITION ON QUANTUM GRAPHS AND THE RESONANCE ASYMPTOTICS JIŘÍ LIPOVSKÝ Department of Physcs, Faculty of Scence, Unversty of Hradec Králové, Roktanského 6, 500

More information

8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS

8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 493 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces you have studed thus far n the text are real vector spaces because the scalars

More information

Lecture 17 : Stochastic Processes II

Lecture 17 : Stochastic Processes II : Stochastc Processes II 1 Contnuous-tme stochastc process So far we have studed dscrete-tme stochastc processes. We studed the concept of Makov chans and martngales, tme seres analyss, and regresson analyss

More information

arxiv: v2 [math.ds] 29 Oct 2018

arxiv: v2 [math.ds] 29 Oct 2018 The Decay Rate of Patterson-Sullvan Measures wth Potental Functons and Crtcal Exponents arxv:181.11133v2 [math.ds] 29 Oct 218 Zqang Feng Fe Lu Fang Wang October 3, 218 Abstract Basng upon the recent development

More information

This chapter illustrates the idea that all properties of the homogeneous electron gas (HEG) can be calculated from electron density.

This chapter illustrates the idea that all properties of the homogeneous electron gas (HEG) can be calculated from electron density. 1 Unform Electron Gas Ths chapter llustrates the dea that all propertes of the homogeneous electron gas (HEG) can be calculated from electron densty. Intutve Representaton of Densty Electron densty n s

More information

Quantum and Classical Information Theory with Disentropy

Quantum and Classical Information Theory with Disentropy Quantum and Classcal Informaton Theory wth Dsentropy R V Ramos rubensramos@ufcbr Lab of Quantum Informaton Technology, Department of Telenformatc Engneerng Federal Unversty of Ceara - DETI/UFC, CP 6007

More information

STAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 17. a ij x (k) b i. a ij x (k+1) (D + L)x (k+1) = b Ux (k)

STAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 17. a ij x (k) b i. a ij x (k+1) (D + L)x (k+1) = b Ux (k) STAT 309: MATHEMATICAL COMPUTATIONS I FALL 08 LECTURE 7. sor method remnder: n coordnatewse form, Jacob method s = [ b a x (k) a and Gauss Sedel method s = [ b a = = remnder: n matrx form, Jacob method

More information

Maximum Likelihood Estimation of Binary Dependent Variables Models: Probit and Logit. 1. General Formulation of Binary Dependent Variables Models

Maximum Likelihood Estimation of Binary Dependent Variables Models: Probit and Logit. 1. General Formulation of Binary Dependent Variables Models ECO 452 -- OE 4: Probt and Logt Models ECO 452 -- OE 4 Maxmum Lkelhood Estmaton of Bnary Dependent Varables Models: Probt and Logt hs note demonstrates how to formulate bnary dependent varables models

More information

Stanford University CS254: Computational Complexity Notes 7 Luca Trevisan January 29, Notes for Lecture 7

Stanford University CS254: Computational Complexity Notes 7 Luca Trevisan January 29, Notes for Lecture 7 Stanford Unversty CS54: Computatonal Complexty Notes 7 Luca Trevsan January 9, 014 Notes for Lecture 7 1 Approxmate Countng wt an N oracle We complete te proof of te followng result: Teorem 1 For every

More information

6) Derivatives, gradients and Hessian matrices

6) Derivatives, gradients and Hessian matrices 30C00300 Mathematcal Methods for Economsts (6 cr) 6) Dervatves, gradents and Hessan matrces Smon & Blume chapters: 14, 15 Sldes by: Tmo Kuosmanen 1 Outlne Defnton of dervatve functon Dervatve notatons

More information

Modelli Clamfim Equazioni differenziali 7 ottobre 2013

Modelli Clamfim Equazioni differenziali 7 ottobre 2013 CLAMFIM Bologna Modell 1 @ Clamfm Equazon dfferenzal 7 ottobre 2013 professor Danele Rtell danele.rtell@unbo.t 1/18? Ordnary Dfferental Equatons A dfferental equaton s an equaton that defnes a relatonshp

More information

SUCCESSIVE MINIMA AND LATTICE POINTS (AFTER HENK, GILLET AND SOULÉ) M(B) := # ( B Z N)

SUCCESSIVE MINIMA AND LATTICE POINTS (AFTER HENK, GILLET AND SOULÉ) M(B) := # ( B Z N) SUCCESSIVE MINIMA AND LATTICE POINTS (AFTER HENK, GILLET AND SOULÉ) S.BOUCKSOM Abstract. The goal of ths note s to present a remarably smple proof, due to Hen, of a result prevously obtaned by Gllet-Soulé,

More information

Lecture 4: Universal Hash Functions/Streaming Cont d

Lecture 4: Universal Hash Functions/Streaming Cont d CSE 5: Desgn and Analyss of Algorthms I Sprng 06 Lecture 4: Unversal Hash Functons/Streamng Cont d Lecturer: Shayan Oves Gharan Aprl 6th Scrbe: Jacob Schreber Dsclamer: These notes have not been subjected

More information

U.C. Berkeley CS278: Computational Complexity Professor Luca Trevisan 2/21/2008. Notes for Lecture 8

U.C. Berkeley CS278: Computational Complexity Professor Luca Trevisan 2/21/2008. Notes for Lecture 8 U.C. Berkeley CS278: Computatonal Complexty Handout N8 Professor Luca Trevsan 2/21/2008 Notes for Lecture 8 1 Undrected Connectvty In the undrected s t connectvty problem (abbrevated ST-UCONN) we are gven

More information

Perron Vectors of an Irreducible Nonnegative Interval Matrix

Perron Vectors of an Irreducible Nonnegative Interval Matrix Perron Vectors of an Irreducble Nonnegatve Interval Matrx Jr Rohn August 4 2005 Abstract As s well known an rreducble nonnegatve matrx possesses a unquely determned Perron vector. As the man result of

More information

Statistical Mechanics and Combinatorics : Lecture III

Statistical Mechanics and Combinatorics : Lecture III Statstcal Mechancs and Combnatorcs : Lecture III Dmer Model Dmer defntons Defnton A dmer coverng (perfect matchng) of a fnte graph s a set of edges whch covers every vertex exactly once, e every vertex

More information

1 Matrix representations of canonical matrices

1 Matrix representations of canonical matrices 1 Matrx representatons of canoncal matrces 2-d rotaton around the orgn: ( ) cos θ sn θ R 0 = sn θ cos θ 3-d rotaton around the x-axs: R x = 1 0 0 0 cos θ sn θ 0 sn θ cos θ 3-d rotaton around the y-axs:

More information

Research Article Green s Theorem for Sign Data

Research Article Green s Theorem for Sign Data Internatonal Scholarly Research Network ISRN Appled Mathematcs Volume 2012, Artcle ID 539359, 10 pages do:10.5402/2012/539359 Research Artcle Green s Theorem for Sgn Data Lous M. Houston The Unversty of

More information

Appendix B. Criterion of Riemann-Stieltjes Integrability

Appendix B. Criterion of Riemann-Stieltjes Integrability Appendx B. Crteron of Remann-Steltes Integrablty Ths note s complementary to [R, Ch. 6] and [T, Sec. 3.5]. The man result of ths note s Theorem B.3, whch provdes the necessary and suffcent condtons for

More information

FUNCTIONAL ANALYSIS DR. RITU AGARWAL MALAVIYA NATIONAL INSTITUTE OF TECHNOLOGY JAIPUR

FUNCTIONAL ANALYSIS DR. RITU AGARWAL MALAVIYA NATIONAL INSTITUTE OF TECHNOLOGY JAIPUR FUNCTIONAL ANALYSIS DR. RITU AGARWAL MALAVIYA NATIONAL INSTITUTE OF TECHNOLOGY JAIPUR Contents 1. About 1 2. Syllabus 1 References 1 2.1. Orgn 2 3. Abstract space 2 4. Metrc Space 2 5. Sem-Metrc 6 6. Separable

More information

Simulation and Random Number Generation

Simulation and Random Number Generation Smulaton and Random Number Generaton Summary Dscrete Tme vs Dscrete Event Smulaton Random number generaton Generatng a random sequence Generatng random varates from a Unform dstrbuton Testng the qualty

More information

First Year Examination Department of Statistics, University of Florida

First Year Examination Department of Statistics, University of Florida Frst Year Examnaton Department of Statstcs, Unversty of Florda May 7, 010, 8:00 am - 1:00 noon Instructons: 1. You have four hours to answer questons n ths examnaton.. You must show your work to receve

More information

A gentle introduction to Quantum Ergodicity

A gentle introduction to Quantum Ergodicity A gentle introduction to Quantum Ergodicity Tuomas Sahlsten University of Bristol, UK 7 March 2017 Arithmetic study group, Durham, UK Joint work with Etienne Le Masson (Bristol) Supported by the EU: Horizon

More information

Curvature and isoperimetric inequality

Curvature and isoperimetric inequality urvature and sopermetrc nequalty Julà ufí, Agustí Reventós, arlos J Rodríguez Abstract We prove an nequalty nvolvng the length of a plane curve and the ntegral of ts radus of curvature, that has as a consequence

More information

Complete subgraphs in multipartite graphs

Complete 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 information

Convexity preserving interpolation by splines of arbitrary degree

Convexity preserving interpolation by splines of arbitrary degree Computer Scence Journal of Moldova, vol.18, no.1(52), 2010 Convexty preservng nterpolaton by splnes of arbtrary degree Igor Verlan Abstract In the present paper an algorthm of C 2 nterpolaton of dscrete

More information

Modelli Clamfim Equazioni differenziali 22 settembre 2016

Modelli Clamfim Equazioni differenziali 22 settembre 2016 CLAMFIM Bologna Modell 1 @ Clamfm Equazon dfferenzal 22 settembre 2016 professor Danele Rtell danele.rtell@unbo.t 1/22? Ordnary Dfferental Equatons A dfferental equaton s an equaton that defnes a relatonshp

More information

Canonical transformations

Canonical 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 information

Probability Theory (revisited)

Probability Theory (revisited) Probablty Theory (revsted) Summary Probablty v.s. plausblty Random varables Smulaton of Random Experments Challenge The alarm of a shop rang. Soon afterwards, a man was seen runnng n the street, persecuted

More information

An introduction to chaining, and applications to sublinear algorithms

An introduction to chaining, and applications to sublinear algorithms An ntroducton to channg, and applcatons to sublnear algorthms Jelan Nelson Harvard August 28, 2015 What s ths talk about? What s ths talk about? Gven a collecton of random varables X 1, X 2,...,, we would

More information

Lecture 10: May 6, 2013

Lecture 10: May 6, 2013 TTIC/CMSC 31150 Mathematcal Toolkt Sprng 013 Madhur Tulsan Lecture 10: May 6, 013 Scrbe: Wenje Luo In today s lecture, we manly talked about random walk on graphs and ntroduce the concept of graph expander,

More information