## Network Theory and Discrete Calculus – The Discrete Master Equation

This post is a follow up to

**Network Theory and Discrete Calculus – Introduction**

To give the result first, the master equation can be expressed in terms of discrete calculus simply as

where is a discrete 0-form representing the states of a Markov chain (at all times), is a discrete 1-form representing transition probabilities, and is the boundary operator, i.e. a kind of graph divergence.

The rest of this post explains the terms in this discrete master equation and how it works.

### The State-Time Graph

When working with a finite (or countable) number of states, there is nothing new in considering states to be associated to nodes and the transition probabilities to be associated to directed edges of a bi-directed graph. A simple 2-state example is given below

The directed graphs we work with for discrete stochastic calculus are slightly different and could be referred to as “state-time” graphs, which are supposed to make you think of “space-time”. A state at time is considered a different node than the state at time . An example 2-state, 2-time directed graph is illustrated below:

There are four directed edges in this state-time graph, which will be labelled

*

*

*

*

For states, the state-time graph will look similar but with more states appended horizontally.

### The Discrete Master Equation

A discrete 0-form representing the states at all times can be expressed as

and a discrete 1-form representing the transition probabilities can be expressed as

The product of the 0-form and the 1-form is given by

The boundary of a directed edge is given by

Now for some gymnastics, we can compute

This is zero only when the last term in brackets is zero, i.e.

or

Since is right stochastic, we have

so that

In other words, when is right stochastic and , we get the usual master equation from stochastic mechanics

### Parting Thoughts

The master equation is a boundary. This makes me wonder about homology, gauge transformations, sources, etc. For example, since

does this imply

for some discrete 2-form ?

If is a discrete 2-form whose boundary does not vanish, then

gives the same dynamics because This would be a kind of gauge transformation.

There are several directions to take this from here, but that is about all the energy I have for now. More to come…

[…] applications of discrete calculus to mathematical finance and field theories. For instance, in the The Discrete Master Equation, I introduced a boundary […]

Network Theory and Discrete Calculus – Notation Revisited « Phorgy PhynanceNovember 19, 2011 at 11:27 pm

I am new to this field and I am trying to understand how discrete calculus helps with these problems. What I find confusing is that you speak of discrete differential forms as linear combinations of directed edges. As I understand it, the latter are chains and the former are cochains, i.e., functionals on chains. You also refer to the boundary operator, which works with chains, and then say it’s a kind of graph divergence (exterior derivative?), which works with cochains.

PeterNovember 21, 2011 at 7:46 am

Hi Peter,

Thanks for your comment and question. I’m typing this on my iPhone on my way to the office, so forgive me in advance.

My paper on discrete stochastic calculus explains things a little more clearly than I have here. In fact, I haven’t been rigorous here at all. For example, I should not refer to discrete 1-forms as linear combinations of edges because they are not. As you pointed out, a discrete 1-form is closest to a 1-cochain. In fact, the product in this noncommutative graded algebra is closest to the cup product of cochains.

It is also good to point out that it is a bit odd to talk about boundary of cochains when the natural operation is coboundary. The graph divergence is essentially the adjoint of the coboundary under a kind of topogical inner product where edges are all orthonormal. With this metric, we can identify an edge with a “co-edge”.

If you want to see even more details of the mathematics, you can have a look at the paper on discrete differential geometry on causal graphs I wrote with Urs Screiber. You can find it here in “My Papers” or on the arxiv.

Gotta run for now. I hope this helps a little.

EricNovember 21, 2011 at 8:38 am

PS: I don’t know if you read the Azimuth forum, but over there when I announced these two latest posts, I noted that these are warmups for two future posts I plan to write. One of those will be specifically on the graph divergence, graph Laplacian, and graph Dirac operator. I will try to explain things more clearly there as well.

EricNovember 21, 2011 at 9:05 am

[…] graph divergence was introduced here as a boundary operator, but the relation to divergence was mentioned […]

Network Theory and Discrete Calculus – Graph Divergence and Graph Laplacian « Phorgy PhynanceDecember 4, 2011 at 1:26 pm

[…] directed graphs associated with discrete stochastic mechanics are described in the post The Discrete Master Equation, where the simple state-time graph example below was […]

Network Theory and Discrete Calculus – Noether’s Theorem « Phorgy PhynanceDecember 25, 2011 at 9:09 am