PHYSICS 653 HOMEWORK 1 P.1. Problems 1: Random walks (additional problems)

Size: px
Start display at page:

Download "PHYSICS 653 HOMEWORK 1 P.1. Problems 1: Random walks (additional problems)"

Transcription

1 PHYSICS 653 HOMEWORK 1 P.1 Problems 1: Random walks (additional problems) 1-2. Generating function (Lec. 1.1/1.2, random walks) Not assigned 27. Note: any corrections noted in 23 have not been made. This exercise is to show (or remind) you what a generating function is. (It is related to the partition functions in thermodynamic ensembles.) I didn t have time to find an easy application of a generating function. Consider a Markov process (e.g. random walk) happening in discrete time t =, 1,.... Let X represent the initial state which may recur during the process (e.g., the walk revisits the original site). Let p t Prob({X happens at step t}). (1a) f t Prob({X first recurs at step t}). By the definition, p = 1; what is f? It is often comparatively easy to obtain p t : for example, the probability for a onedimensional walk to be on a certain site is given by a binomial distribution, or approximated by a Gaussian. But it can be hard to obtain the distribution for first-passage to that site, f t. So, the object of this exercise is to find a general relation for p t in terms of f t. (Notice we really want f t in terms of p t ; hopefully, the functional relation we get is invertable.) a. On the way, it helps to define (1b) f k t Prob({X happens for the n-th time on step t), (1c) thus f t ft 1 Clearly, p t = k=1 f t k. So, since small numbers are easier, let s first figure out how to get ft 2 from ft 1; maybe that will reveal how to go to higher f t k, which in turn gives p t. Show that p 2 t = t t = f tf t t. (What is p 2 1, incidentally?) b. A very useful technique is the generating function that function whose Taylor series coefficients are the sequence of interest. So, let P (z) = p t z t ; F (z) = t= f t z t ; F k (z) = t= ft k z t. (2) t= What s the meaning (in terms of the walk) of P (1) and F (1)? (Since F (1) is a probability, we know F (1) 1. Thus F (z) is absolutely convergent for z 1, at least.) What s F (z)? (trivial). c. Show that F k (z) = F (z) k. (Hint: induction/recursion on k.) What, finally, is the relation between F (z) and P (z)? This should be a special case of the relation, derived in class, between the mean total number of returns, and the probability of never returning at all.

2 PHYSICS 653 HOMEWORK 1 P Random walk with random traps On a one-dimensional line, immobile traps are placed at random. Thus, the intervals free of traps have varying lengths L; the probability distribution of L is proportional to exp( L/L ), where L 1 is the typical spacing between traps. Say also that the walker walks with diffusion constant D.) Now, a random walker is started, at time t =, at a random place on the line; we are interested in the distribution P sur (t), of the survival time, i.e. the time until the walker s first encounter with a trap. Such distributions are measured e.g. in NMR (nuclear magnetic resonance) experiments: here the traps represent sites of magnetic ions bearing an electonic moment. (That scrambles the direction of the precessing nuclear spin in a liquid molecule, if its random motion happens to brings it near the magnetic ion). It turns out that P sur (t) has a slowly decaying tail out to long times: the question here is what is the asymptotic time dependence? (Keep in mind, it s more important to get the right functional dependence which power law, or exponential or Gaussian than the coefficients.) Preliminary Discussion. (1) This is an example of quenched disorder, an enormously important topic. (However, I ve left to the last week this year; since might not get to it, I ll mention disordered systems casually in a couple other places.) It means the Hamiltonian (or whatever else defines the rules of the game, e.g. the transition rates of a random walk) is not translationally invariant, depends on some prior random ensemble, and stays fixed (while some other ensemble depends on it) In real life, disordered systems come about when different degrees of freedom change with very different time scales: for example, you might make a metal crystal which is a random alloy of Cu and Zn atoms, and these move around much slower than the electrons moving through the lattice. Anyhow, the model in this exercise is another realization of the general notion of having two random ensembles, or of building one ensemble on another. (2) Before jumping in, think: where does the long-time tail of P sur (t) come from? Corresponding to the three random ensembles in this problem, there are three factors that could help a walker can survive an exceptionally long time * (i) it might be lucky by starting in a place where there are fewer traps than on average in a really wide interval; (ii) it might be lucky to get dealt a string of random steps such that it walks back and forth visiting comparatively few sites, so it has fewer chances to hit a trap. (iii) there s a third random ensemble, which is the initial position: the random walker would be lucky in having its initial position near the center. My intuition tells me either (i) or (ii) is the important factor, since the best cases are exponentially rare; as for (iii), any of the sites near the middle of an interval is nearly as good, so the tail of the distribution isn t exponential. (3) What do we know? Firstly, since this is 1D, the traps completely disconnect the system into a collection of the intervals between them: a walk can never pass from one interval to the next. Secondly (see class notes), we already know the probability distribution for a walker in one such interval. * Incidentally, I think these correspond to the two ways you may survive an exceptionally long time!

3 PHYSICS 653 HOMEWORK 1 P.3 (a). We can break the problem down into (i) what is the probability of being in an interval of length L? (ii) given the interval has length L, what is the survival probabilty S L (t)? We focus on (ii) first. Let S L (x; t) be the probability, given we started at x: we computed that in lecture. We decomposed S L (x; t) into normal sine modes, just like a vibrating string clamped at both ends, and the longest-lived mode was with a exponential decay rate p 1 (x) sin(πx/l) (1) τ 1 (L) 1 = D(π/L) 2 (2) Make the approximation of ignoring the other modes. That approximation may be bad at short times, in that the second-slowest mode in a long interval is surely slower than the slowest mode in a short interval. But we are going for the dominant longest time contribution. The distribution of starting points in the interval [what I called random ensemble (iii) in this problem] is uniform, P L (x; ) = 1/L. To write this as P L (x; ) = c 1 p 1 (x) +... (3) use orthogonality c 1 = dxp (x, )p 1(x) dxp 1(x) 2 (4) where the denominator is normalization. (So what s c 1? ) (b). Now P L (x; t) = c 1 p 1 (x)e t/τ 1(L) (5) since (by def n) a normal mode decays as a pure exponential. The survival probability in this interval is S L (t) = dxp L (x; t) (6) Your result should be dominated by the exponential factor e t/τ(l). This is the first desired result: mean lifetime, given that we landed in an interval of length L. (c). Meanwhile, what is the probability of being in an interval of length L? Imagine first calculating how many intervals there are of each length. March from the left, where some small fraction p is a trap. The probability of going for L steps w/o a trap is (1 p) L which we ll write as exp( L/L ), with e 1/L 1 p. If we toss a point randomly into one of these intervals, an interval of length L has a bigger cross section it has L times as many chances for points to land in it, as in an interval of length 1. Hence, the final distribution of interval lengths is dp (L) = (L/L ) 2 exp( L/L )dl (7)

4 PHYSICS 653 HOMEWORK 1 P.4 This is the second desired result. No work required in (c). (d). Putting it all together, we have S(t) = dp (L)S L (t) (8) in which the contributions from both kinds of randomness [(i) and (ii)] give an exponential factor. Finally, we deploy a simple method from asymptotic analysis. Write (8) as S(t) = dl exp[ F (L; t)]; (9) What is the function g(l; t)? The result of (9) is dominated by the value L (t) where F (L; t) is minimum. (You needn t check the validity for this exercise, but you need to in real life. It depends on the fact that, the larger t gets, the steeper that minimum is.) Plug L (t) into (9) to obtain a final formula for S(t). (This should be a stretched exponential, exp( constt x ) where x < 1.)

5 1-4. Mean time of a 1D random walk PHYSICS 653 HOMEWORK 1 P.5 Not assigned 27. Note: new problem watch for errors. This follows up on Prob 1-1. Let T (x) be the expected number of steps of a walk starting from x, to first reach the origin (or the location of a trap.) How can we compute this? (a). Take the model of Prob [Interval (, R).] I think you can see T (x) is related to Φ +. Use the same reasoning as in Prob 1-1: that is, if you re on site x at time t, then at time t + 1 you re on site x 1 or x + 1 with equal probabilities. This allows you to express T (x) in terms of T (x + 1) and T (x 1). Show this equation is 2 T (x) = 1 (1) where 2 f(x) f(x + 1) + f(x 1) 2f(x), as defined in class. (b). Eq. (1) is an inhomogeneous second-order linear difference equation. If it was a differential equation, the solution would be trivial for you. Show that this solution, in fact, works here. (c). Given that you know T () and T (R) [that was the first thing you asked right??], what are the coefficients of the homogeneous term in the solution to (1)? (d). The mean duration till the next return to the origin is T ret = 1 + T (1). (Why: any return to the origin starts by going one step away). The situation for a line without a trap at R must correspond physically to the limit as R. What is lim R T (1)? (e). Now let s consider a different approach. In lecture 1.1 (which section?) we used the method of images and the continuum diffusion equation to find the total survival probability S(t), given that we started at x. [Actually I should write it S(t; x) but I will suppress the x argument for a few steps.] We found 1 S(t) = (2) 4πDt for t > x 2 /D. (For smaller t you can use the approximation S(t).) Now, the function 1 S(t) is the probability that the walk died before time t. Therefore, its derivative is the probability density that the lifetime was exactly t: ds(t)/dt = p X (t) (3) The mean lifetime is Does this converge? T = p X (t)tdt. (4)

Knots, Coloring and Applications

Knots, Coloring and Applications Knots, Coloring and Applications Ben Webster University of Virginia March 10, 2015 Ben Webster (UVA) Knots, Coloring and Applications March 10, 2015 1 / 14 This talk is online at http://people.virginia.edu/~btw4e/knots.pdf

More information

Lecture 10: Powers of Matrices, Difference Equations

Lecture 10: Powers of Matrices, Difference Equations Lecture 10: Powers of Matrices, Difference Equations Difference Equations A difference equation, also sometimes called a recurrence equation is an equation that defines a sequence recursively, i.e. each

More information

Problems from Probability and Statistical Inference (9th ed.) by Hogg, Tanis and Zimmerman.

Problems from Probability and Statistical Inference (9th ed.) by Hogg, Tanis and Zimmerman. Math 224 Fall 2017 Homework 1 Drew Armstrong Problems from Probability and Statistical Inference (9th ed.) by Hogg, Tanis and Zimmerman. Section 1.1, Exercises 4,5,6,7,9,12. Solutions to Book Problems.

More information

So far in talking about thermodynamics, we ve mostly limited ourselves to

So far in talking about thermodynamics, we ve mostly limited ourselves to 251 Lecture 33 So far in talking about thermodynamics, we ve mostly limited ourselves to discussions of thermochemistry, a quantification of the heat absorbed or given off as the result of a chemical reaction.

More information

Figure 1: Doing work on a block by pushing it across the floor.

Figure 1: Doing work on a block by pushing it across the floor. Work Let s imagine I have a block which I m pushing across the floor, shown in Figure 1. If I m moving the block at constant velocity, then I know that I have to apply a force to compensate the effects

More information

Lecture 4: Constructing the Integers, Rationals and Reals

Lecture 4: Constructing the Integers, Rationals and Reals Math/CS 20: Intro. to Math Professor: Padraic Bartlett Lecture 4: Constructing the Integers, Rationals and Reals Week 5 UCSB 204 The Integers Normally, using the natural numbers, you can easily define

More information

Physics Dec The Maxwell Velocity Distribution

Physics Dec The Maxwell Velocity Distribution Physics 301 7-Dec-2005 29-1 The Maxwell Velocity Distribution The beginning of chapter 14 covers some things we ve already discussed. Way back in lecture 6, we calculated the pressure for an ideal gas

More information

Main topics for the First Midterm Exam

Main topics for the First Midterm Exam Main topics for the First Midterm Exam The final will cover Sections.-.0, 2.-2.5, and 4.. This is roughly the material from first three homeworks and three quizzes, in addition to the lecture on Monday,

More information

( )( b + c) = ab + ac, but it can also be ( )( a) = ba + ca. Let s use the distributive property on a couple of

( )( b + c) = ab + ac, but it can also be ( )( a) = ba + ca. Let s use the distributive property on a couple of Factoring Review for Algebra II The saddest thing about not doing well in Algebra II is that almost any math teacher can tell you going into it what s going to trip you up. One of the first things they

More information

Nondeterministic finite automata

Nondeterministic finite automata Lecture 3 Nondeterministic finite automata This lecture is focused on the nondeterministic finite automata (NFA) model and its relationship to the DFA model. Nondeterminism is an important concept in the

More information

Return probability on a lattice

Return probability on a lattice Return probability on a lattice Chris H. Rycroft October 24, 2006 To begin, we consider a basic example of a discrete first passage process. Consider an unbiased Bernoulli walk on the integers starting

More information

CH 66 COMPLETE FACTORING

CH 66 COMPLETE FACTORING CH 66 COMPLETE FACTORING THE CONCEPT OF COMPLETE FACTORING C onsider the task of factoring 8x + 1x. Even though is a common factor, and even though x is a common factor, neither of them is the GCF, the

More information

6.080 / Great Ideas in Theoretical Computer Science Spring 2008

6.080 / Great Ideas in Theoretical Computer Science Spring 2008 MIT OpenCourseWare http://ocw.mit.edu 6.080 / 6.089 Great Ideas in Theoretical Computer Science Spring 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.

More information

Physics Nov Cooling by Expansion

Physics Nov Cooling by Expansion Physics 301 19-Nov-2004 25-1 Cooling by Expansion Now we re going to change the subject and consider the techniques used to get really cold temperatures. Of course, the best way to learn about these techniques

More information

Watch for typos. This is typed 2003 from handwritten text of Lec. 2.4 Scaling [and exponent relations]

Watch for typos. This is typed 2003 from handwritten text of Lec. 2.4 Scaling [and exponent relations] Watch for typos. This is typed 2003 from handwritten text of 1995. Lec. 2.4 Scaling [and exponent relations] The scaling form idea is one of the ideas from this course that you re likeliest to use someday,

More information

Physics 212: Statistical mechanics II Lecture XI

Physics 212: Statistical mechanics II Lecture XI Physics 212: Statistical mechanics II Lecture XI The main result of the last lecture was a calculation of the averaged magnetization in mean-field theory in Fourier space when the spin at the origin is

More information

An Invitation to Mathematics Prof. Sankaran Vishwanath Institute of Mathematical Sciences, Chennai. Unit I Polynomials Lecture 1A Introduction

An Invitation to Mathematics Prof. Sankaran Vishwanath Institute of Mathematical Sciences, Chennai. Unit I Polynomials Lecture 1A Introduction An Invitation to Mathematics Prof. Sankaran Vishwanath Institute of Mathematical Sciences, Chennai Unit I Polynomials Lecture 1A Introduction Hello and welcome to this course titled An Invitation to Mathematics.

More information

Cosets and Lagrange s theorem

Cosets and Lagrange s theorem Cosets and Lagrange s theorem These are notes on cosets and Lagrange s theorem some of which may already have been lecturer. There are some questions for you included in the text. You should write the

More information

Lecture 6. Statistical Processes. Irreversibility. Counting and Probability. Microstates and Macrostates. The Meaning of Equilibrium Ω(m) 9 spins

Lecture 6. Statistical Processes. Irreversibility. Counting and Probability. Microstates and Macrostates. The Meaning of Equilibrium Ω(m) 9 spins Lecture 6 Statistical Processes Irreversibility Counting and Probability Microstates and Macrostates The Meaning of Equilibrium Ω(m) 9 spins -9-7 -5-3 -1 1 3 5 7 m 9 Lecture 6, p. 1 Irreversibility Have

More information

Name: Firas Rassoul-Agha

Name: Firas Rassoul-Agha Midterm 1 - Math 5010 - Spring 016 Name: Firas Rassoul-Agha Solve the following 4 problems. You have to clearly explain your solution. The answer carries no points. Only the work does. CALCULATORS ARE

More information

Lecture 4 - Random walk, ruin problems and random processes

Lecture 4 - Random walk, ruin problems and random processes Lecture 4 - Random walk, ruin problems and random processes Jan Bouda FI MU April 19, 2009 Jan Bouda (FI MU) Lecture 4 - Random walk, ruin problems and random processesapril 19, 2009 1 / 30 Part I Random

More information

RANDOM WALKS AND THE PROBABILITY OF RETURNING HOME

RANDOM WALKS AND THE PROBABILITY OF RETURNING HOME RANDOM WALKS AND THE PROBABILITY OF RETURNING HOME ELIZABETH G. OMBRELLARO Abstract. This paper is expository in nature. It intuitively explains, using a geometrical and measure theory perspective, why

More information

One sided tests. An example of a two sided alternative is what we ve been using for our two sample tests:

One sided tests. An example of a two sided alternative is what we ve been using for our two sample tests: One sided tests So far all of our tests have been two sided. While this may be a bit easier to understand, this is often not the best way to do a hypothesis test. One simple thing that we can do to get

More information

Collective Effects. Equilibrium and Nonequilibrium Physics

Collective Effects. Equilibrium and Nonequilibrium Physics Collective Effects in Equilibrium and Nonequilibrium Physics: Lecture 3, 3 March 2006 Collective Effects in Equilibrium and Nonequilibrium Physics Website: http://cncs.bnu.edu.cn/mccross/course/ Caltech

More information

2 Discrete Dynamical Systems (DDS)

2 Discrete Dynamical Systems (DDS) 2 Discrete Dynamical Systems (DDS) 2.1 Basics A Discrete Dynamical System (DDS) models the change (or dynamics) of single or multiple populations or quantities in which the change occurs deterministically

More information

Section 4.6 Negative Exponents

Section 4.6 Negative Exponents Section 4.6 Negative Exponents INTRODUCTION In order to understand negative exponents the main topic of this section we need to make sure we understand the meaning of the reciprocal of a number. Reciprocals

More information

DIFFUSION PURPOSE THEORY

DIFFUSION PURPOSE THEORY DIFFUSION PURPOSE The objective of this experiment is to study by numerical simulation and experiment the process of diffusion, and verify the expected relationship between time and diffusion width. THEORY

More information

Interacting Fermi Gases

Interacting Fermi Gases Interacting Fermi Gases Mike Hermele (Dated: February 11, 010) Notes on Interacting Fermi Gas for Physics 7450, Spring 010 I. FERMI GAS WITH DELTA-FUNCTION INTERACTION Since it is easier to illustrate

More information

Lecture 4: September Reminder: convergence of sequences

Lecture 4: September Reminder: convergence of sequences 36-705: Intermediate Statistics Fall 2017 Lecturer: Siva Balakrishnan Lecture 4: September 6 In this lecture we discuss the convergence of random variables. At a high-level, our first few lectures focused

More information

Diffusion Monte Carlo

Diffusion Monte Carlo Diffusion Monte Carlo Notes for Boulder Summer School 2010 Bryan Clark July 22, 2010 Diffusion Monte Carlo The big idea: VMC is a useful technique, but often we want to sample observables of the true ground

More information

213 Midterm coming up

213 Midterm coming up 213 Midterm coming up Monday April 8 @ 7 pm (conflict exam @ 5:15pm) Covers: Lectures 1-12 (not including thermal radiation) HW 1-4 Discussion 1-4 Labs 1-2 Review Session Sunday April 7, 3-5 PM, 141 Loomis

More information

Lecture 11: Non-Equilibrium Statistical Physics

Lecture 11: Non-Equilibrium Statistical Physics Massachusetts Institute of Technology MITES 2018 Physics III Lecture 11: Non-Equilibrium Statistical Physics In the previous notes, we studied how systems in thermal equilibrium can change in time even

More information

Regression, part II. I. What does it all mean? A) Notice that so far all we ve done is math.

Regression, part II. I. What does it all mean? A) Notice that so far all we ve done is math. Regression, part II I. What does it all mean? A) Notice that so far all we ve done is math. 1) One can calculate the Least Squares Regression Line for anything, regardless of any assumptions. 2) But, if

More information

MITOCW watch?v=poho4pztw78

MITOCW watch?v=poho4pztw78 MITOCW watch?v=poho4pztw78 GILBERT STRANG: OK. So this is a video in which we go for second-order equations, constant coefficients. We look for the impulse response, the key function in this whole business,

More information

TheFourierTransformAndItsApplications-Lecture28

TheFourierTransformAndItsApplications-Lecture28 TheFourierTransformAndItsApplications-Lecture28 Instructor (Brad Osgood):All right. Let me remind you of the exam information as I said last time. I also sent out an announcement to the class this morning

More information

MITOCW R11. Double Pendulum System

MITOCW R11. Double Pendulum System MITOCW R11. Double Pendulum System The following content is provided under a Creative Commons license. Your support will help MIT OpenCourseWare continue to offer high quality educational resources for

More information

Capacitors. Chapter How capacitors work Inside a capacitor

Capacitors. Chapter How capacitors work Inside a capacitor Chapter 6 Capacitors In every device we have studied so far sources, resistors, diodes and transistors the relationship between voltage and current depends only on the present, independent of the past.

More information

MA 1125 Lecture 15 - The Standard Normal Distribution. Friday, October 6, Objectives: Introduce the standard normal distribution and table.

MA 1125 Lecture 15 - The Standard Normal Distribution. Friday, October 6, Objectives: Introduce the standard normal distribution and table. MA 1125 Lecture 15 - The Standard Normal Distribution Friday, October 6, 2017. Objectives: Introduce the standard normal distribution and table. 1. The Standard Normal Distribution We ve been looking at

More information

ter. on Can we get a still better result? Yes, by making the rectangles still smaller. As we make the rectangles smaller and smaller, the

ter. on Can we get a still better result? Yes, by making the rectangles still smaller. As we make the rectangles smaller and smaller, the Area and Tangent Problem Calculus is motivated by two main problems. The first is the area problem. It is a well known result that the area of a rectangle with length l and width w is given by A = wl.

More information

Solve Wave Equation from Scratch [2013 HSSP]

Solve Wave Equation from Scratch [2013 HSSP] 1 Solve Wave Equation from Scratch [2013 HSSP] Yuqi Zhu MIT Department of Physics, 77 Massachusetts Ave., Cambridge, MA 02139 (Dated: August 18, 2013) I. COURSE INFO Topics Date 07/07 Comple number, Cauchy-Riemann

More information

MA554 Assessment 1 Cosets and Lagrange s theorem

MA554 Assessment 1 Cosets and Lagrange s theorem MA554 Assessment 1 Cosets and Lagrange s theorem These are notes on cosets and Lagrange s theorem; they go over some material from the lectures again, and they have some new material it is all examinable,

More information

Poisson distribution and χ 2 (Chap 11-12)

Poisson distribution and χ 2 (Chap 11-12) Poisson distribution and χ 2 (Chap 11-12) Announcements: Last lecture today! Labs will continue. Homework assignment will be posted tomorrow or Thursday (I will send email) and is due Thursday, February

More information

Math 111, Introduction to the Calculus, Fall 2011 Midterm I Practice Exam 1 Solutions

Math 111, Introduction to the Calculus, Fall 2011 Midterm I Practice Exam 1 Solutions Math 111, Introduction to the Calculus, Fall 2011 Midterm I Practice Exam 1 Solutions For each question, there is a model solution (showing you the level of detail I expect on the exam) and then below

More information

MATH240: Linear Algebra Review for exam #1 6/10/2015 Page 1

MATH240: Linear Algebra Review for exam #1 6/10/2015 Page 1 MATH24: Linear Algebra Review for exam # 6//25 Page No review sheet can cover everything that is potentially fair game for an exam, but I tried to hit on all of the topics with these questions, as well

More information

LECTURE 10: REVIEW OF POWER SERIES. 1. Motivation

LECTURE 10: REVIEW OF POWER SERIES. 1. Motivation LECTURE 10: REVIEW OF POWER SERIES By definition, a power series centered at x 0 is a series of the form where a 0, a 1,... and x 0 are constants. For convenience, we shall mostly be concerned with the

More information

Chapter 1: Useful definitions

Chapter 1: Useful definitions Chapter 1: Useful definitions 1.1. Cross-sections (review) The Nuclear and Radiochemistry class listed as a prerequisite is a good place to start. The understanding of a cross-section being fundamentai

More information

Physics 351 Wednesday, January 10, 2018

Physics 351 Wednesday, January 10, 2018 Physics 351 Wednesday, January 10, 2018 Chapers 1 5 mostly review freshman physics, so we ll go through them very quickly in the first few days of class. Read Chapters 1+2 for Friday. Read Chapter 3 (momentum

More information

19. TAYLOR SERIES AND TECHNIQUES

19. TAYLOR SERIES AND TECHNIQUES 19. TAYLOR SERIES AND TECHNIQUES Taylor polynomials can be generated for a given function through a certain linear combination of its derivatives. The idea is that we can approximate a function by a polynomial,

More information

Lesson 6-1: Relations and Functions

Lesson 6-1: Relations and Functions I ll bet you think numbers are pretty boring, don t you? I ll bet you think numbers have no life. For instance, numbers don t have relationships do they? And if you had no relationships, life would be

More information

Algebra & Trig Review

Algebra & Trig Review Algebra & Trig Review 1 Algebra & Trig Review This review was originally written for my Calculus I class, but it should be accessible to anyone needing a review in some basic algebra and trig topics. The

More information

Linear and nonlinear spectroscopy

Linear and nonlinear spectroscopy Linear and nonlinear spectroscopy We ve seen that we can determine molecular frequencies and dephasing rates (for electronic, vibrational, or spin degrees of freedom) from frequency-domain or timedomain

More information

Lecture 6 Examples and Problems

Lecture 6 Examples and Problems Lecture 6 Examples and Problems Heat capacity of solids & liquids Thermal diffusion Thermal conductivity Irreversibility Hot Cold Random Walk and Particle Diffusion Counting and Probability Microstates

More information

Lab 11 - Free, Damped, and Forced Oscillations

Lab 11 - Free, Damped, and Forced Oscillations Lab 11 Free, Damped, and Forced Oscillations L11-1 Name Date Partners Lab 11 - Free, Damped, and Forced Oscillations OBJECTIVES To understand the free oscillations of a mass and spring. To understand how

More information

Instructor (Brad Osgood)

Instructor (Brad Osgood) TheFourierTransformAndItsApplications-Lecture26 Instructor (Brad Osgood): Relax, but no, no, no, the TV is on. It's time to hit the road. Time to rock and roll. We're going to now turn to our last topic

More information

MATH 521, WEEK 2: Rational and Real Numbers, Ordered Sets, Countable Sets

MATH 521, WEEK 2: Rational and Real Numbers, Ordered Sets, Countable Sets MATH 521, WEEK 2: Rational and Real Numbers, Ordered Sets, Countable Sets 1 Rational and Real Numbers Recall that a number is rational if it can be written in the form a/b where a, b Z and b 0, and a number

More information

RANDOM WALKS IN ONE DIMENSION

RANDOM WALKS IN ONE DIMENSION RANDOM WALKS IN ONE DIMENSION STEVEN P. LALLEY 1. THE GAMBLER S RUIN PROBLEM 1.1. Statement of the problem. I have A dollars; my colleague Xinyi has B dollars. A cup of coffee at the Sacred Grounds in

More information

Math 5a Reading Assignments for Sections

Math 5a Reading Assignments for Sections Math 5a Reading Assignments for Sections 4.1 4.5 Due Dates for Reading Assignments Note: There will be a very short online reading quiz (WebWork) on each reading assignment due one hour before class on

More information

Lecture 5: Continuity II

Lecture 5: Continuity II Lecture 5: Continuity II Nathan Pflueger 18 September 2013 1 Introduction Today we continue our discussion of continuity. We begin by stating a seemingly obvious feature of continuous functions, but one

More information

Slope Fields: Graphing Solutions Without the Solutions

Slope Fields: Graphing Solutions Without the Solutions 8 Slope Fields: Graphing Solutions Without the Solutions Up to now, our efforts have been directed mainly towards finding formulas or equations describing solutions to given differential equations. Then,

More information

(Refer Slide Time: 0:21)

(Refer Slide Time: 0:21) Theory of Computation Prof. Somenath Biswas Department of Computer Science and Engineering Indian Institute of Technology Kanpur Lecture 7 A generalisation of pumping lemma, Non-deterministic finite automata

More information

Week 2: Defining Computation

Week 2: Defining Computation Computational Complexity Theory Summer HSSP 2018 Week 2: Defining Computation Dylan Hendrickson MIT Educational Studies Program 2.1 Turing Machines Turing machines provide a simple, clearly defined way

More information

CS1800: Strong Induction. Professor Kevin Gold

CS1800: Strong Induction. Professor Kevin Gold CS1800: Strong Induction Professor Kevin Gold Mini-Primer/Refresher on Unrelated Topic: Limits This is meant to be a problem about reasoning about quantifiers, with a little practice of other skills, too

More information

5 Topological defects and textures in ordered media

5 Topological defects and textures in ordered media 5 Topological defects and textures in ordered media In this chapter we consider how to classify topological defects and textures in ordered media. We give here only a very short account of the method following

More information

MACHINE LEARNING INTRODUCTION: STRING CLASSIFICATION

MACHINE LEARNING INTRODUCTION: STRING CLASSIFICATION MACHINE LEARNING INTRODUCTION: STRING CLASSIFICATION THOMAS MAILUND Machine learning means different things to different people, and there is no general agreed upon core set of algorithms that must be

More information

Sequences and infinite series

Sequences and infinite series Sequences and infinite series D. DeTurck University of Pennsylvania March 29, 208 D. DeTurck Math 04 002 208A: Sequence and series / 54 Sequences The lists of numbers you generate using a numerical method

More information

Finding Limits Graphically and Numerically

Finding Limits Graphically and Numerically Finding Limits Graphically and Numerically 1. Welcome to finding limits graphically and numerically. My name is Tuesday Johnson and I m a lecturer at the University of Texas El Paso. 2. With each lecture

More information

P (E) = P (A 1 )P (A 2 )... P (A n ).

P (E) = P (A 1 )P (A 2 )... P (A n ). Lecture 9: Conditional probability II: breaking complex events into smaller events, methods to solve probability problems, Bayes rule, law of total probability, Bayes theorem Discrete Structures II (Summer

More information

6. Qualitative Solutions of the TISE

6. Qualitative Solutions of the TISE 6. Qualitative Solutions of the TISE Copyright c 2015 2016, Daniel V. Schroeder Our goal for the next few lessons is to solve the time-independent Schrödinger equation (TISE) for a variety of one-dimensional

More information

MITOCW ocw f99-lec23_300k

MITOCW ocw f99-lec23_300k MITOCW ocw-18.06-f99-lec23_300k -- and lift-off on differential equations. So, this section is about how to solve a system of first order, first derivative, constant coefficient linear equations. And if

More information

2.3 Damping, phases and all that

2.3 Damping, phases and all that 2.3. DAMPING, PHASES AND ALL THAT 107 2.3 Damping, phases and all that If we imagine taking our idealized mass on a spring and dunking it in water or, more dramatically, in molasses), then there will be

More information

base 2 4 The EXPONENT tells you how many times to write the base as a factor. Evaluate the following expressions in standard notation.

base 2 4 The EXPONENT tells you how many times to write the base as a factor. Evaluate the following expressions in standard notation. EXPONENTIALS Exponential is a number written with an exponent. The rules for exponents make computing with very large or very small numbers easier. Students will come across exponentials in geometric sequences

More information

Localization I: General considerations, one-parameter scaling

Localization I: General considerations, one-parameter scaling PHYS598PTD A.J.Leggett 2013 Lecture 4 Localization I: General considerations 1 Localization I: General considerations, one-parameter scaling Traditionally, two mechanisms for localization of electron states

More information

Homework set 2 - Solutions

Homework set 2 - Solutions Homework set 2 - Solutions Math 495 Renato Feres Simulating a Markov chain in R Generating sample sequences of a finite state Markov chain. The following is a simple program for generating sample sequences

More information

EXAM 2 REVIEW DAVID SEAL

EXAM 2 REVIEW DAVID SEAL EXAM 2 REVIEW DAVID SEAL 3. Linear Systems and Matrices 3.2. Matrices and Gaussian Elimination. At this point in the course, you all have had plenty of practice with Gaussian Elimination. Be able to row

More information

Daily Update. Dondi Ellis. January 27, 2015

Daily Update. Dondi Ellis. January 27, 2015 Daily Update Dondi Ellis January 27, 2015 CLASS 1: Introduction and Section 1.1 REMINDERS: Assignment: Read sections 1.1 and 1.2, and Student Guide (online). Buy a TI-84 or other graphing calculator satisfying

More information

Descriptive Statistics (And a little bit on rounding and significant digits)

Descriptive Statistics (And a little bit on rounding and significant digits) Descriptive Statistics (And a little bit on rounding and significant digits) Now that we know what our data look like, we d like to be able to describe it numerically. In other words, how can we represent

More information

ESS 461 Notes and problem set - Week 1 - Radioactivity

ESS 461 Notes and problem set - Week 1 - Radioactivity ESS 461 Notes and problem set - Week 1 - Radioactivity Radioactive decay: Statistical law of radioactivity: The probability that a radioactive atom will decay in a given time interval is constant and not

More information

Once Upon A Time, There Was A Certain Ludwig

Once Upon A Time, There Was A Certain Ludwig Once Upon A Time, There Was A Certain Ludwig Statistical Mechanics: Ensembles, Distributions, Entropy and Thermostatting Srinivas Mushnoori Chemical & Biochemical Engineering Rutgers, The State University

More information

MATH 56A SPRING 2008 STOCHASTIC PROCESSES

MATH 56A SPRING 2008 STOCHASTIC PROCESSES MATH 56A SPRING 008 STOCHASTIC PROCESSES KIYOSHI IGUSA Contents 4. Optimal Stopping Time 95 4.1. Definitions 95 4.. The basic problem 95 4.3. Solutions to basic problem 97 4.4. Cost functions 101 4.5.

More information

P3317 HW from Lecture and Recitation 10

P3317 HW from Lecture and Recitation 10 P3317 HW from Lecture 18+19 and Recitation 10 Due Nov 6, 2018 Problem 1. Equipartition Note: This is a problem from classical statistical mechanics. We will need the answer for the next few problems, and

More information

Step 1. Step 2. g l = g v. dg = 0 We have shown that over a plane surface of water. g v g l = ρ v R v T ln e/e sat. this can be rewritten

Step 1. Step 2. g l = g v. dg = 0 We have shown that over a plane surface of water. g v g l = ρ v R v T ln e/e sat. this can be rewritten The basic question is what makes the existence of a droplet thermodynamically preferable to the existence only of water vapor. We have already derived an expression for the saturation vapor pressure over

More information

Entropy. Probability and Computing. Presentation 22. Probability and Computing Presentation 22 Entropy 1/39

Entropy. Probability and Computing. Presentation 22. Probability and Computing Presentation 22 Entropy 1/39 Entropy Probability and Computing Presentation 22 Probability and Computing Presentation 22 Entropy 1/39 Introduction Why randomness and information are related? An event that is almost certain to occur

More information

Addition of Opacities and Absorption

Addition of Opacities and Absorption Addition of Opacities and Absorption If the only way photons could interact was via simple scattering, there would be no blackbodies. We ll go into that in much more detail in the next lecture, but the

More information

Lecture 27: Theory of Computation. Marvin Zhang 08/08/2016

Lecture 27: Theory of Computation. Marvin Zhang 08/08/2016 Lecture 27: Theory of Computation Marvin Zhang 08/08/2016 Announcements Roadmap Introduction Functions Data Mutability Objects This week (Applications), the goals are: To go beyond CS 61A and see examples

More information

CHMC: Finite Fields 9/23/17

CHMC: Finite Fields 9/23/17 CHMC: Finite Fields 9/23/17 1 Introduction This worksheet is an introduction to the fascinating subject of finite fields. Finite fields have many important applications in coding theory and cryptography,

More information

Line Broadening. φ(ν) = Γ/4π 2 (ν ν 0 ) 2 + (Γ/4π) 2, (3) where now Γ = γ +2ν col includes contributions from both natural broadening and collisions.

Line Broadening. φ(ν) = Γ/4π 2 (ν ν 0 ) 2 + (Γ/4π) 2, (3) where now Γ = γ +2ν col includes contributions from both natural broadening and collisions. Line Broadening Spectral lines are not arbitrarily sharp. There are a variety of mechanisms that give them finite width, and some of those mechanisms contain significant information. We ll consider a few

More information

12. Spectral diffusion

12. Spectral diffusion 1. Spectral diffusion 1.1. Spectral diffusion, Two-Level Systems Until now, we have supposed that the optical transition frequency of each single molecule is a constant (except when we considered its variation

More information

Modelling data networks stochastic processes and Markov chains

Modelling data networks stochastic processes and Markov chains Modelling data networks stochastic processes and Markov chains a 1, 3 1, 2 2, 2 b 0, 3 2, 3 u 1, 3 α 1, 6 c 0, 3 v 2, 2 β 1, 1 Richard G. Clegg (richard@richardclegg.org) November 2016 Available online

More information

Solving Quadratic & Higher Degree Equations

Solving Quadratic & Higher Degree Equations Chapter 9 Solving Quadratic & Higher Degree Equations Sec 1. Zero Product Property Back in the third grade students were taught when they multiplied a number by zero, the product would be zero. In algebra,

More information

Markov Chain Monte Carlo The Metropolis-Hastings Algorithm

Markov Chain Monte Carlo The Metropolis-Hastings Algorithm Markov Chain Monte Carlo The Metropolis-Hastings Algorithm Anthony Trubiano April 11th, 2018 1 Introduction Markov Chain Monte Carlo (MCMC) methods are a class of algorithms for sampling from a probability

More information

5.4 Continuity: Preliminary Notions

5.4 Continuity: Preliminary Notions 5.4. CONTINUITY: PRELIMINARY NOTIONS 181 5.4 Continuity: Preliminary Notions 5.4.1 Definitions The American Heritage Dictionary of the English Language defines continuity as an uninterrupted succession,

More information

Weak Ergodicity Breaking WCHAOS 2011

Weak Ergodicity Breaking WCHAOS 2011 Weak Ergodicity Breaking Eli Barkai Bar-Ilan University Bel, Burov, Korabel, Margolin, Rebenshtok WCHAOS 211 Outline Single molecule experiments exhibit weak ergodicity breaking. Blinking quantum dots,

More information

Lecture 8: Differential Equations. Philip Moriarty,

Lecture 8: Differential Equations. Philip Moriarty, Lecture 8: Differential Equations Philip Moriarty, philip.moriarty@nottingham.ac.uk NB Notes based heavily on lecture slides prepared by DE Rourke for the F32SMS module, 2006 8.1 Overview In this final

More information

Lecture 4: Simulated Annealing. An Introduction to Meta-Heuristics, Produced by Qiangfu Zhao (Since 2012), All rights reserved

Lecture 4: Simulated Annealing. An Introduction to Meta-Heuristics, Produced by Qiangfu Zhao (Since 2012), All rights reserved Lecture 4: Simulated Annealing Lec04/1 Neighborhood based search Step 1: s=s0; Step 2: Stop if terminating condition satisfied; Step 3: Generate N(s); Step 4: s =FindBetterSolution(N(s)); Step 5: s=s ;

More information

Continuous case Discrete case General case. Hazard functions. Patrick Breheny. August 27. Patrick Breheny Survival Data Analysis (BIOS 7210) 1/21

Continuous case Discrete case General case. Hazard functions. Patrick Breheny. August 27. Patrick Breheny Survival Data Analysis (BIOS 7210) 1/21 Hazard functions Patrick Breheny August 27 Patrick Breheny Survival Data Analysis (BIOS 7210) 1/21 Introduction Continuous case Let T be a nonnegative random variable representing the time to an event

More information

Quadratic Equations Part I

Quadratic Equations Part I Quadratic Equations Part I Before proceeding with this section we should note that the topic of solving quadratic equations will be covered in two sections. This is done for the benefit of those viewing

More information

PHYSICS 715 COURSE NOTES WEEK 1

PHYSICS 715 COURSE NOTES WEEK 1 PHYSICS 715 COURSE NOTES WEEK 1 1 Thermodynamics 1.1 Introduction When we start to study physics, we learn about particle motion. First one particle, then two. It is dismaying to learn that the motion

More information

Quantum Mechanics- I Prof. Dr. S. Lakshmi Bala Department of Physics Indian Institute of Technology, Madras

Quantum Mechanics- I Prof. Dr. S. Lakshmi Bala Department of Physics Indian Institute of Technology, Madras Quantum Mechanics- I Prof. Dr. S. Lakshmi Bala Department of Physics Indian Institute of Technology, Madras Lecture - 6 Postulates of Quantum Mechanics II (Refer Slide Time: 00:07) In my last lecture,

More information

Statistics 100A Homework 5 Solutions

Statistics 100A Homework 5 Solutions Chapter 5 Statistics 1A Homework 5 Solutions Ryan Rosario 1. Let X be a random variable with probability density function a What is the value of c? fx { c1 x 1 < x < 1 otherwise We know that for fx to

More information

MAT137 - Term 2, Week 2

MAT137 - Term 2, Week 2 MAT137 - Term 2, Week 2 This lecture will assume you have watched all of the videos on the definition of the integral (but will remind you about some things). Today we re talking about: More on the definition

More information