Brought to you by:
Paper

Spectral density of complex networks with two species of nodes

Published 29 January 2013 © 2013 IOP Publishing Ltd
, , Citation Taro Nagao 2013 J. Phys. A: Math. Theor. 46 065003 DOI 10.1088/1751-8113/46/6/065003

1751-8121/46/6/065003

Abstract

The adjacency and Laplacian matrices of complex networks with two species of nodes are studied and the spectral density is evaluated by using the replica method in statistical physics. The network nodes are classified into two species (A and B) and connections are made only between the nodes of different species. A static model of such bipartite networks with power law degree distributions is introduced by applying Goh, Kahng and Kim's method to construct scale-free networks. As a result, the spectral density is shown to obey a power law in the limit of large mean degree.

Export citation and abstract BibTeX RIS

1. Introduction

The theory of complex networks, which has been dramatically developed since the end of the last century, is based on the observation that there are universal features in real biological and social networks [1]. One such feature is the scale-free property, meaning that the degree (the number of nodes directly connected to each node) distribution function P(Δ) obeys a power law P(Δ)∝Δ−λ for large Δ. Barabási and Albert explained the origin of this scale-free property by focusing on the network growing process [2]. Goh, Kahng and Kim formulated a static network model which exhibits the scale-free property [3].

The connection pattern of a network is mathematically described by the adjacency matrix. When the network has the scale-free property, the spectral (eigenvalue) density ρ(μ) of the adjacency matrix is also expected to obey a power law ρ(μ)∝μ−γ for large μ. Dorogovtsev et al presented an analytic evidence of this power law behaviour [4, 5]. Moreover, a relation γ = 2λ − 1 was found between the exponents of the power laws. Rodgers et al analysed Goh, Kahng and Kim's static model and confirmed the power law behaviour of ρ(μ) [6].

In this paper, we shall study scale-free networks with two species (A and B) of nodes. Connections are made only between the nodes of different species. We introduce a static model of such bipartite scale-free networks by applying Goh, Kahng and Kim's method, and observe that each species has its own degree distribution function obeying a power law. Suppose that the exponent of the degree distribution function is λA for the species A and λB for the species B. Using the replica method in statistical physics, we are able to analytically evaluate the spectral density ρ(μ) in the limit of large mean degree [68]. As a result, we find that ρ(μ) also obeys a power law and the exponent γ is associated with the exponents λA and λB. In addition, the spectral density of the Laplacian matrix is similarly analysed and the power law behaviour is confirmed.

Bipartite networks find applications in the analysis of human sexual contacts [9], and of the connections between collaborators and collaboration acts [10], such as actors and movies, scientists and papers. The adjacency matrices of bipartite networks are also interesting from the viewpoint of random matrix theory, since the Gaussian matrix model with the same structure is called the chiral Gaussian ensemble and applied to physics, such as the QCD gauge theory [11].

The outline of this paper is as follows. In section 2, a static model of bipartite scale-free networks with two species of nodes is introduced, and the adjacency and Laplacian matrices are defined. In section 3, in order to evaluate the spectral density, we apply the replica method to the network model. In the limit of large mean degree, the power law behaviour of the spectral density is analytically derived. In section 4, the effective medium approximation is briefly discussed as an attempt to treat the case with a finite mean degree.

2. Complex networks with two species of nodes

Let us suppose that there are N nodes of type A and M nodes of type B (NM). We are interested in the asymptotic behaviour of bipartite networks with two species of nodes A and B in the limit

Equation (2.1)

We introduce a static model of such networks with power law degree distributions by applying Goh, Kahng and Kim's method. Each node of type A is assigned a probability Pj normalized as

Equation (2.2)

while each node of type B has a probability Qk with

Equation (2.3)

The nodes of type A and B are connected according to the following procedure. In each step, we choose a node j of type A and a node k of type B with probabilities Pj and Qk, respectively. Then the nodes j and k are connected, unless they are already connected. After repeating such a step pN times, a node j of type A and a node k of type B are connected with the probability

Equation (2.4)

Let us consider an N × M matrix C (NM), where Cjk = 1 if the node j of type A is directly connected to the node k of type B, and Cjk = 0 otherwise. This random matrix C describes the connection pattern of the network with two species of nodes. Each matrix element Cjk is independently distributed with the probability density function (p.d.f.)

Equation (2.5)

We assume that Pj and Qk are given by

Equation (2.6)

and

Equation (2.7)

There are thus two parameters α and β controlling the p.d.f. of the matrix C.

We define the degree dj of the type-A node j as the number of directly connected type-B nodes:

Equation (2.8)

Then the type-A node degree distribution function is given by

Equation (2.9)

where the brackets denote the average over the p.d.f. (2.5) and δ(x) is Dirac's delta function. We can similarly introduce the degree ek of the type-B node k:

Equation (2.10)

and the type-B node degree distribution function

Equation (2.11)

In appendix A, a useful asymptotic relation

Equation (2.12)

is derived in the limit (2.1). Here tjk, which depends neither on N nor on M, is in the neighbourhood of the origin so that $|{\rm e}^{ - {\rm i} t_{jk}} - 1| < 1$.

As special cases, we can readily derive asymptotic relations for

Equation (2.13)

as

Equation (2.14)

Then we can readily see that

Equation (2.15)

so that the mean degree m(A) of the type-A node is

Equation (2.16)

while the mean degree m(B) of the type-B node is

Equation (2.17)

It can be seen from (2.6), (2.9) and (2.14) that the type-A node degree distribution function can be written as

Equation (2.18)

Then in the limit Δ → , we find

Equation (2.19)

and similarly obtain

Equation (2.20)

Thus we have seen that the network has the scale-free property, as the node degree distribution functions obey power laws. The exponents of the power laws defined as

Equation (2.21)

are found to be λA = (1/α) + 1 and λB = (1/β) + 1.

In this paper, we study the adjacency and Laplacian matrices of this scale-free network. The adjacency matrix $\mathcal{A}$ of this network is defined as

Equation (2.22)

where CT is the transpose of C and On is an n × n matrix with zero elements. The Laplacian matrix $\mathcal{L}$ is an (N + M) × (N + M) symmetric matrix with

Equation (2.23)

3. Spectral density

Let us define that J is the adjacency matrix $\mathcal{A}$ or the Laplacian matrix $\mathcal{L}$. The spectral density of J is defined as

Equation (3.1)

where μj, j = 1, 2, ..., N + M, are the eigenvalues of J. In order to calculate ρ(μ), we introduce the partition function

Equation (3.2)

Using the partition function Z, we can write the spectral density as

Equation (3.3)

where epsilon is an infinitesimal positive number and I is an (N + M) × (N + M) identity matrix. Then we can utilize the relation

Equation (3.4)

to obtain

Equation (3.5)

Therefore, it is necessary to evaluate the average 〈Zn〉.

The replica method explained in appendix B is known to be a powerful tool for that purpose. It follows in the limit (2.1) that

Equation (3.6)

Here,

Equation (3.7)

Equation (3.8)

and

Equation (3.9)

with

Equation (3.10)

The functional integrations are taken over the auxiliary functions $\xi _j({\vec{\phi }})$ and $\eta _k({\vec{\psi }})$ satisfying

Equation (3.11)

In the limit (2.1), the functional integrations over $\xi _j({\vec{\phi }})$ and $\eta _k({\vec{\psi }})$ are dominated by the stationary point satisfying

Equation (3.12)

where θj and ωk are the Lagrange multipliers. It follows from this equation that

Equation (3.13)

where Θj and Ωk are normalization constants.

In the limit of large mean degree p, the variational equations (3.13) are satisfied by the Gaussian ansatz

Equation (3.14)

as shown in appendix C. Here, Im σj ⩽ 0 and Im τk ⩽ 0. This property simplifies the problem and enables us to evaluate the asymptotic spectral density.

Let us consider the limit p with a scaling variable $E = \mu /\sqrt{p}$. In appendix C, we find the asymptotic spectral density of the adjacency matrix $\mathcal{A}$ as

Equation (3.15)

in the tail region E. The exponent γ of the spectral density defined as

Equation (3.16)

is (2/α) + 1 if α ⩾ β, and is (2/β) + 1 if β ⩾ α. Thus γ is associated with λA = (1/α) + 1 and λB = (1/β) + 1 as γ = 2min (λA, λB) − 1.

It is also explained in appendix C that the asymptotic spectral density of the Laplacian matrix $\mathcal{L}$ is given by

Equation (3.17)

in the region μ = O(p) with p. Here, H(x) is defined as

Equation (3.18)

The exponent γL of the spectral density $\rho (\mu ) \propto \mu ^{-\gamma _L}$ (μ → ) is (1/α) + 1 if α ⩾ β, and is (1/β) + 1 if β ⩾ α. Thus γL is associated with λA and λB as γL = min (λA, λB).

4. Effective medium approximation

In the previous section, we have dealt with the spectral density in the limit p. The calculation of the spectral density with a finite mean degree p is a much more involved problem, for which sophisticated numerical schemes have been proposed [1215]. In this section, we briefly discuss a simple approximation method (effective medium approximation) for that problem [8, 1620]. In this approximation, we put the Gaussian ansatz (3.14) into formulas (3.7), (3.8) and (3.9), and solve the stationary point equations

Equation (4.1)

and

Equation (4.2)

In the case of the adjacency matrix $\mathcal{A}$, the above procedure results in the effective medium approximation (EMA) equations

Equation (4.3)

As for scale-free networks with a single species of nodes, Nagao and Rodgers calculated the 1/p expansion of the spectral density by using the corresponding EMA equation [20]. A similar analytical treatment could also be possible in the present case. Here, however only results of numerical iterations of (4.3) are shown in figure 1 as the EMA spectral densities. They are compared with the spectral densities of positive eigenvalues calculated by numerical diagonalizations of numerically generated adjacency matrices (averaged over 100 samples). The EMA gives a better fit for a larger p, as expected from the fact that the variational equations (3.13) are satisfied by the Gaussian ansatz (3.14) in the limit p. When p = 1, the agreement significantly breaks down around the origin, although it is still fairly good in the tail region with large μ.

Figure 1.

Figure 1. The EMA spectral densities (dashed curves) and the spectral densities of numerically generated adjacency matrices (histograms) with p = 1, 5 and 10. The parameters are N = 1000, M = 200 and α = β = 1/2.

Standard image

In the limit α, β → 0, we obtain the adjacency matrix of a classical random graph with two species, where the connections are made only between the nodes of different species. In that case, σj and τk can be written as σ and τ, respectively, because they depend neither on j nor on k. The EMA equations become a cubic equation for σ

Equation (4.4)

and

Equation (4.5)

These equations are equivalent to Nagao and Tanaka's SEMA (symmetric EMA) equations concerning the spectral density of sparse correlation matrices [19], and can be analysed in the same way.

We can similarly derive the EMA equations for the Laplacian matrix $\mathcal{L}$ as

Equation (4.6)

In the limit α, β → 0, σj and τk can again be reduced to σ and τ, respectively. Then we find a cubic equation for σ

Equation (4.7)

and

Equation (4.8)

Acknowledgments

The author thanks Professor G J Rodgers and Professor Toshiyuki Tanaka for valuable discussions. This work was partially supported by the Japan Society for the Promotion of Science (KAKENHI 20540372).

Appendix A

In this appendix, we derive an asymptotic relation

Equation (A.1)

where tjk is a parameter which is independent of N and M. We moreover assume that tjk is in the neighbourhood of the origin so that |Sjk| < 1 holds for $S_{jk} = {\rm e}^{ - {\rm i} t_{jk}} - 1$. A similar argument for Goh, Kahng and Kim's model is found in [21].

The Taylor expansion of the logarithmic function gives

Equation (A.2)

We show

Equation (A.3)

in two steps.

Step 1

Let us first prove that

Equation (A.4)

We define

Equation (A.5)

and

Equation (A.6)

Then we see that

Equation (A.7)

A monotonously decreasing continuous function F(x) satisfies

Equation (A.8)

so that

Equation (A.9)

with

Equation (A.10)

Then one can again use (A.8) to obtain

Equation (A.11)

where

Equation (A.12)

Using the notations

Equation (A.13)

we see that

Equation (A.14)

Then, using the inequality

Equation (A.15)

we find

Equation (A.16)

where

Equation (A.17)

In the case min (α, β) > 1/2, we similarly employ

Equation (A.18)

to obtain

Equation (A.19)

where

Equation (A.20)

Using inequality (A.15), we can similarly derive the estimates

Equation (A.21)

If min (α, β) > 1/2, then we utilize (A.18) to find

Equation (A.22)

Moreover, one can readily see from the inequality G1(x) ⩽ x (x ⩾ 0) that

Equation (A.23)

It follows from (A.16), (A.19), (A.21), (A.22) and (A.23) that

Equation (A.24)

which yields (A.4).

Step 2

We next prove

Equation (A.25)

Using

Equation (A.26)

we see that

Equation (A.27)

We can again employ (A.8) to obtain

Equation (A.28)

where

Equation (A.29)

Making use of the identity

Equation (A.30)

we find

Equation (A.31)

where

Equation (A.32)

In the case α + β > 1, by means of

Equation (A.33)

we obtain

Equation (A.34)

Here the symbol N(α, β) is defined in (A.20). Inequality (A.33) similarly gives the estimates

Equation (A.35)

Moreover, it is evident from the inequality G0(x) ⩽ 1 (x ⩾ 0) that

Equation (A.36)

Now we can easily see from (A.31), (A.34), (A.35) and (A.36) that

Equation (A.37)

for any ℓ ⩾ 2. This relation results in the asymptotic estimate (A.25).

Appendix B

Let us first discuss the spectral density of the adjacency matrix $\mathcal{A}$. The eigenvalues μj, j = 1, 2, ..., N + M of $\mathcal{A}$ consist of M pairs ±νj, j = 1, 2, ..., M and NM zeros. Note that ν2j > 0 are identified with the eigenvalues of the M × M correlation matrix V with

Equation (B.1)

Using the notations

Equation (B.2)

and

Equation (B.3)

we can rewrite the partition function Z defined in (3.2) as

Equation (B.4)

Then we introduce the replica variables

Equation (B.5)

and

Equation (B.6)

to obtain

Equation (B.7)

Now we can see from (2.12) that

Equation (B.8)

It should be noted that this asymptotic relation holds if ${\vec{\phi }}_j \cdot {\vec{\psi }}_k$ is in the neighbourhood of the origin. This condition is justified in the limit of large mean degree p, since ${\vec{\phi }}_j^2$ and ${\vec{\psi }}_k^2$ are scaled as O(p−1/2) or O(p−1) (see equations (C.4) and (C.23)).

Using the notation

Equation (B.9)

we obtain

Equation (B.10)

so that we find

Equation (B.11)

Here, S1 and S2 are defined in (3.8) and (3.9). The auxiliary functions $\xi _j({\vec{\phi }})$ and $\eta _k({\vec{\psi }})$ satisfy (3.11). If J is the Laplacian matrix $\mathcal{L}$, we can similarly derive the same formula (B.11) for 〈Zn〉, except the change of S2 according to (3.10).

It can be readily seen that

Equation (B.12)

where

Equation (B.13)

In the limit N, the dominant contribution comes from the stationary point satisfying

Equation (B.14)

which means

Equation (B.15)

Therefore, we find an asymptotic estimate

Equation (B.16)

One can similarly derive another estimate

Equation (B.17)

in the limit M. Then we arrive at

Equation (B.18)

where S0 is defined in (3.7).

Appendix C

Putting the Gaussian ansatz (3.14) into (3.13), we see in the limit n → 0 that

Equation (C.1)

where

Equation (C.2)

and

Equation (C.3)

Let us first consider the adjacency matrix $\mathcal{A}$. We are in a position to take the limit p with the scalings

Equation (C.4)

Then, we obtain

Equation (C.5)

The variational equations (3.13) are satisfied by the Gaussian ansatz (3.14), if σj and τk are determined by these equations.

In order to analytically treat (C.5), we define the scaling variables

Equation (C.6)

Then it is straightforward to find

Equation (C.7)

and

Equation (C.8)

in the limit (2.1). Using the notations

Equation (C.9)

we obtain

Equation (C.10)

In order to evaluate the behaviour of S and T in the tail region E, we write

Equation (C.11)

with real s(R), s(I), t(R) and t(I). Then it can be seen that

Equation (C.12)

Let us employ an asymptotic formula [6]

Equation (C.13)

and obtain an estimate

Equation (C.14)

so that

Equation (C.15)

One can similarly derive

Equation (C.16)

so that

Equation (C.17)

It follows from (C.15) and (C.17) that

Equation (C.18)

Now we can evaluate the asymptotic behaviour of the spectral density ρ(μ) in the tail region E. Equations (3.5) and (3.6) can be utilized as

Equation (C.19)

in the limit (2.1). Here,

Equation (C.20)

and we can similarly obtain

Equation (C.21)

Then it can be seen from (C.15), (C.17) and (C.18) that

Equation (C.22)

This gives the asymptotic spectral density of the adjacency matrix $\mathcal{A}$ in the tail region E.

We next compute the spectral density of the Laplacian matrix $\mathcal{L}$. Using the scalings

Equation (C.23)

and taking the limit p, we find

Equation (C.24)

so that

Equation (C.25)

where epsilon is an infinitesimal positive number. Then it follows in the limit (2.1) that

Equation (C.26)

and

Equation (C.27)

where H(x) is defined in (3.18). Therefore, we arrive at

Equation (C.28)

This gives the asymptotic spectral density of the Laplacian matrix $\mathcal{L}$ in the region μ = O(p).

Please wait… references are loading.
10.1088/1751-8113/46/6/065003