User:Oshanker/Sandbox

From Wikipedia, the free encyclopedia

An important question in Statistical Mechanics is the dependence of model behaviour on the dimension of the system. The shortcut model[1] [2] was introduced in the course of studying this dependence. The model interpolates between discrete regular lattices of integer dimension.

Contents

[edit] 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 [3][4][5][6][7][8][9][10][11]. 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.

[edit] Dimension of Complex Network

The study of different processes has been extended from regular lattices \textstyle \mathbf Z^d, where \textstyle d, a positive integer, is the dimension, to complex networks [12][13][14][15][16][17][18][19] [20][21][22] [23]. 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.

Usually, dimension is defined based on the scaling exponent of some property in the appropriate limit. One property one could use [2] is the scaling of volume with distance. For regular \textstyle \mathbf Z^d lattices 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 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) = krd,

where d is not necessarily an integer for comlex 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) = kdrd − 1.

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

[edit] 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

size = N,
shortcut~distance = m,
rewiring~probability = p.

[edit] 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

ρ = ∑ J(r(i,j)),
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

α > 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 intersting result that the dimension transitions ahrply as the shortcut probability increases from zero.

[edit] 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.


[edit] References

  1. ^ a b Shanker, O. (2007). "Graph Zeta Function and Dimension of Complex Network". Modern Physics Letters B 21(11): 639-644. 
  2. ^ a b c Shanker, O. (2007). "Defining Dimension of a Complex Network". Modern Physics Letters B 21(6): 321-326. 
  3. ^ O. Shanker, Mod. Phys. Lett. B20, 649 (2006).
  4. ^ D. Ruelle, Commun. Math. Phys. 9, 267 (1968).
  5. ^ F. J. Dyson, Commun. Math. Phys. 12, 91 (1969).
  6. ^ J. Frohlich and T. Spencer, Commun. Math. Phys. 84, 87 (1982).
  7. ^ M. Aizenman, J. T. Chayes, L. Chayes and C. M. Newman, J. Stat. Phys. 50, 1 (1988).
  8. ^ J. Z. Imbrie and C. M. Newman, Commun. Math. Phys. 118, 303 (1988).
  9. ^ E. Luijten and H. W. J. Blote, Int. J. Mod. Phys. C6, 359 (1995).
  10. ^ R. H. Swendson and J.-S. Wang, Phys. Rev. Lett. 58, 86 (1987).
  11. ^ U. Wolff, Phys. Rev. Lett. 62, 361 (1989).
  12. ^ S. Boccaletti, V. Latora, Y. Moreno, M. Chavez, and D.-U. Hwang, Complex networks: Structure and dynamics. \textit{Physics Reports} 424, 175--308 (2006).
  13. '^ M. E. J. Newman, The structure and function of complex networks. SIAM Review 45, 167--256 (2003).
  14. ^ Albert, R. and Barabasi, A.-L., Statistical mechanics of complex networks, Rev. Mod. Phys. 74, 47--97 (2002).
  15. ^ S. N. Dorogovtsev and J. F. F. Mendes, Evolution of Networks: From Biological Nets to the Internet and WWW. Oxford University Press, Oxford (2003).
  16. ^ M. E. J. Newman, A.-L. Barab\'asi, and D. J. Watts, \textit{The Structure and Dynamics of Networks}. Princeton University Press, Princeton (2006).
  17. ^ M. Girvan and M. E. J. Newman, Community structure in social and biological networks. Proc. Natl. Acad. Sci. USA 99, 7821--7826 (2002).
  18. ^ M. E. J. Newman, Detecting community structure in networks. Eur. Phys. J. B 38, 321--330 (2004).
  19. ^ Chang-Yong Lee and Sunghwan Jung, Statistical self-similar properties of complex networks. Phys. Rev. E73, 066102 (2006).
  20. ^ P. Holme, M. Huss, and H. Jeong, Subnetwork hierarchies of biochemical pathways. Bioinformatics 19, 532--538 (2003).
  21. ^ R. Guimer\`a and L. A. N. Amaral, Functional cartography of complex metabolic networks. Nature 433, 895--900 (2005).
  22. ^ G. Palla, I. Der\'enyi, I. Farkas, and T. Vicsek, Uncovering the overlapping community structure of complex networks in nature and society. Nature 435, 814--818 (2005).
  23. ^ G. W. Flake, S. R. Lawrence, C. L. Giles, and F. M. Coetzee, Self-organization and identification of Web communities. IEEE Computer 35, 66--71 (2002).