Archive for March, 2007

a listmania: essentials of undergraduate math for aspiring applied math students

Friday, March 30th, 2007

Since I’ve been using amazon so much lately, I decided I might as well take the plunge and use all its features. Just finished the first revision of my first listmania. Comments or suggestions for additions (keeping in mind the orthogonality condition)? I can’t think of any good ODE books.

Folland for the weekend

Friday, March 30th, 2007

Looks like my plan for the weekend is to spend some time in bed with Folland’s Real Analysis. I didn’t realize at the time I took the course what a godsend this book is– I thought it was too dense at the time– but now I see how it functions almost perfectly as a reference book for the analysis I need to know to handle advanced probability treatises.

The fact that he immediately takes the abstract approach to measures means that– besides the fact that, unlike in many books which serve the same function, pages aren’t wasted on the development of exclusively the Lebesgue measure/integral, which is then generalized and repeated for abstract measures/integrals– he completely covers probability spaces as a (albeit unmentioned) subset of his discussion. His functional analysis chapter is also pretty comprehensive in relation to the functional analysis I’ve seen used in probability treatises, even though he doesn’t cover the important topics of self-adjoint or compact operators. And, I’m particularly grateful for the chapter on point-set topology, because to my shame I forgot most of the general topology I knew, and that turns out to be very important (duh, I guess).

At this stage though, the most attractive feature of his book is the short chapter which provides short, rigorous proofs of the Central Limit Theorem, 0-1 Law, Laws of Large Numbers, and other basic probabilistic results.

What I’ve learned about Large Deviation Theory

Friday, March 30th, 2007

We’re two lectures into the large deviations course, and I think I have some grasp of what large deviation theory is about. It deals with the probability of large deviations from expected values– “the analysis of the tail of probability distributions”. Here’s one example of a LDT result (a Large Deviation Principle):

Cramer’s Theorem
Let X_1, X_2, \ldots be a sequence of bounded i.i.d. random variables with mean m, and let M_n = \frac{1}{n}( X_1 + X_2 + \cdots + X_n) be the empirical means; then the tail of the probability distribution of M_n decay exponentially with increasing n at a rate given by a convex rate-function I(x):
\mathbb{P}\{M_n > x\} \asymp e^{-nI(x)} \text{ for } x>m
\mathbb{P}\{M_n < x\} \asymp e^{-nI(x)} \text{ for } x<m

Cramer apparently first proved this theorem using complex variables method and found I(x)– the rate function– as a power series expansion. I’m glad to have discovered this, because the way we were shown of finding I in class is very technical, and was supplied without motivation.

Specifically, we developed Cramer’s theorem by defining I as the Fenchel transform of the logarithm of the moment generating function of X_n, and proving (well, so far accepting the validity of) a technical lemma which has Cramer’s theorem as a corollary. Mathematically impressive, but it provides no motivation for why we knew that defining I in that way would give us useful results. Apparently this formulation of I is an application of another result in Large Deviation Theory, Varadhan’s Theorem on the asymptotics of expectations of random sequences.

An Introduction to Large Deviations for Teletraffic Engineers seems to be a good basic reference for LDT.

victory is mine over probability!

Wednesday, March 28th, 2007

Ha! Things are looking up. I just read through the first 15 pages of one of our recommended readings for large deviations, on concentration of measure inequalities– 15 pages in under 45 minutes is nontrivial, folks :). At first I was scared because I couldn’t for the life of me figure out why

 \mathbb{E}X = \int_0^\infty \mathbb{P}\{X \geq t \} \: dt,

and that was literally the first equation on the first page! But then I decided to go with it for the nonce, and the rest went so smooth, I had learned about Bernstein’s inequality before I knew it. If the rest of the reading goes like this, I might remember stuff! I certainly understand it.

Oh, and I did figure out how to prove that heart stopper: use Fubini. I have seen this before, in a different context, when I was taking Papadakis’ fourier analysis course. See what I mean about forgetting stuff? At least this time forgetting helped me to figure out for myself how to prove it.

kvetching about probability

Wednesday, March 28th, 2007

Studying probability is such a downer! I’ve seen all this stuff before, some of it several times, yet it all seems to fly right out of my head. Things like the monotone class theorem, which types of convergence of r.v.s imply other types of convergence and in what circumstances, \limsup \mathbb{P}(A_n) \leq \mathbb{P}(\limsup A_n), important basic stuff like that is taking me forever to review. Given this, my large deviations course is going to be hell! Not so much the stochastics course, because he’s starting from scratch with an accelerated review of probability, but in large deviations, I didn’t even understand the first lecture which was supposed to be heuristic and intuitive. Ha! I guess I should go review that lecture now…

How to easily find (forward) finite difference approximations to multiple derivatives with an arbitrary order of accuracy

Wednesday, March 28th, 2007

I decided to go ahead and attempt one of my problem sets early, and I found that in the process, I needed to come up with an order two FD approximation to uu_x + u_{xxx}. Generally when I come across a question like this, it usually just asks for a 2nd order approximation to say the 1st derivative, and then I just mess around with various combinations of Taylor series expansions of the type u(x_0 + k h), until I hit upon what I need.

Even for that relatively simple case, this procedure is a pain in the ass. I didn’t think I was up to it for the 3rd derivative, so I came up with a more systematic procedure, which can be used to get u^{(r)}(x_0) with accuracy O(h^n). It gives a forward finite differences scheme, but the idea should be adaptable to backward and central difference schemes also.

Here’s the idea: let w_i be a weight by which we will multiply u(x_0 + ih). Then

 w_i u(x_0 + ih) = \sum_{k=0}^{r+n-1} w_i u^{(k)}(x_0) \frac{(ih)^k }{k!}  + O(h^{n+r})

so

 \sum_{i \in I} w_i u(x_0 + ih) = \sum_{k=0}^{r+n-1} \frac{h^k}{k!} u^{(k)}(x_0) \left( \sum_{i \in I} w_i  i^k \right) + O(h^{n+r})

Letting p_k = \sum_{i \in I} w_i i^k, what we want is  p_0 = p_1 = \ldots = p_{r-1} = 0, \: p_r = 1, \: p_{r+1} = \ldots = p_{r+n-1} = 0, because if this holds true,

\sum_{i \in I} w_i u(x_0 + ih) = \frac{h^r}{r!} u^{(r)}(x_0) + O(h^{n+r})

which would imply

 \frac{r!}{h^r} \sum_{i \in I} w_i u(x_0 + ih) = u^{(r)}(x_0) + O(h^n)

as desired.

So the question is how do we choose I and \{w_i\} such that we have the appropriate conditions on \{p_k\}? Well, note that if we write p = (p_k) and w = (w_i) as vectors, we have p = A w where  A_{ij} = j^{i-1}. Conveniently, when such an A is square, it is full rank (prove it!), so we can invert to find the weights. Since k varies between 0 and r+n-1, letting I contain 1 to r+n makes A square.

Voila! (I’d like to say Q.E.D., but this was an algorithm, not a proof :( )

To recap, if you want to approximate u^{(r)}(x_0) with accuracy O(h^n) using forward differences, use the r+n point approximation

 \frac{r!}{h^r} \sum_{i=1}^{r+n} w_i u(x_0 + ih) = u^{r}(x_0) + O(h^n)

where the weight vector w is chosen to satisfy

 A w = \begin{pmatrix} 0 \\  \vdots \\ 0 \\ 1 \\ 0 \\ \vdots \\ 0 \end{pmatrix}

where A_{ij} = j^{i-1} and the 1 is in the r+1-th entry of the rhs vector.


Of course, you better check all my algebra if you intend to use this for anything important. I’m sure I messed up somewhere– I tried coding this up in Mathematica to test it and got weird results– but I’ve spent enough time on it for now.

“Running History Backwards”

Wednesday, March 28th, 2007

Stephen Hawkings is giving a talk entitled “Running History Backwards” here on April 2nd, at 4pm. I have a required department colloqium from 4:15-5 on the same day. I actually wanted to go to this one, because it’s about optimization with PDEs as constraints: “Fast Algorithms for Variational Problems Constrained by Elliptic and Evolution Equations”. Sounds nice, yes? But from past experience I would be lucky to understand more than the introduction, and even that vaguely.

All other considerations aside, the opportunity is there for me to see the vaunted Dr. Hawkings– I’ve never read any of his books, being neither a theoretical physicist nor a frequent consumer of popular science works– so this would be my first exposure to him. How cool is that? Guess where I’m going to be at 4pm on April 2nd…

random hottie

Tuesday, March 27th, 2007

A really hot girl works in Guggenheim, the building next door to us. I pass her on the stairs several times a week, and sometimes see her working in her office at ungodly hours; this morning I ran into her leaving the Cats. Everytime I see her, even if she’s sitting at her computer, she looks like she just got back from doing something healthy to the n-th degree (like a 27K marathon), followed by a quick shower. I can’t put my finger on what makes her so attractive– yes, she’s definitely got the physical aspect: she’s somewhere between Lexa Doig (brunette and similar size and mannerisms and that fresh-out-of-the-shower-and-all-put-together look) and Ali Larter (body type)– but I suspect it has to do with the specific combination of brains, beauty, and especially strength-in-action that she represents. She seems to have it all, in the right proportions.

Einstein and brownian motion

Monday, March 26th, 2007

I have often wondered why Einstein’s paper on brownian motion was considered such a watershed. But then I realized that atoms were still controversial in 1905! Odd to think that during Einstein’s lifetime, we went from being unsure about atoms to the beginnings of quantum theory, and along the way managed to develop GR. Wow. I wonder what we’ll see in my lifetime?

At some point I have to read his original paper. I’ve seen his insights on Brownian motion explained in modern probabilistic terms several times (it’s as popular an illustratory example in probability texts as the wave equation or laplace’s equation are in PDE texts), but I suspect that they’ve been modernized, mathematized, and dephysicized. I’d like to see them in their natural habitat.

Incidentally, one of the courses I’m taking this term– and I’m freaking stoked about it!–, ACM 217: Stochastic calculus and stochastic control, will apparently have course notes online. If the quality of the notes yet to be posted is comparable to that of those already up, this will be a great resource to learn about stochastic processes and stochastic calculus.