Add Journal to My Library
Journal of Complex Networks
, Volume 6 (1) – Feb 1, 2018

11 pages

/lp/ou_press/symmetric-motifs-in-random-geometric-graphs-H3APHQCPar

- Publisher
- Oxford University Press
- Copyright
- © The authors 2017. Published by Oxford University Press. All rights reserved.
- ISSN
- 2051-1310
- eISSN
- 2051-1329
- D.O.I.
- 10.1093/comnet/cnx022
- Publisher site
- See Article on Publisher Site

Abstract We study symmetric motifs in random geometric graphs. Symmetric motifs are subsets of nodes which have the same adjacencies. These subgraphs are particularly prevalent in random geometric graphs and appear in the Laplacian and adjacency spectrum as sharp, distinct peaks, a feature often found in real-world networks. We look at the probabilities of their appearance and compare these across parameter space and dimension. We then use the Chen–Stein method to derive the minimum separation distance in random geometric graphs which we apply to study symmetric motifs in both the intensive and thermodynamic limits. In the thermodynamic limit, the probability that the closest nodes are symmetric approaches one, while in the intensive limit this probability depends upon the dimension. 1. Introduction Many physical systems like social networks, biological networks, transport networks and technological infrastructures can be modelled using the graph concept of a set of nodes connected by edges. For an introduction, see for example [1, 2]. In the study of complex networks, a popular technique is to randomly generate graphs in such a way as to capture certain features of the topology and dynamics of the real-life systems of interest. Some common examples of these are the Erdos–Renyi random graph [3], the Barabási–Albert scale-free network generator [4] and the Watts–Strogatz small-world network generator [5]. A powerful tool for analysing the topology and dynamics of these networks is their graph spectra [6–8]. In particular, important subgraphs called symmetric motifs can be seen through the presence of sharp peaks in the spectra indicative of the multiplicity of particular eigenvalues, see Fig. 1 for an illustration of this in the real-world network of the high-voltage power grid in the Western States of the USA [5] and see [9] for an analysis of the symmetric motifs in this particular network. Networks such as this are important for an understanding of efficiency and robustness of power grids [10]. It is known that the presence of symmetric motifs is important for other real-world complex systems [11] and has been shown to influence synchronisation processes [12, 13] and dynamical stability [14, 15] and is also related to redundancy and network stability [9]. However, the non-spatial random graph generators mentioned above rarely contain these important subgraphs. It is known, however, that they do occur in a spatial random graph model the random geometric graph (RGG). RGGs were first introduced by Gilbert as a way of modelling wireless networks [16]. In a RGG, the nodes are distributed throughout a given domain uniformly at random and are connected by an edge when they are within a given range of each other. See [17] and [18] for introductions and see Fig. 2 for an illustration of a RGG. Fig. 1. View largeDownload slide Spectral density of the adjacency (a) and Laplacian (b) matrices of the Western States Power Grid of the USA [5]. The $$4941$$ nodes in this network represent the infrastructure of transformers, substations and generators while the edges represent high-voltage transmission connections. Note the peaks at integer values. This network contains $$64$$ type-I symmetric nodes and $$596$$ type-II symmetric nodes. The data are available at http://konect.uni-koblenz.de/networks/opsahl-powergrid. Fig. 1. View largeDownload slide Spectral density of the adjacency (a) and Laplacian (b) matrices of the Western States Power Grid of the USA [5]. The $$4941$$ nodes in this network represent the infrastructure of transformers, substations and generators while the edges represent high-voltage transmission connections. Note the peaks at integer values. This network contains $$64$$ type-I symmetric nodes and $$596$$ type-II symmetric nodes. The data are available at http://konect.uni-koblenz.de/networks/opsahl-powergrid. Fig. 2. View largeDownload slide Random geometric graph on the torus. An illustration of a $$400$$ node RGG with a connection range of $$r=0.112$$. The nodes (black dots) have been distributed randomly, uniformly and are connected by an edge (straight black line) when they are within a Euclidean distance of $$r$$ with periodic boundary conditions. Fig. 2. View largeDownload slide Random geometric graph on the torus. An illustration of a $$400$$ node RGG with a connection range of $$r=0.112$$. The nodes (black dots) have been distributed randomly, uniformly and are connected by an edge (straight black line) when they are within a Euclidean distance of $$r$$ with periodic boundary conditions. RGGs are often used to model networks in which the node location is an important factor, so called spatial networks (See [19] for a review). In particular, RGGs have been used in modelling wireless networks [20–23], in the study of epidemics [24–26], in the study of city development [27], in modelling the vulnerability of infrastructure [28] and biological protein–protein interaction networks [29]. In addition the properties of RGGs such as synchronization [13, 30], consensus dynamics [31], connectivity [32] and spectral properties of RGGs [33, 34] have all been studied. Here we study the symmetric motifs in RGGs. Our aim is to understand how properties like density and dimension of the RGG affect their appearance. We consider the probability of finding symmetric nodes as a function of the connection radius and in two high-density limit cases. In particular, we analyse the symmetric motifs in the intensive limit of fixed connection radius, and the thermodynamic limit of fixed mean degree. It turns out that the expected number of symmetric motifs is non-trivially dependent on these system parameters. We will study the binomial model of RGGs. That is, we distribute $$N$$ points representing $$N$$ nodes of a network uniformly on the unit torus. A connection is made between two nodes if their toral distance is less than some given range $$r$$. This is known as the unit disc connection model, but note there are many other connection models in which the links are random with probability depending on the inter-node distance [32]. In Section 2, we will look at the adjacency and Laplacian spectrum of some RGG ensembles and discuss in particular the sharp peaks we find in these spectra. We will explain how the symmetric motifs which give rise to these sharp peaks and study the probability of finding them in RGGs. In Section 3, we will then use the Chen–Stein method [35] to derive the scaling of the minimum separation distance in RGGs. The Chen–Stein method is a tool for obtaining a bound on the total variation distance between a stochastic process which contains dependent random variables and a corresponding independent process. Here, we apply it to remove the dependence of inter-node distances, and hence obtain the variation of the symmetric motifs with dimension in the above limits. Section 4 contains a summary. 2. Spectrum We first look at the spectrum of the graph adjacency matrix $$\mathbf{A}$$ and Laplacian matrix $$\mathcal{L}$$. The adjacency matrix is the zero-one adjacency matrix whose entries $$a_{ij}=1$$ if there is a connection between nodes $$i$$ and $$j$$ and zero otherwise. The Laplacian matrix $$\mathcal{L}=\mathbf{D}-\mathbf{A}$$ where $$\mathbf{D}$$ has entries $$d_{ij}=k_i\delta_{ij}$$, $$k_i$$ the degree of vertex $$i$$. Again see Fig. 1 for an illustration of the spectrum of $$\mathbf{A}$$ and $$\mathcal{L}$$ in the real-world network of the high-voltage power grid in the Western States of the USA [5]. In [34], the Laplacian spectra of one-dimensional RGGs are studied. The authors show that the ensemble-averaged Laplacian spectrum of RGGs on the circle consists of a continuous part and a discrete part consisting of peaks at integer values. We numerically obtained the Laplacian spectrum for an ensemble of RGGs. The ensemble-averaged spectral density $$\rho_l(\lambda)$$ is illustrated in Fig. 3. In [33], the spectra of the adjacency matrix are studied for RGGs. They find that the ensemble averaged spectral density has a discrete part consisting of a peak at $$-1$$. We numerically obtained the adjacency spectrum of an ensemble of RGGs. This is illustrated in Fig. 4. Fig. 3. View largeDownload slide Ensemble-averaged Laplacian spectral density. An illustration of the ensemble-averaged spectral density of $$10^3$$ node RGGs with a connection range of $$r=0.09375$$ (a) and $$r=0.3$$ (b). The ensembles consist of $$10^4$$ RGGs. Inset in (b) shows detail of peaks at integer values. Fig. 3. View largeDownload slide Ensemble-averaged Laplacian spectral density. An illustration of the ensemble-averaged spectral density of $$10^3$$ node RGGs with a connection range of $$r=0.09375$$ (a) and $$r=0.3$$ (b). The ensembles consist of $$10^4$$ RGGs. Inset in (b) shows detail of peaks at integer values. Fig. 4. View largeDownload slide Ensemble-averaged adjacency spectral density. An illustration of the ensemble-averaged spectral density of $$10^3$$ node RGGs with a connection range of $$r=0.09375$$ (a) and $$r=0.3$$ (b). The ensembles consist of $$10^4$$ RGGs. Fig. 4. View largeDownload slide Ensemble-averaged adjacency spectral density. An illustration of the ensemble-averaged spectral density of $$10^3$$ node RGGs with a connection range of $$r=0.09375$$ (a) and $$r=0.3$$ (b). The ensembles consist of $$10^4$$ RGGs. In both [33] and [34], they identify the presence of symmetric nodes as the structural phenomenon which gives rise to the multiplicities in the eigenvalues which characterise the spectral densities. These motifs or graph orbits are subgraphs whose nodes are invariant under permutation of the indices. That is two nodes are symmetric in this sense when they are connected to the same set of nodes. Eigenvectors localise on these symmetric nodes and give rise to integer eigenvalues. To see this let $$n_1$$ and $$n_2$$ be symmetric nodes and $$\mathbf{x}$$ be a vector with $$x_1=1$$ and $$x_2=-1$$, all other entries equal to zero. Considering the adjacency matrix, we then have \begin{equation} \left( \begin{array}{@{}cc|c@{}} 0&1&...\\ 1&0&...\\ \hline 1&1&\\ 0&0&\\ :&:& \end{array} \right)\left( \begin{array}{@{}c@{}} 1\\ -1\\ 0\\ 0\\ : \end{array} \right) =-1\left( \begin{array}{@{}c@{}} 1\\ -1\\ 0\\ 0\\ : \end{array} \right) \label{Eq:motifadj} \end{equation} (2.1) if $$n_1$$ and $$n_2$$ are connected (called a Type-I symmetry). If they are not connected we get eigenvalue $$0$$ (a Type-II symmetry). For the Laplacian we get \begin{equation} \left( \begin{array}{@{}cc|c@{}} k&-1&...\\ -1&k&...\\ \hline -1&-1&\\ 0&0&\\ :&:& \end{array} \right)\left( \begin{array}{@{}c@{}} 1\\ -1\\ 0\\ 0\\ : \end{array} \right) =(k+1)\left( \begin{array}{@{}c@{}} 1\\ -1\\ 0\\ 0\\ : \end{array} \right) \label{Eq:motiflap} \end{equation} (2.2) if $$n_1$$ and $$n_2$$ are connected. If they are not connected we get eigenvalue $$k$$. Here $$k$$ is the degree of the vertices $$n_i$$. We note that the Laplacian distinguishes between different degrees in these motifs whilst the adjacency does not. Note that for a set of $$s$$ symmetric nodes, there are $$s-1$$ independent, orthogonal eigenvectors that lead to a multiplicity of $$s-1$$ for the eigenvalue. 2.1 Symmetry probability The symmetry of a node is dependent upon the nodes in its neighbourhood and their respective neighbourhoods. The neighbourhood of a node $$n_i$$ is defined as $$B_r(n_i)= \{ x : |x - n_i| \leq r\}$$, that is the region within the connection range of $$n_i$$. Two nodes have a shared neighbourhood $$\mathcal{N}_{s}(n_i,n_j) = B_r(n_i) \cap B_r(n_j)$$ which is given by the intersection of their respective neighbourhoods. An additional important concept is the excluded neighbourhood, $$ \mathcal{N}_{ex}(n_i, n_j) = (B_r(n_i)\cup B_r(n_j)) \backslash (B_r(n_i) \cap B_r(n_j)) $$ which for two vertices is the region that is within the range of one of the vertices but not both. A given node $$n_i$$ is type-I symmetric when there is a node $$n_j$$ within its neighbourhood and when the excluded neighbourhood of $$n_i$$ and $$n_j$$ is empty. This ensures that $$n_i$$ and $$n_j$$ are connected and that they are connected to the same set of nodes. If they are not within the neighbourhood of each other but have an empty excluded neighbourhood then they are type-II symmetric. We calculated the probabilities of finding type-I and type-II symmetric nodes from ensembles of RGGs. The results are illustrated in Fig. 5. For one-dimensional RGGs, the probability of type-I symmetric nodes quickly approaches a constant value as a function of connection radius while type-II quickly approaches zero. For two- and three-dimensional RGGs. we see entirely different behaviour. Most interestingly there is an optimal value of $$r$$ for finding type-I symmetric nodes. Fig. 5. View largeDownload slide Symmetry probability. Illustrated here is the probability $$P_{sym}$$ of a node being symmetric as calculated from ensembles of $$10^3$$ node RGGs as a function of connection radius $$r$$. We have calculated these as a function of dimension $$D$$ and intensity (number of nodes) $$N$$. Fig. 5. View largeDownload slide Symmetry probability. Illustrated here is the probability $$P_{sym}$$ of a node being symmetric as calculated from ensembles of $$10^3$$ node RGGs as a function of connection radius $$r$$. We have calculated these as a function of dimension $$D$$ and intensity (number of nodes) $$N$$. 3. Dimension and limiting probabilities In order to look closer at the differences across dimension, we have looked at the adjacency spectral density of both two-dimensional and three–dimensional RGGs with similar connection probability. The results are illustrated in Fig. 6 where we see a noticeable difference in that for the $$3D$$ RGGs the peak at $$-1$$ is far less prominent. Fig. 6. View largeDownload slide Three-dimensional RGG. Illustrated here is the adjacency spectral density of an ensemble of two-dimensional (left) and three-dimensional RGGs. The RGGs consist of $$1000$$ nodes whilst the connection radius is $$0.348569$$ and $$0.45$$ for the two-dimensional and three-dimensional graphs, respectively. This ensures that the connection probability is the same for both. Fig. 6. View largeDownload slide Three-dimensional RGG. Illustrated here is the adjacency spectral density of an ensemble of two-dimensional (left) and three-dimensional RGGs. The RGGs consist of $$1000$$ nodes whilst the connection radius is $$0.348569$$ and $$0.45$$ for the two-dimensional and three-dimensional graphs, respectively. This ensures that the connection probability is the same for both. To understand this property, we look at the probability that nearest neighbour vertices are symmetric (these are the most likely to be symmetric). We will analyse the minimum separation distance between nodes in a RGG and derive how it scales as the number of nodes increases. We consider $$N$$ nodes $$n_1, n_2,..., n_N$$, uniformly distributed on d-dimensional torus and choose an index set $$I$$ which consists of all pairs of nodes $$I = \{ \alpha \subset \{ 1,2,...,N\}: | \alpha | = 2 \}$$. For each $$\alpha=\{i,j\}$$ in the index set $$I$$ we let $$X_{\alpha}$$ be the indicator random variable of event $$|n_i -n_j| \leq x$$. That is, the event that the nodes $$n_i, n_j$$ are separated by a distance less than $$x$$. Note that $$ P(X_{\alpha}=1) = c_Dx^D = p_{\alpha}$$, where $$c_D$$ is the volume of the unit ball in $$D$$ dimensions. Furthermore, for each $$\alpha \in I$$ we choose a $$B_{\alpha} \subset I$$ with $$\alpha \in B_{\alpha}$$ such that $$B_{\alpha}$$ is a neighbourhood of dependence. That is for $$\beta \in B_{\alpha}, X_{\alpha}$$ and $$X_{\beta}$$ are dependent. For each $$\alpha$$ we let \begin{equation} B_{\alpha} = \{ \beta \in I : \alpha \cap \beta \neq \emptyset\}. \label{Eq:depend} \end{equation} (3.1) Consider the sum \begin{equation} W = \sum_{\alpha \in I} X_{\alpha} \label{Eq:rvSum} \end{equation} (3.2) and note that \begin{equation} P(W=0) = P(s_{min} > x) \label{Eq:SumProbEquivalence} \end{equation} (3.3) where $$s_{min}$$ is the minimum distance of any pair of nodes in the RGG. The expectation of $$W$$, is given by \begin{equation} \mathbb{E}(W) = {N \choose 2} c_Dx^D. \\ \label{Eq:ExpW} \end{equation} (3.4) We now apply the Chen–Stein method described in the Introduction to remove the dependency of the inter-node distances. From Theorem $$1$$ in [35], we have that \begin{equation} |P(W=0)-e^{-w}| \leq (b_1 + b_2 + b_3)\left(\frac{1-e^{-w}}{w}\right) \label{Eq:Theorem1AGG} \end{equation} (3.5) where $$w = \mathbb{E}(W)$$ and $$b_1$$, $$b_2$$ and $$b_3$$ are constants given by \begin{align} b_1 &= \sum_{\alpha \in I} \sum_{\beta \in B_{\alpha}} p_{\alpha} p_{\beta} \label{Eq:b1}\\ \end{align} (3.6) \begin{align} b_2 & = \sum_{\alpha \in I} \sum_{\alpha \neq \beta \in B_{\alpha}} p_{\alpha \beta}, \ \ p_{\alpha \beta} = \mathbb{E}(X_{\alpha}X_{\beta}). \label{Eq:b2}\\ \end{align} (3.7) \begin{align} b_3 & = \sum_{\alpha \in I} \mathbb{E} | \mathbb{E} \left( X_{\alpha}-p_{\alpha} | \sigma(X_{\beta}: \beta \notin B_{\alpha})\right)| \label{Eq:b3} \end{align} (3.8) From (3.1), we have \begin{eqnarray}\nonumber b_1 &=& |I| |B_{\alpha}|(c_D x^D)^2\\\nonumber &=& {N \choose 2} \left[ {N \choose 2} - {N-2 \choose 2} \right] (c_D x^D)^2\\ &=& (N^3 -5N^2/2 + 3N/2)(c_D x^D)^2. \label{Eq:b1Eval} \end{eqnarray} (3.9) Considering $$b_2$$ we note that the $$X_{\alpha}$$ are pairwise independent, this implies $$\mathbb{E}(X_{\alpha}X_{\beta}) = \mathbb{E}(X_{\alpha}) \mathbb{E}(X_{\beta}) = (c_D x^D)^2$$, therefore \begin{eqnarray}\nonumber b_2&=& |I| |B_{\alpha}-1|(c_D x^D)^2\\\nonumber &=& {N \choose 2} \left[ {N \choose 2} - {N-2 \choose 2} -1 \right] (c_D x^D)^2\\ &=& (N^3 -3N^2 + 2N)(c_D x^D)^2. \label{Eq:b2Eval} \end{eqnarray} (3.10) Finally we note that $$X_{\alpha}$$ is independent of all $$X_{\beta}$$ where $$\beta \notin B_{\alpha}$$, hence $$b_3 =0$$. Combining equations (3.9 and 3.10) via equation (3.5), we have the following \begin{equation} |P(W=0) - e^{-w}| \leq (4N-7)c_D x^D\left( 1-e^{-\frac{N^2-N}{2}c_Dx^D}\right)\!. \label{Eq:Inequality} \end{equation} (3.11) We note that from (3.4) we have that $$e^{-w}$$ is of order one when $$N^2x^D \sim 1$$, that is when $$x \sim N^{-\frac{2}{D}}$$. Furthermore in this regime from equation (3.11) \begin{equation} |P(W=0) - e^{-w}| \rightarrow 0, \ \ N \rightarrow \infty. \label{Eq:limit} \end{equation} (3.12) Hence we see that $$P(W=0) = P(s_{min} > x)$$ is order one when $$x \sim N^{-\frac{2}{D}}$$. From this we derive that $$s_{min}$$ scales like $$N^{-\frac{2}{D}}$$ for large $$N$$. For $$D=1$$, two points separated by a distance $$s$$ have an excluded neighbourhood of length $$2s$$. The probability that they are type-I symmetric with $$s=s_{min}= C_1 N^{-2}$$ for constant $$C_1$$ is then \begin{eqnarray} {\mathbb P}(N(\mathcal{N}_{ex})=0) &=& \left(1- \frac{2C_1}{N^2}\right)^{N-2}\\ \end{eqnarray} (3.13) \begin{eqnarray} &\rightarrow& 1, N \rightarrow \infty. \label{Eq:symm_prob_limit_1d} \end{eqnarray} (3.14) So the closest nodes will be type-I symmetric in this limit. We obtain the same result in the thermodynamic limit, where the mean degree is kept constant with $$r = C N^{-\frac{1}{D}}$$. For $$D=2$$, two points separated by a distance $$s$$ have an excluded neighbourhood equal to two times the area of a circle with radius $$r$$, minus four times the area of the circular segment with height $$r-s/2$$, that is \begin{eqnarray}\nonumber || \mathcal{N}_{ex}||&=&2\pi r^2-4r^2\cos^{-1} \left( \frac{s}{2r} \right) +2s\sqrt{r^2-\frac{s^2}{4}}\\ &=&4r^2 \sin^{-1}\left( \frac{s}{2r}\right)+2s\sqrt{r^2-\frac{s^2}{4}}. \label{Eq:2D_excludedneighbour} \end{eqnarray} (3.15) Using $$s=s_{min} = C_2 N^{-1}$$ for some constant $$C_2$$ the probability of type-I symmetry in two dimensions is then \begin{eqnarray}\nonumber {\mathbb P}(N(\mathcal{N}_{ex})=0)&=&\left(1-4r^2 \sin^{-1}\left(\frac{C_2}{2rN}\right)-\frac{2C_2}{N}\sqrt{r^2-\frac{C_2^2}{4N^2}} \right)^{N-2} \\ &=& \left( 1 -\frac{2C_2}{N}\left(r+\sqrt{r^2-\frac{C_2^2}{4N^2}} \right)- \mathcal{O}(N^{-3})\right)^{N-2} \\ \end{eqnarray} (3.16) \begin{eqnarray} &\rightarrow& e^{-4C_2r}, N \rightarrow \infty \label{Eq:Symmetry_probability_2D} \end{eqnarray} (3.17) where we use $$\sin^{-1}(x) = x + \mathcal{O}(x^3)$$. In the thermodynamic limit with $$r=CN^{-\frac{1}{2}}$$ \begin{eqnarray}\nonumber {\mathbb P}(N(\mathcal{N}_{ex})=0)&=& \left( 1 - \frac{4C^2}{N}\sin^{-1}\left( \frac{C_2}{2CN^{0.5}}\right)-\frac{2C_2}{N}\sqrt{\frac{C^2}{N}-\frac{C_2^2}{4N^2}} \right)^{N-2} \\\nonumber &=& \left( 1 -\frac{2C_2C}{N^{\frac{3}{2}}}\left(1+\sqrt{1-\frac{C_2^2}{4C^2N^2}} \right)- \mathcal{O}\left(N^{-3/2}\right)\right)^{N-2} \\ &\rightarrow& 1, N \rightarrow \infty, \label{Eq:Symmetry_probability_2D_tl} \end{eqnarray} (3.18) this probability goes to one. With $$D=3$$, two points separated by a distance $$s$$ have an excluded neighbourhood equal to two times the volume of a sphere minus four times the volume of the spherical cap with height $$r-s/2$$, that is \begin{eqnarray}\nonumber || \mathcal{N}_{ex}||&=&\frac{8\pi r^3}{3}-\frac{4\pi}{3}\left (r-\frac{s}{2}\right)^2 \left(2r+ \frac{s}{2}\right) \\ &=&2\pi sr^2-\frac{\pi s^3}{6}. \label{Eq:3D_excludedneighbour} \end{eqnarray} (3.19) Using $$s=s_{min} = C_3 N^{-\frac{2}{3}}$$ for constant $$C_3$$, \begin{equation} || \mathcal{N}_{ex}||=2\pi r^2C_3 N^{-\frac{2}{3}}-\frac{\pi}{6}C_3 N^{-2}. \label{Eq:3D_excludedneighbour_lambda} \end{equation} (3.20) Hence the probability of seeing no nodes in this excluded neighbourhood is \begin{eqnarray}\nonumber {\mathbb P}(N(\mathcal{N}_{ex})=0)&=& \left(1- 2\pi r^2C_3 N^{-\frac{2}{3}}+\frac{\pi}{6}C_3N^{-2}\right)^{N-2}\\ & \rightarrow 0& N \rightarrow \infty. \label{Eq:3D_symmetry_prob} \end{eqnarray} (3.21) In the thermodynamic limit with $$r=C N^{-\frac{1}{3}}$$ \begin{eqnarray}\nonumber {\mathbb P}(N(\mathcal{N}_{ex})=0)&=& \left(1- 2\pi C^2C_3 N^{-\frac{4}{3}}+\frac{\pi}{6}C_3N^{-2}\right)^{N-2}\\ & \rightarrow 1& N \rightarrow \infty. \end{eqnarray} (3.22) The difference we see is that in one and two dimensions, the probability that points separated by the minimal distance are symmetric approaches a constant value in the intensive limit of large $$N$$ while in three dimensions this probability goes to zero. In the thermodynamic limit, this probability goes to one. 4. Summary We have looked at the appearance of symmetric motifs in random geometric graphs. These subgraphs are of interest as they are prevalent in many real-world networks and random geometric graphs but not in other random graph models. We looked at how the probability of finding symmetric nodes is dependent on the connection radius and the dimension of the random geometric graph. We found that in one-dimensional random geometric graphs this probability is close to being independent of the connection radius and the density in that it quickly approaches a constant value as $$r$$ is increased. In two and three dimensions in contrast we found that there is a value of $$r$$ at which the probability attains a maximum value. In the thermodynamic limit, we found that the closest nodes will be symmetric almost surely, irrespective of the dimension. While in the intensive limit, in three dimensions this probability goes to zero. Future work in this direction will look to analytically understand the numerical results we presented here on the probability of finding symmetric nodes as a function of connection radius. In addition, it will be possible to study how generalizations of the hard disc connection function affect the appearance of symmetric nodes. Acknowledgements The authors are grateful to an anonymous referee for correcting a few of the equations in Section 3. Funding This work was supported by the EPSRC grant number EP/N002458/1 for the project Spatially Embedded Networks. References 1. Newman, M. E. J. ( 2003) The structure and function of complex networks. SIAM Rev. , 45, 167– 256. Google Scholar CrossRef Search ADS 2. Newman, M. E. J. ( 2010) Networks: An Introduction . Oxford, UK: Oxford University Press. Google Scholar CrossRef Search ADS 3. Erdős, P. & Rényi, A. ( 1959) On Random Graphs I. Publ. Math. Debrecen , 6, 290– 297. 4. Barabási, A. & Albert, R. ( 1999) Emergence of scaling in random networks. Science , 286, 509– 512. Google Scholar CrossRef Search ADS PubMed 5. Watts, D. J. & Strogatz, S. H. ( 1998) Collective dynamics of’small-world’networks. Nature , 393, 440– 442. Google Scholar CrossRef Search ADS PubMed 6. Chung, F. ( 1994) Spectral Graph Theory. CBMS Regional Conference Series, vol. 92. Providence [RI, USA]: Conference Board of the Mathematical Sciences. Google Scholar CrossRef Search ADS 7. Farkas, I. J., Derényi, I., Barabási, A.-L. & Vicsek, T. ( 2001) Spectra of “real-world” graphs: beyond the semicircle law. Phys. Rev. E , 64, 026704. Google Scholar CrossRef Search ADS 8. Mieghem, P. ( 2011) Graph Spectra for Complex Networks . New York, NY: Cambridge University Press. 9. MacArthur, B. D. & Sánchez-García, R. J. ( 2009) Spectral characteristics of network redundancy. Phys. Rev. E , 80, 026117. Google Scholar CrossRef Search ADS 10. Phadke, A. & Thorp, J. ( 2009) Computer Relaying for Power Systems . Chichester UK: Wiley. Google Scholar CrossRef Search ADS 11. MacArthur, B. D., Sánchez-García, R. J. & Anderson, J. W. ( 2008) Symmetry in complex networks. Discrete Appl. Math. , 156, 3525– 3531. Google Scholar CrossRef Search ADS 12. Arenas, A., Díaz-Guilera, A. & Pérez-Vicente, C. J. ( 2006) Synchronization processes in complex networks. Phys. D Nonlinear Phenom. , 224, 27– 34. Google Scholar CrossRef Search ADS 13. Diaz-Guilera, A., Gomez-Gardenes, J., Moreno, Y. & Nekovee, M. ( 2009) Synchronization in random geometric graphs. Inter. J. Bifur. Chaos , 19, 687– 693. Google Scholar CrossRef Search ADS 14. Aufderheide, H., Rudolf, L. & Gross, T. ( 2012) Mesoscale symmetries explain dynamical equivalence of food webs. New J. Phys. , 14, 105014. Google Scholar CrossRef Search ADS 15. Do, A.-L., Hfener, J. & Gross, T. ( 2012) Engineering mesoscale structures with distinct dynamical implications. New J. Phys. , 14, 115022. Google Scholar CrossRef Search ADS 16. Gilbert, E. N. ( 1961) Random plane networks. J. Soc. Ind. Appl. Math. , 9, 533– 543. Google Scholar CrossRef Search ADS 17. Penrose, M. ( 2003) Random Geometric Graphs. Oxford Studies in Probability. Oxford, UK: Oxford University Press. Google Scholar CrossRef Search ADS 18. Walters, M. ( 2011) Random geometric graphs. Surveys in Combinatorics 2011 ( Chapman R. ed.), vol. 392. London Mathematical Society Lecture Note Series. Cambridge: Cambridge University Press, pp. 365– 401. Google Scholar CrossRef Search ADS 19. Barthlemy, M. ( 2011) Spatial networks. Phys. Rep. , 499, 1– 101. Google Scholar CrossRef Search ADS 20. Estrin, D., Govindan, R., Heidemann, J. & Kumar, S. ( 1999) Next century challenges: scalable coordination in sensor networks. Proceedings of the 5th Annual ACM/IEEE International Conference on Mobile Computing and Networking ( Kodesh, H. Bald, V. Imielinksi T. & Steerstrup M. eds), MobiCom ’99. New York, NY: ACM, pp. 263– 270. 21. Haenggi, M., Andrews, J. G., Baccelli, F., Dousse, O. & Franceschetti, M. ( 2009) Stochastic geometry and random graphs for the analysis and design of wireless networks. IEEE J. Sel. Areas Commun. , 27, 1029– 1046. Google Scholar CrossRef Search ADS 22. Gupta, P. & Kumar, P. R. ( 1999) Stochastic Analysis, Control, Optimization and Applications . Critical Power for Asymptotic Connectivity in Wireless Networks. Boston: Birkhäuser, pp. 547– 566. Google Scholar CrossRef Search ADS 23. Pottie, G. J. & Kaiser, W. J. ( 2000) Wireless integrated network sensors. Commun. ACM , 43, 51– 58. Google Scholar CrossRef Search ADS 24. Nekovee, M. ( 2007) Worm epidemics in wireless ad hoc networks. New J. Phys. , 9, 189. Google Scholar CrossRef Search ADS 25. Toroczkai, Z. & Guclu, H. ( 2007) Proximity networks and epidemics. Phys. A , 378, 68– 75. Google Scholar CrossRef Search ADS 26. Wang, P. & González, M. C. ( 2009) Understanding spatial connectivity of individuals with non-uniform population density. Philos. Trans. Roy. Soc. A , 367, 3321– 3329. Google Scholar CrossRef Search ADS 27. Watanabe, D. ( 2010) A study on analyzing the grid road network patterns using relative neighborhood graph. The Ninth International Symposium on Operations Research and Its Applications ( Zhang, X.-S. Liu, D.-G. Wu L.-Y. & Wang Y. ed.). Lecture Notes in Operations Research. Beijing, China: World Publishing Corporation, pp. 112– 119. 28. Xiao, H. & Yeh, E. M. ( 2011) Cascading link failure in the power grid: a percolation-based analysis. 2011 IEEE International Conference on Communications Workshops (ICC) , pp. 1– 6. 29. Higham, D. J., Rašajski, M. & Pržulj, N. ( 2008) Fitting a geometric graph to a proteinâŁ “protein interaction network. Bioinformatics , 24, 1093– 1099. Google Scholar CrossRef Search ADS PubMed 30. Estrada, E. & Chen, G. ( 2015) Synchronizability of random rectangular graphs. Chaos , 25, 0083107. Google Scholar CrossRef Search ADS 31. Estrada, E. & Sheerin, M. ( 2016) Consensus dynamics on random rectangular graphs. Phys. D Nonlinear Phenom. , 323–324, 20– 26. Google Scholar CrossRef Search ADS 32. Dettmann, C. P. & Georgiou, O. ( 2016) Random geometric graphs with general connection functions. Phys. Rev. E , 93, 032313. Google Scholar CrossRef Search ADS PubMed 33. Blackwell, P., Edmondson-Jones, M. & Jordan, J. ( 2006) Spectra of adjacency matrices of random geometric graphs. Unpublished. 34. Nyberg, A., Gross, T. & Bassler, K. E. ( 2015) Mesoscopic structures and the Laplacian spectra of random geometric graphs. J. Complex Netw. , 3, 543– 551. Google Scholar CrossRef Search ADS 35. Arratia, R., Goldstein, L. & Gordon, L. ( 1990) Poisson approximation and the Chen-Stein method. Stat. Sci. , 5, 403– 424. Google Scholar CrossRef Search ADS © The authors 2017. Published by Oxford University Press. All rights reserved.

Journal of Complex Networks – Oxford University Press

**Published: ** Feb 1, 2018

Loading...

personal research library

It’s your single place to instantly

**discover** and **read** the research

that matters to you.

Enjoy **affordable access** to

over 18 million articles from more than

**15,000 peer-reviewed journals**.

All for just $49/month

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Read from thousands of the leading scholarly journals from *SpringerNature*, *Elsevier*, *Wiley-Blackwell*, *Oxford University Press* and more.

All the latest content is available, no embargo periods.

## “Hi guys, I cannot tell you how much I love this resource. Incredible. I really believe you've hit the nail on the head with this site in regards to solving the research-purchase issue.”

Daniel C.

## “Whoa! It’s like Spotify but for academic articles.”

@Phil_Robichaud

## “I must say, @deepdyve is a fabulous solution to the independent researcher's problem of #access to #information.”

@deepthiw

## “My last article couldn't be possible without the platform @deepdyve that makes journal papers cheaper.”

@JoseServera

DeepDyve ## Freelancer | DeepDyve ## Pro | |
---|---|---|

Price | FREE | $49/month |

Save searches from | ||

Create lists to | ||

Export lists, citations | ||

Read DeepDyve articles | Abstract access only | Unlimited access to over |

20 pages / month | ||

PDF Discount | 20% off | |

Read and print from thousands of top scholarly journals.

System error. Please try again!

or

By signing up, you agree to DeepDyve’s Terms of Service and Privacy Policy.

Already have an account? Log in

Bookmark this article. You can see your Bookmarks on your DeepDyve Library.

To save an article, **log in** first, or **sign up** for a DeepDyve account if you don’t already have one.

All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.

ok to continue