Arula Ratnakar
@arula-ratnakar
Computational Neuroscience PhD student at Boston University (advisors Cynthia Bradham & Gabe Ocker). Mathematically modeling embryonic neurodevelopment. I also write trippy scifi & mathfiction. Ignyte Award Finalist 2025 6 stories in Clarkesworld
I take a lot of notes, I have an 80 page single spaced document of math notes from my PhD so far 😅:
Studying for my oral quals, reviewing Turing stability analysis and reaction diffusion systems today, next I’ll review MSRDJ path integrals and compare them to a kind im learning now that uses creation and annihilation operators called Doi Peliti.
I used to make so many paintings and drawings by hand in architecture school. It’s been so many years. Now I’m doing something I don’t even know if I’ll be good at yet.
im actually really excited for this QFT class. It's going to be so strange learning about all of this stuff in a non-statistical-field-theory context.
All of the TAs have to do this but my path is actually so wild. this is one of my first slides lol
One of my favorite parts of writing is designing my story buildings' architecture. I did, in fact, enjoy imagining and designing buildings when I was in architecture school haha. I can still totally do that in my scifi. I'm designing a really cool building for this story.
last year at this time I was intimidated by a simple n-dimensional gaussian integral w/ a source term and now I know all of this. wild how much you can learn in a year. (I put all of my notes of what i've been studying wrt math into one document. ik i need to organize the "preliminaries" better)
Got this at Readercon. It’s PKD’s first novel, wasn’t published until after his death and it isn’t scifi. Very intrigued to read it. his work is a huge influence on my writing. A Scanner Darkly changed my philosophy for why I write, who I‘m writing for & what I should capture about humanity.
So, overall, we have our final mean field equations after taking both the N to infinity limit to get sparse connectivity, and taking the K to infinity limit to get a large amount of inputs to the neurons. That's all for today, hope you enjoyed! ☺️ (19/19)
We can just solve for the equilibrium value for this now, which will become really relevant for other sections in the paper. (18/n)
This update to F gives us, now, the mean field equation for the population activity rates: (17/n)
We can define a function H(z) which will allow us to simplify the expression and get the F from the paper. (16/n)
Again, as the K to infinity limit occurs, the probabilities became Gaussian instead of Poisson, and the input into the Heaviside step function becomes that mean u_k equation plus the fluctuations around the mean. (15/n)
Before taking the K to infinity limit, we had the following: (14/n)
Here we can utilize that property when we derive the terms of our alpha equation. Remember, alpha represents the fluctuations around the mean input. (12/n)
Now this represents the average input, but there is also going to be a variance of that input determining fluctuation around the mean. Let's think about that now. Note the property in statistics where if you scale a random variable X by some constant C, the variance scales like so: (11/n)
Remember the microscopic equation describing what's entering neuron i in population k: (9/n)
This is what they say we get from taking the K to infinity limit. Let's go through this explicitly and derive it. (8/n)
So even though these neurons' activities are either 0 or 1, the sum of tons of them loses the binary characteristic). The mean and variance of this Gaussian distribution are going to be the mean and variance of the poisson from before: (7/n)
Here are the standard deviations of n_E and n_I. I think there is a typo in the paper, so I corrected the typo and explained below in this pic: (4/n)
So after taking the N to infinity limit, we now have the following mean field equations for the population activity levels for finite K. Now the next thing to do is take the limit as K goes to infinity, which I'll go over tomorrow. That's all for today, hope you enjoyed! ☺️ (34/n)
Again, the average number of connections a cell receives from a population is K. On average each of these synapses has a probability m_l to be active, so (again, here n represents the number of active inputs a neuron is receiving from presynaptic population l): (32/n)
When you take the limit of the binomial distribution under these conditions the binomial distribution becomes a Poisson Distribution: (31/n)
if p is the probability of a cell connecting to a target neuron, 1-p is the probability of no connection. Since we do this for each neuron up to the number of neurons in the presynaptic population, aka N_l times, the probability of ending up with s synapses follows the Binomial distribution (29/n)
This can also be written in the language the paper uses, where they say that the subscript E is interchangeable with 1 and I (uppercase i) is interchangeable with 2, and using their summation notation for the sum. This is how the paper writes what I put above: (26/n)
F_k denotes the probability the updating cell at time t will be in an updated *active* state, which is given by: (25/n)