# Administrative Information - **Class Meeting**: Friday, October 23, 2026, 1:00–1:50pm β€” **Coolbaugh 212** - Previous meeting: [[MATH310F26(Day 23) - Transport moves, diffusion spreads]] - πŸ“„ [[Teaching/MATH310/MATH310F26/Administration/MATH310_F26_Syllabus_1.0.pdf|MATH 310 F26 Syllabus, v1.0]] > [!info]- Admin. Notes > Expect an LR and WB for each lecture. WBs target 15-minute engagements (longer early on); LRs are short, ~5 minutes. > > - 🎯 **[LR] [Day 22 Reflection Questions](https://elearning.mines.edu/courses/81632/quizzes/121959)** Β· **[Statement](https://elearning.mines.edu/courses/81632/quizzes/121960)** β€” due **Friday 10/23, 11:59pm** > - 🎯 **[LR] [Day 23 Reflection Questions](https://elearning.mines.edu/courses/81632/quizzes/121971)** β€” 4 questions drawn from Wednesday's material, unlimited attempts, highest kept β€” due **Friday 10/30, 11:59pm** > - 🎯 **[LR] [Day 23 Reflection Statement](https://elearning.mines.edu/courses/81632/quizzes/121972)** β€” one free response, no wrong answers β€” due **Friday 10/30, 11:59pm** > - 🎯 **[LR] [Day 24 Reflection Questions](https://elearning.mines.edu/courses/81632/quizzes/122140)** β€” 4 questions drawn from today's material, unlimited attempts, highest kept β€” due **Friday 10/30, 11:59pm** > - 🎯 **[LR] [Day 24 Reflection Statement](https://elearning.mines.edu/courses/81632/quizzes/122141)** β€” one free response, no wrong answers β€” due **Friday 10/30, 11:59pm** > - 🎯 **[MR] [Media Reflection Questions](https://elearning.mines.edu/courses/81632/quizzes/121701)** Β· **[Statement](https://elearning.mines.edu/courses/81632/quizzes/121702)** Β· [[The Breakdown of Linear Stability Analysis and Critical Slowing Down|the page]] β€” due **Friday 10/23, 11:59pm**. **IT has cleared `scottastrong.org`** for the campus network (announced today), so the applets should now load on campus; email if they don't. > - πŸ“ **[MP3 β€” Initial Model and Test (first results)](https://elearning.mines.edu/courses/81632/assignments/590872)** and **[MA2 β€” Source and Background](https://elearning.mines.edu/courses/81632/assignments/590873)** β€” due **Monday 10/26, 11:59pm** ([[MATH310F26 - Project Work|Project Work]]; today if you want, more time on request). Another round of feedback follows. > - πŸ•’ **Office block for 310:** Friday 3pm this week; more blocks next week. > - 🎯 **[WB] [Workbook 11](https://elearning.mines.edu/courses/81632/assignments/588368)** Β· [[MATH310F26_WB11.pdf|blank]] Β· [[MATH310F26(Workbook 11 Companion) - Three outcomes, two moments|companion]] β€” due **Friday 10/30, 11:59pm** > - 🎬 [[MATH310F26 - Random numbers, two videos]] β€” the guided videos for this unit, if you haven't yet > - πŸ–ΌοΈ [[MATH310F26 - Convolution, in pictures]] β€” the convolution integral's meaning, told with the walk's own objects: two steps as $p*p$, $n$ steps as $p^{*n}\to$ Gaussian, the stamp-the-normal integral, moving averages, kernels, and why Fourier keeps showing up; four-language code at the end --- # Deliverables - 🎯 **[LR] [Day 24 Reflection Questions](https://elearning.mines.edu/courses/81632/quizzes/122140)** β€” 4 questions drawn from today's material, unlimited attempts, highest kept β€” due **Friday 10/30, 11:59pm** - 🎯 **[LR] [Day 24 Reflection Statement](https://elearning.mines.edu/courses/81632/quizzes/122141)** β€” one free response, no wrong answers β€” due **Friday 10/30, 11:59pm** - πŸ“ **[MP3](https://elearning.mines.edu/courses/81632/assignments/590872)** and **[MA2](https://elearning.mines.edu/courses/81632/assignments/590873)** β€” due **Monday 10/26, 11:59pm** Questions and statement are due Friday 10/30 at 11:59 pm (moved from Monday 10/26; the pair went live late). --- # Lecture Boards + Transcript + GenAI **Twenty-fourth meeting, October 23 β€” the continuum transport–diffusion process, with applications.** Board header: *24 | 10/23/26, The continuum transport-diffusion process w/ App.* Family weekend in Golden, sun before the rain, and the end of the random-walk sequence: "there's a bunch of gobbledygook in my brain that I wanna try to make sure to get out to you before I should wrap it up," so the hour is deliberately frenetic and tied down with pictures. One more talk on Monday, probably; then **discrete-time processes**, with the goal of putting randomness onto them so that *deterministic* and *discrete* join up; after that, about five lecture slots that will mostly become group work in support of the projects. Prizes are [Starburst](https://en.wikipedia.org/wiki/Starburst_(confectionery)) β€” a bet lost to the summer numerical-science class. The content, in order: the missing $2\pi$ restored (Tony); micro, macro, and the *[meso](https://en.wikipedia.org/wiki/Mesoscopic_physics)* in between; the normal distribution matched coefficient by coefficient to the walkers' Gaussian β€” *why* the [central limit theorem](https://en.wikipedia.org/wiki/Central_limit_theorem); the [convolution integral](https://en.wikipedia.org/wiki/Convolution) that generalizes the delta start to any start; two applets; a [3Blue1Brown](https://en.wikipedia.org/wiki/3Blue1Brown) clip on convolution; and a slide run from [Gaussian blur](https://en.wikipedia.org/wiki/Gaussian_blur) to edge-preserving *nonlinear* blur, via a [fingerprint](https://en.wikipedia.org/wiki/Fingerprint). ## Recall, with an edit For the walk process with $\Delta x,\Delta t\searrow 0$, the proportion of walkers at $(x,t)$ obeys $(1)\qquad \frac{\partial u}{\partial t}=\frac{D}{2}\,\frac{\partial^{2}u}{\partial x^{2}}-c\,\frac{\partial u}{\partial x},$ where $D$ is the **[diffusivity](https://en.wikipedia.org/wiki/Mass_diffusivity)** and β€” not written last time, but shown by the $f(x-ct)$ solutions and by its units β€” $c$ is the **speed of drift**. Think of (1) as the **macroscopic representation of the microscopic walkers.** And if $u(x,0)=\delta(x)$, Fourier can show $u(x,t)=\frac{1}{\sqrt{2\pi D t}}\;e^{-\dfrac{(x-ct)^{2}}{2Dt}}=g(x,t),$ with the $\sqrt{2\pi}$ **missing from last time** β€” Tony pointed it out. It was a judgment call about where the $2\pi$ lives, made on the fly from how this course placed the $2\pi$ in its [Fourier transform](https://en.wikipedia.org/wiki/Fourier_transform); a second look after class settled it: the $2\pi$ belongs. "It's just a [normalization constant](https://en.wikipedia.org/wiki/Normalizing_constant), a scale factor" β€” the one that makes the area one. ## Micro, macro, meso A thought from the dog walk that is part of getting ready for class: ten or fifteen years ago the big topic in computational and applied math was **[multi-scale modeling](https://en.wikipedia.org/wiki/Multiscale_modeling)** β€” honoring the fact that at the lowest scale you can identify particles, or walkers, or cars, or stock prices, and that if you squint well enough there is a level at which you think instead about *blobs* of walkers, cars, prices. The continuum limit is exactly the move from the **microscopic** scale to the **macroscopic**. Why pull it off? Some things are easier to see or to program at one scale than the other. An uncomfortable example, from a documentary half-watched while moving around the house β€” the [Astroworld crowd disaster](https://en.wikipedia.org/wiki/Astroworld_Festival_crowd_crush): people are not waves, and even globs of people are not waves, but at a certain density a crowd carries a **wave through it**, a macroscopic behavior that formed over the microscopic people β€” and that was part of what went wrong. The word for what lives between macro and micro is **meso**, and mesoscale behavior is always an interesting place; on the math side the usual pair is the *atomistic* perspective and the *continuum* perspective. ## Why the central limit theorem, with random walks If $X\sim\mathcal{N}(\mu,\sigma^{2})$ β€” and it is worth highlighting that a $\mu$ and a $\sigma^{2}$ are floating around in there β€” the probability density is $(2)\qquad \rho(x;\mu,\sigma^{2})=\frac{1}{\sqrt{2\pi\sigma^{2}}}\;e^{-\dfrac{(x-\mu)^{2}}{2\sigma^{2}}}.$ Put your walkers on a checkerboard or a [Plinko](https://en.wikipedia.org/wiki/Plinko) system, let tons of them out, and squint so you stop seeing the histogram boxes: that is the continuum limit, and with the finite-difference approximations it shows that the transport–diffusion equation *emerges*. Pile the walkers at $x=0$ at time zero, let them evolve, and they immediately take on the profile Fourier says. Now look at that profile next to (2) and spot the correspondences. **$\mu$ is easiest:** $(x-\mu)$ against $(x-ct)$ gives $\mu=ct,$ and $c$ fundamentally contains the *difference* of the left and right probabilities β€” the **bias** β€” so a nonzero bias moves the mean in time. Geometrically (the demonstration again: "I'm a normal distribution, here's my handle, here's my maximum") the lump, the central tendency, drifts: **the mean is transported.** The other rogue element, $\sigma^{2}$, matches $\sigma^{2}=Dt,\qquad\text{so}\qquad \sigma=\sqrt{Dt},$ which is what was said about walkers being poor explorers: the characteristic width, the [standard deviation](https://en.wikipedia.org/wiki/Standard_deviation), grows **sublinearly**. So why does the central limit theorem appear? There are a variety of ways to say it, but with the stats we have in the can: squint at the process in a blobby way and you get *exactly* a Gaussian distribution of walkers, transported in time β€” the same thing the central limit theorem was telling us about the same process. ## Fourier also generalizes this Call the Gaussian $g(x,t)$. All the walkers started at one spot; you might not want that. The result, whose derivation takes multiple lectures and whose meaning takes a lecture of its own: $u(x,t)=\int_{-\infty}^{\infty}u(x,0)\,g(x-p,t)\,dp.$ Read it in pieces. The left side is the oracle: the proportion of walkers at any location, at any time you care to sample. Inside the crazy integral, $u(x,0)$ β€” forget the rest for a second β€” is the **initial distribution of walkers**, and now they don't have to be all in one place. Break the room into three groups: group one crams into an infinitesimal space here (continuum thinking), group two there, group three there; that is $u$ at time zero, and then everybody starts walking. Or draw any shape, more here and fewer there. Three deltas, say, $u(x,0)=\delta(x)+\delta(x-1)+\delta(x+1),$ and $g$ is **the normal from just one $\delta(x)$**. The integral is a **convolution integral**: it *mixes* the initial distribution of walkers with the normal, over all space, to get $u(x,t)$. How, with the instructor as the normal and three objects as walker groups: inside the integral $g$ carries $x-p$, and $p$ is the variable of integration, running over positives and negatives β€” so the normal gets **shifted everywhere** along the line. Out where there are no walkers it multiplies against zero; sliding on, its tail starts to see a group, then it is mushing over the top of them β€” "yo, walkers, spread out" β€” then it is between groups and sees nothing, then it finds the next group and tells them to be more like the normal distribution. (Andrew: "and the integral is making that happen.") It stamps the normal on every point and tells whatever is there to spread out, normal-distribution style. > [!example]- The convolution, drawn > ![[day24_convolution.png]] > Left: the three-delta start β€” three normals that merge into one as they widen (and drift, $c=0.3$). Right: a "mountain range" drawn by hand, under (1): the pointy peaks are mollified first, then the whole range smooths toward one bump; the area under the curve is conserved. ## Two applets, and a 3Blue1Brown clip First, the news: **IT has concluded the website is not spyware**, so it should be accessible on campus β€” "big achievement, yes." (And now that the trust is built up, obviously the time to put spyware on it: something that secretly makes your computers do mathematical calculations. On the record, so probably not a good way to start a life of crime.) **Applet one** shows three things at once: the histogram bins of literally simulated walkers; the lattice equation with its $u s and $\Delta x s and $\Delta t s; and the PDE, initialized with a delta. Advance it, and that is the squinting you have to do: the bins jitter, the lattice curve and the PDE curve sit on top of each other and spread out, heads going down normal-distribution style, with some drift. Crank the bias β€” make the coin really unfair β€” and the drift grows. There *is* a disconnect between the histogram and the lattice and the PDE, but they track one another, because the whole thing is squinting: "they're not the same thing except when you think about it from particular limiting cases." **Applet two** lets you choose the starting configuration. Two humps: the histogram still fluctuates at the person level, but the lattice and the PDE look pretty nice, and if you view the world in a blobby way, the red PDE curve is what you see. A plateau: does that feel like the perfume bottle breaking, the heat seeping out of the coffee cup into the world? And one you draw yourself β€” a **mountain range**, drawn pointy on purpose, because the other thing this PDE tells things to be is *not so pointy*. One step: the peaks are mollified. Two steps: they are trying to stay where they were, but they are becoming bumps. **Diffusion smooths.** That is the generalization of the delta start to whatever you draw, and the mechanism is the integral above: sweep the field, tell everyone to lock in like a normal distribution, time-evolve. Then the clip β€” a four-and-a-half-minute cut of the 3Blue1Brown convolution video, sped up (chipmunk Grant Sanderson, with apologies, and the room's own speakers after the classroom audio dropped out again), opening on a twenty-second slide of the thing itself, $g(t)=f*h=\int_{-\infty}^{\infty}f(x)\,h(t-x)\,dx$. The cut's first half β€” two dice, the flip-and-slide picture, non-uniform faces β€” was skipped; the class joined at the formula it builds to, the **convolution of two lists**, $(a*b)_{n}=\sum_{i+j=n}a_{i}b_{j}$, which is how the distribution of a *sum* of two dice comes out of the two dice's distributions (the pdfs are *added* via convolution). From there, **convolution** as a sliding product. Take a long list of numbers β€” the walkers' initial data, say β€” and a short list that adds up to one; slide the short list along, multiply, add, and what comes out is a **[moving average](https://en.wikipedia.org/wiki/Moving_average)**, a smoothed-out version of the original. Change the short list to weight the center more and you get a different smoothing. In the lecture's symbols: $u(x,0)$ is the data, $g$ is the thing you slide, and the sliding product makes the new thing. Convolutions are everywhere. The **[median voter theorem](https://en.wikipedia.org/wiki/Median_voter_theorem)** from economics, in season: pitch to the median of your group and you win the group, but when red and blue join into one electorate, the median of the *combined* distribution is what matters, and a convolution is how two distributions join. **Film:** the image on the film is not the doorway; it is the convolution of the lens with the light that came off the doorway β€” another generalized mixing. And in two dimensions, a $3\times 3$ grid of $\tfrac19 s marched over an image averages each pixel with its neighbors β€” every pixel bleeds into the ones around it β€” which is a blur; the original was [Mario](https://en.wikipedia.org/wiki/Mario), which makes two Mario references this semester ("I don't think I can make it to five, but you gotta dream big"). Replace the flat grid by a $5\times 5$ sampled from a two-dimensional normal β€” $0.162$ in the middle, $0.098$ beside it, $0.003$ in the corners β€” and the blur emphasizes the pixel it sits on while still taking in the neighborhood: a **Gaussian blur**, blurry but with better-retained local features, "a blurring effect that much more authentically simulates putting a lens out of focus." ![](https://www.youtube.com/watch?v=KuXjwB4LzSA) > [!quote] Attribution > *But what is a convolution?* β€” 3Blue1Brown (Grant Sanderson), YouTube. The full video. In class a sped-up classroom cut ran instead, joined at about its 2:41 mark β€” the $(a*b)_{n}$ formula β€” then the moving-average and image-blur animations; in the original those are the sections after the dice. The course's own version of this material β€” built from the walk rather than the dice β€” is [[MATH310F26 - Convolution, in pictures]]. ## Blur, in Fourier space and then nonlinearly Slides collected over time β€” an old AMS outreach deck, *Images of diffusive filtration*. (Its first three were withheld: the standard [test image](https://en.wikipedia.org/wiki/Lenna) of image-processing lore turns out to have been cropped from a magazine centerfold, and its subject was never credited or paid for decades of processing. "Sketchy stuff.") A heat-colored surface being diffused: do you feel the heat from the color map, and do you feel the diffusive process making everything mushy β€” "even more squinting on the already squinted reality"? Those are surfaces the heat equation is being applied to. Then the other route. Take an image β€” a [Rubik's cube](https://en.wikipedia.org/wiki/Rubik's_Cube) β€” and Fourier transform it: a **star pattern**, whose radial lines correspond, from the image days, to sharp changes, the tic-tac-toe gridding of the cube's faces. Now, in Fourier space, multiply by a **Gaussian function**: it keeps the center and deadens the outer regions (set straight to zero here, but think of the rapid decay of that two-dimensional hill). Transform back: the cube is blurry β€” the slide's three lines: *transform image and Gaussian filter; multiply in Fourier space; invert the product to produce the convolution.* Then a spiral of color (a hot-air balloon from below) at **standard deviation 3** and **standard deviation 10**: fiddle with that Gaussian's standard deviation and, by the analogy, you are fiddling with the **diffusivity** β€” the larger $D$, the more the walkers want to spread, the blurrier the result. Interactive part (an orange Starburst, pocketed). A close-up of an eye printed with a pointillistic, halftone feel β€” done on purpose, probably, or just the way it was printed, but think of the speckles in old photographs; apply diffusion, and the eye is still there but the speckle has been brushed through. Cameraman, diffused: blurred, thinking of all the stuff there as random walkers, or as points averaged with their neighbors. Then the slides titled *why use diffusion as a filter? β€” diffusive noise reduction of a signal with preservation of defined signal structure*: an old photograph of a fine-looking fellow β€” [Einstein](https://en.wikipedia.org/wiki/Albert_Einstein), who has only old pictures β€” with Gaussian noise added, run through a "smoother" (filter size 5, time step 0.01, 30 iterations): the speckle goes. Two people over a chess game, same treatment, 50 iterations. But then these two feel *different* from the earlier blurs, and the question went to the room β€” Andrew's angle was compression, which doesn't quite work because parts of the process are irreversible: walk into the room after the coffee has equalized and you cannot tell historically where the heat came from; the heat equation has problems like that. The point was in the chess photo β€” the **computer** in the background, and the board itself: rectangular, squarish things whose sharp edges a blur would simply smear, and here they *haven't* been. That is a **[nonlinear blur](https://en.wikipedia.org/wiki/Anisotropic_diffusion)**. At the continuum level you can forget the walkers entirely and make $D$ depend on *where you are*: at the top of the computer, black turns to white, a lot of change, a large derivative β€” a large **[gradient](https://en.wikipedia.org/wiki/Gradient)** β€” so set $D$ **small where the gradient is large** and let it be ordinary $D$ elsewhere. Why would anyone? Dusting for prints on the old crime shows gives a noisy fingerprint; to send it to the database you want the noise gone *and* the edges kept, because the ridge-to-not-ridge transition is the information. (The slide's title, from when it was pitched to first-year students to make them study more math: *Crime Scene Investigation: Golden, CO*.) And the thread back to walker land: the walkers were taken into an approximate land; that land has parameters; now forget the walkers and **cook the parameters** to pull features out of a blurring process that already existed. > [!example]- Blur three ways, re-run here > ![[day24_blur.png]] > A synthetic speckled "computer" (no third-party images). Second panel: its Fourier transform with the Gaussian mask applied β€” the star from the rectangles, the center kept. Third: the linear blur, which is the heat equation run for a time $t$ with $\sigma^{2}=Dt$ β€” the speckle is gone and so are the edges. Fourth: nonlinear diffusion with $D$ small where $|\nabla u|$ is large β€” the speckle is gone and the edges stay. Have a good weekend; Skittles or Starburst on the way out. > [!success]- Numbers checked in one sandbox run > The Fourier transform of $g(x,t)$ is $e^{-Dtk^{2}/2}\,e^{-ickt}$ β€” a Gaussian in $k$ times a phase β€” which is exactly why "multiply by a Gaussian in Fourier space" and "run the heat equation" are the same blur, and why the drift is only a phase. Convolving three deltas with $g$ gives the sum of three shifted Gaussians, total mass $3$, as drawn; the mountain range evolved under (1) by explicit finite differences conserved its area to $10^{-15}$ while its tallest peak fell from $1.81$ to $0.54$ by $t=1.5$. On the synthetic image, the spatial Gaussian blur and the Fourier-mask blur agree to boundary effects ($\max$ difference $0.035$ at the edges, periodic vs. reflected). Noise in the flat background: $0.120\to 0.011$ under the linear blur and $\to 0.006$ under the nonlinear one; the bezel's $10$–$90\%$ edge width went from $0$ px to $7$ px under the linear blur and only $2$ px under the nonlinear one β€” the edge kept, the speckle gone. The nonlinear step used the Perona–Malik conductance $D/(1+(|\nabla u|/\kappa)^{2})$, the "small where the gradient is large" rule made explicit. > [!example]- Board scans β€” October 23, 2026 > ![[MATH310F26-Day24-Board-1.jpg]] > ![[MATH310F26-Day24-Board-2.jpg]] > ![[MATH310F26-Day24-Board-3.jpg]] > > πŸ“„ [[MATH310F26-Day24-Boards-2026-10-23.pdf|Full board capture (3 pages, PDF)]]