# Refinements of pair approximation for network analysis

When considering interactions on networks, it is usually very hard to calculate the dynamics analytically, and approximations are employed. Mean-field approximations usually end up ignoring the network structure completely, and so are seldom a good approximation. A popular approximation is the pair approximation, which considers the correlations inherent between adjacent nodes (intuitively we can think of it as a type of mean-field approximation on edges).

The approximation is exact if we are considering Cayley graphs, and very good if we are looking at $$k$$-regular random graphs. In practice it also provides good approximations for cases when we have a random graph with average degree $$k$$ and a tight distribution of degree around $$k$$. Unfortunately, a lot of the networks and interactions that are of interest, are not well modeled by these sort of graphs. They are usually well-modeled by graphs with very different degree distributions (like scale-free networks, for instance), with specific (and high) clustering coefficients, or specific average shortest-path distance (for more, see Albert & Barabasi 2001).

Are there refinements of pair approximation that work well for these types of networks? Or are there other analytic approximations available?

### An example of interactions on networks

I thought I would give an example of what I mean by interactions on networks. I will include a relatively general example from evolutionary game theory.

You can think of each node as an agent (usually represented just by a strategy), that plays some fixed game pairwise with each other agent it has an edge to. Thus, a given network with a some assignment of strategy to each node produces a payoff for each node. We then use these payoffs and the network structure to determine the distribution of strategies among the nodes for the next iteration (A common example might be for each agent to copy the neighbor with the highest payoff, or some probabilistic variant of this). The questions we are usually interested in corresponding to knowing the numbers of agents of each strategy and how that changes overtime. Often we have stable distribution (which we then want to know, or approximate) or sometimes limit-cycles or even more exotic beasts.

If we do mean-field approximation on this sort of model, we use get the replicator equation as our dynamic, which blatantly ignores the network structure and is only accurate for complete graphs. If we use pair approximation (as Ohtsuki & Nowak 2006) we will get slightly different dynamics (it will actually be replicator dynamics with a modified payoff matrix, where the modification depends on the degree of the graph, and the specifics of the update step) which matches simulation well for random graphs, but not for other networks of interest.

For a more physics like example: replace the agents by spins and the call the payoff matrix an interaction Hamiltonian, then cool your system while performing periodic random measurements.

### Notes and related questions

• Straightforward generalizations of pair approximation of the sort that consider a type of mean-field approximation on triples, or quadruples of nodes) are unwieldy and still don't take into account very different degree distributions or average shortest-path distance.

• Sources for Algorithmic Evolutionary Game Theory

• Could you clarify what you need the approximation for? I.e. in which properties of the network are you interested? Sep 18, 2011 at 16:08
• @Piotr I am interested in tools that can be used for graphs with various degree distributions (but at least scale-free) and where the analysis explicitly takes into account clustering coefficient and average shortest-path distance between nodes. In particular, it is desired for the tool to depend on those parameters (most pair approximation only depends on average degree, and sometimes standard error of the degree-spread for tight distributions). Sep 18, 2011 at 16:13
• @Artem: One method is to calculate graph spectrum (i.e. spectrum of its Laplace matrix). The spectrum is related to the degree distribution, but also depends on clustering and (I guess) average shortest-path distance between nodes. Sep 18, 2011 at 16:29
• @Artem: I'm not entirely clear on what you want to be able to calculate/approximate. Obviously any approximation will fail to accurately represent all aspects of the graph, so it is important to know what functions of the graph you care about. There are lots of CMP methods that can be brought to bare, but you can always construct a property for which they will fail. Sep 18, 2011 at 16:30
• @Artem: Don't be afraid to give an explicit example, even if it is outside of physics. Sep 18, 2011 at 17:16

In general, you may be interested in spectral methods in graph theory, as they are a powerful tool. You can analyze the eigenvalues of adjacency matrix of the graph (or of the Laplacian matrix of the graph).

Such methods not only take into account local properties of the graph (e.g. degree distribution) but also global (e.g. connectivity, presence or absence of shortcuts). In particular, the spectrum is directly related to number of pairs, triangles and to the shortest path (see the second reference).

As a reference (I only skimmed through them, but they look useful):

The way you formulate your question makes it sound like you care about dynamics, but since what you are looking for seems to be a steady state solution, ground states seem like a much more productive route to go down.

Since you want to go beyond pairwise approximation, the most natural candidate technique seems to be matrix product states, which is a pretty hot topic at the moment for dealing with quantum ground states. The way this approach works is basically by introducing maximally entangled pairs between nodes, and at each node introducing a projector. By adding higher dimensional systems you'll capture more features of the graph. I know your problem probably isn't quantum, but I don't see why this technique still shouldn't work. You should be able to simply replace the entangled states with $\frac{1}{2}(|00\rangle \langle 00| + |11\rangle \langle 11|).$

Also, I'm not sure if this is the kind of thing you are looking for or not, but there are some recent results on realizibility of scale-free networks, showing that they exhibit two phase transitions which seems to have just been accepted to PRL. A preprint entitled "All scale-free networks are sparse" can be found as arXiv:1106:5150.

Two things you might want to look at:

Algorithmic Game Theory Ch. 7 : Graphical Games

Fluctuations in Evolutionary Games

The first goes over how to find equilibria in games or spin systems like you described. Certain meta-strategies for strategy adoption (specifically the one identical to Gibbs Sampling that leads to a correlated equilibria) allow very general, tractable analyses.

The second attempts to predict large fluctuations or change in "norms" in an evolutionary game theory model using large deviations theory. The examples tackled are small-scale, but the author attempts to make the mathematical machinery he uses as general and powerful as possible, so it may be applicable to your case.