Shortcut model

An important question in statistical mechanics is the dependence of model behaviour on the dimension of the system. The shortcut model was introduced in the course of studying this dependence. The model interpolates between discrete regular lattices of integer dimension.

Introduction
The behaviour of different processes on discrete regular lattices have been studied quite extensively. They show a rich diversity of behaviour, including a non-trivial dependence on the dimension of the regular lattice. In recent years the study has been extended from regular lattices to complex networks. The shortcut model has been used in studying several processes and their dependence on dimension.

Dimension of complex network
Usually, dimension is defined based on the scaling exponent of some property in the appropriate limit. One property one could use  is the scaling of volume with distance. For regular lattices $$\textstyle \mathbf Z^d$$ the number of nodes $$\textstyle j$$ within a distance $$\textstyle r(i,j)$$ of node $$\textstyle i$$ scales as $$\textstyle r(i,j)^d$$.

For systems which arise in physical problems one usually can identify some physical space relations among the vertices. Nodes which are linked directly will have more influence on each other than nodes which are separated by several links. Thus, one could define the distance $$\textstyle r(i,j)$$ between nodes $$\textstyle i$$ and $$\textstyle j$$ as the length of the shortest path connecting the nodes.

For complex networks one can define the volume as the number of nodes $$\textstyle j$$ within a distance $$\textstyle r(i,j)$$ of node $$\textstyle i$$, averaged over $$\textstyle i$$, and the dimension may be defined as the exponent which determines the scaling behaviour of the volume with distance. For a vector $$\textstyle \vec{n}=(n_1,\dots, n_d)\in \mathbf Z^d$$, where $$\textstyle d$$ is a positive integer, the Euclidean norm $$\textstyle \|\vec{n}\|$$ is defined as the Euclidean distance from the origin to $$\textstyle \vec{n}$$, i.e.,


 * $$ \|\vec{n}\|=\sqrt{n_1^2+\cdots + n_d^2}. $$

However, the definition which generalises to complex networks is the $$\textstyle L^1$$ norm,


 * $$ \|\vec{n}\|_1=\|n_1\|+\cdots +\|n_d\|. $$

The scaling properties hold for both the Euclidean norm and the $$\textstyle L^1$$ norm. The scaling relation is


 * $$ V(r) = kr^d, $$

where d is not necessarily an integer for complex networks. $$\textstyle k$$ is a geometric constant which depends on the complex network. If the scaling relation Eqn. holds, then one can also define the surface area $$\textstyle S(r)$$ as the number of nodes which are exactly at a distance $$\textstyle r$$ from a given node, and $$\textstyle S(r)$$ scales as


 * $$ S(r) = kdr^{d-1}. $$

A definition based on the complex network zeta function generalises the definition based on the scaling property of the volume with distance and puts it on a mathematically robust footing.

Shortcut model
The shortcut model starts with a network built on a one-dimensional regular lattice. One then adds edges to create shortcuts that join remote parts of the lattice to one another. The starting network is a one-dimensional lattice of $$\textstyle N$$ vertices with periodic boundary conditions. Each vertex is joined to its neighbors on either side, which results in a system with $$\textstyle N$$ edges. The network is extended by taking each node in turn and, with probability $$\textstyle p$$, adding an edge to a new location $$\textstyle m$$ nodes distant.

The rewiring process allows the model to interpolate between a one-dimensional regular lattice and a two-dimensional regular lattice. When the rewiring probability $$\textstyle p=0$$, we have a one-dimensional regular lattice of size $$\textstyle N$$. When $$\textstyle p=1$$, every node is connected to a new location and the graph is essentially a two-dimensional lattice with $$\textstyle m$$ and $$\textstyle N/m$$ nodes in each direction. For $$\textstyle p$$ between $$\textstyle 0$$ and $$\textstyle 1$$, we have a graph which interpolates between the one and two dimensional regular lattices. The graphs we study are parametrized by


 * $$ \text{size} = N,\,$$
 * $$ \text{shortcut distance} = m,\,$$
 * $$ \text{rewiring probability} = p.\,$$

Application to extensiveness of power law potential
One application using the above definition of dimension was to the extensiveness of statistical mechanics systems with a power law potential where the interaction varies with the distance $$\textstyle r$$ as $$\textstyle 1/r^\alpha$$. In one dimension the system properties like the free energy do not behave extensively when $$\textstyle 0\leq\alpha\leq1$$, i.e., they increase faster than N as $$\textstyle N\rightarrow\infty$$, where N is the number of spins in the system.

Consider the Ising model with the Hamiltonian (with N spins)


 * $$ H=-\frac{1}{2}\sum_{i,j}J(r(i,j))s_{i}s_{j} $$

where $$\textstyle s_{i}$$ are the spin variables, $$\textstyle r(i,j)$$ is the distance between node $$\textstyle i$$ and node $$\textstyle j$$, and $$\textstyle J(r(i,j))$$ are the couplings between the spins. When the $$\textstyle J(r(i,j))$$ have the behaviour $$\textstyle 1/r^\alpha$$, we have the power law potential. For a general complex network the condition on the exponent $$\textstyle \alpha$$ which preserves extensivity of the Hamiltonian was studied. At zero temperature, the energy per spin is proportional to


 * $$ \rho=\sum_{i,j}J(r(i,j)), $$

and hence extensivity requires that $$\textstyle \rho$$ be finite. For a general complex network $$\textstyle \rho$$ is proportional to the Riemann zeta function $$\textstyle \zeta ( \alpha - d + 1)$$. Thus, for the potential to be extensive, one requires


 * $$ \alpha > d.\, $$

Other processes which have been studied are self-avoiding random walks, and the scaling of the mean path length with the network size. These studies lead to the interesting result that the dimension transitions sharply as the shortcut probability increases from zero. The sharp transition in the dimension has been explained in terms of the combinatorially large number of available paths for points separated by distances large compared to 1.

Conclusion
The shortcut model is useful for studying the dimension dependence of different processes. The processes studied include the behaviour of the power law potential as a function of the dimension, the behaviour of self-avoiding random walks, and the scaling of the mean path length. It may be useful to compare the shortcut model with the small-world network, since the definitions have a lot of similarity. In the small-world network also one starts with a regular lattice and adds shortcuts with probability $$\textstyle p$$. However, the shortcuts are not constrained to connect to a node a fixed distance ahead. Instead, the other end of the shortcut can connect to any randomly chosen node. As a result, the small world model tends to a random graph rather than a two-dimensional graph as the shortcut probability is increased.