On the Network Index of MAS with Layered Lattice-like Structures of Multiple Vertex-Related Parameters

Abstract

In this article, a robust index named first-order network coherence (FONC) for the multi-agent systems (MASs) with layered lattice-like structure is studied via the angle of the graph spectra theory. The union operation of graphs is utilized to construct two pairs of non-isomorphic layered lattice-like structures, and the expression of the index is acquired by the approach of Laplacian spectra, then the corresponding asymptotic results are obtained. It is found that when the cardinality of the node sets of coronary substructures with better connectedness tends to infinity, the FONC of the whole network will have the same asymptotic behavior with the central lattice-like structure in the considered classic graph frameworks. The indices of the networks were simulated to illustrate the the asymptotic results, as described in the last section.

1. Introduction

Multi-agent systems (MASs) are widely studied in many kinds of real applied networks, such as robotic systems [1], traffic networks [2], and unmanned aerial vehicle (UAV) networks. As an important MAS-related problem, the consensus problem refers to vertices achieving a identical physical status in some dynamical networked systems.

The consensus problem has been widely studied in many valuable works through various research factors [3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19] including but not limited to the system order (first or second order [3,4,5,6]), graphical types (digraph [5] or undirected graph, fixed or switching topology), continuity of the system (continuous or discrete time [7]), and type of control protocols (adaptive control [8,9,10,11], intermittent control [9,11], impulsive control [11], or event-trigger control [11,13]).

In the synchronization or consensus problems, the means of connecting the coordination-related systems are always characterized by a topological structure [3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28], and the method of algebraic graph theory is applied [3,14,15,16,17,18,19,20,21,22,23,24,25]. The enlightening research of Reference [14] has given the system robustness from the Laplacian eigenvalues of several classic graphs.

The robust performance of the consensus networks can be characterized by network coherence [15,16]. The articles mention that the performance index can be characterized by mathematical expressions related to Laplacian eigenvalues. Reference [19] shows the changing relationship between the consensus-related index in symmetric and asymmetric trees and the number of leader nodes. Reference [20] obtains the recursive expressions of Laplacian eigenvalues and further derives the exact results of first- and second-order coherence.

During the past decades, the multi-layer network [29] has become a leading topic as a result of its expansive real-world applications. Many networks have layered structures [21,22,23,24,26,29,30]; however, in the research branch of coordination problems, articles that incorporate the theory on Laplacian eigenvalues for consensus index of multi-layered networks are relatively rare. The fan graph is a classic structure since it can be viewed as adhering connections between the leaves of the star graph, and the star graph is a classic structure of sensor networks. The wheel graph can be interpreted to add a new node and link it to each node of a cycle. There exist lots of wheel structure related research in application problems and graph theory research problems.

Considering these classical structures, and inspired by enlightening articles, this paper considers four sorts of MASs with layered lattice-like structures composed by graph operations.

The novelties of this article are listed as follows:

I.

The union of graphs is introduced to form the novel non-isomorphic layered lattice-like structures for the network, and the notion that the peripheral coronary substructure need not be a single classic graph but can be a union of several subgraphs is proposed.

II.

The graph spectra theory combined with the double integral approach are applied to derive the asymptotic results.

III.

We find that when the cardinality of the node sets of coronary substructures with better connectedness tends to infinity, the FONC of the whole network will have approximately asymptotic behavior with the central lattice-like structure in the considered graph frameworks.

Section 2 gives the notations in basic graph theory, and the relation for the Laplacian spectra and index are interpreted. In Section 3, according to the theory of graph spectra, the topologies of the networks are proposed, and the asymptotic results are given. The simulation examples are analyzed and compared in Section 4.

2. Preliminaries

2.1. Basic Notations in Graph Theory

The empty graph with h vertices is denoted by ${\mathfrak{E}}_h$. Let G be an undirected graph with the vertex set $\mathcal{V}\left(G\right)=\{v_1,v_2,\dots ,v_N\}$, and its edge set $\mathcal{E}\left(G\right)=\left\{(v_i,v_j)\right|i,j=1,2,\dots ,N;i\ne j\}$. For any $v_i,v_j\in \mathcal{V}\left(G\right)$, $(v_i,v_j)$ is in $\mathcal{E}\left(G\right)$ if and only if $v_i$ is adjacent to $v_j$. $\mathcal{A}\left(G\right)={\left[a_{ij}\right]}_N$ is the adjacency matrix, where the elements $a_{ij}$ satisfy $a_{ij}=a_{ji}$. In this article, it is supposed that $a_{ij}=1$, if $(v_i,v_j)\in \mathcal{E}\left(G\right)$; otherwise, $a_{ij}=0$. The Laplacian matrix is defined as $\mathfrak{L}\left(G\right)=\mathcal{D}\left(G\right)-\mathcal{A}\left(G\right)$, where $\mathcal{D}\left(G\right)=diag(d_1,d_2,\dots ,d_N)$ with $d_i={\displaystyle \sum _{j\ne i}}{a}_{ij}$. The Laplacian spectrum of G is defined as $SL\left(G\right)=\left(\begin{array}{cccc}{\rho }_1\left(G\right)& {\rho }_2\left(G\right)& \dots & {\rho }_r\left(G\right)\\ l_1& l_2& \dots & l_r\end{array}\right)$, where ${\rho }_1\left(G\right)<{\rho }_2\left(G\right)<\cdots <{\rho }_r\left(G\right)$ are the eigenvalues of $\mathfrak{L}\left(G\right)$, and $l_1,l_2,\dots ,l_r$ are the multiplicities of the eigenvalues [31].

To describe the layered lattice-like structures, the corona operation of two graphs is denoted by ‘∘’ [32,33,34,35], the Cartesian product by ‘□’ [36,37,38], and the union operation by ‘∪’ [31,36].

Lemma 1 

([31,33]). If two graphs $G_1$ and $G_2$ have c and d vertices, respectively, then the Laplacian eigenvalues of $G_1\square G_2$ are given as: ${\kappa }_i\left(G_1\right)+{\kappa }_j\left(G_2\right),(i=1,2\dots ,c;j=1,2,\dots ,d)$, where ${\kappa }_i\left(G_1\right)$ and ${\kappa }_j\left(G_2\right)$ are the L-eigenvalues of $G_1$ and $G_2$.

2.2. The Mathematical Description for FONC

Referring to References [14,15,16,17,18,19,20], the first-order MASs with additive noise is described by

$$\begin{array}{c}\hfill \dot{x}\left(t\right)=-\mathfrak{L}x\left(t\right)+\varphi \left(t\right),\end{array}$$

(1)

where $x\left(t\right)\in R^N$, $\mathfrak{L}$ is the Laplacian matrix, and $\varphi \left(t\right)\in R^N$ is a vector of uncorrelated noise.

Referring to [15,16], the first-order network coherence (FONC) is defined as:

$$\begin{array}{c}\hfill \mathcal{H}=\underset{t\to \infty }{lim}\frac{1}{N}\sum _{i=1}^N\mathrm{Var}\left\{x_i\left(t\right)-\frac{1}{N}\sum _{j=1}^N{x}_j\left(t\right)\right\}.\end{array}$$

The FONC can be given by the Laplacian eigenvalues, i.e.,

$$\begin{array}{c}\hfill \mathcal{H}=\frac{1}{2N}\sum _{i=2}^N\frac{1}{{\rho }_i}.\end{array}$$

(2)

This expression shares similarities with the Kirchhoff index [33,39,40,41] and other network indices [42].

3. Main Results

The system topologies in this research are interpreted as a class of layered lattice-like structure consisting of several classic subgraph copies, and they will be characterized in Section 3.1, Section 3.2, Section 3.3 and Section 3.4.

3.1. The FONC for Network ${\mathfrak{F}}_1$

In this subsection, a sort of layered lattice-like topology based on the wheel and fan graph is considered. As shown in Figure 1, the structure can be seen as a wheel graph in each layer, and the links among each layer are designed to form the fan graph. By the graph operation, the structure is defined by $F_1(p,q,a,b):=(W_p\square F_q)\circ (K_a\cup {\mathfrak{E}}_b)$ and abbreviated as ${\mathcal{F}}_1$, where $p,q$ denotes the cardinality of the node sets of the wheel and fan substructure; a denotes the number of vertices of the complete subgraph in the peripheral coronary substructure; b denotes the number of vertices of degree one in one corona copy, i.e., $(K_a\cup {\mathfrak{E}}_b)$ (see Figure 2; the example $P_3\circ (K_4\cup E_3)$ is to explain the peripheral coronary structure); and the corresponding network with disturbance is denoted as ${\mathfrak{F}}_1$.

Since $SL\left(K_n\right)=\left(\begin{array}{cc}0& n\\ 1& n-1\end{array}\right)$,

$SL\left(W_p\right)=\left(\begin{array}{ccc}0& p& 1+4si{n}^2\left(\frac{i\pi }{p-1}\right)\\ 1& 1& 1\end{array}\right)$, where $i=1,2,\dots ,p-2$.

$SL\left(F_q\right)=\left(\begin{array}{ccc}0& q& 1+4si{n}^2\left(\frac{j\pi }{2(q-1)}\right)\\ 1& 1& 1\end{array}\right)$, where $j=1,2,\dots ,p-2$.

Therefore, according to Lemma 1 (on the L-spectrum of the Cartesian product of two graphs [31,33]), $SL(W_p\square F_q)$ has the following characterization:

(1).

$0,q,p,p+q\in SL(W_p\square F_q)$ with multiplicity 1;

(2).

$1+4si{n}^2\left(\frac{j\pi }{2(q-1)}\right),p+1+4si{n}^2\left(\frac{j\pi }{2(q-1)}\right)\in SL(W_p\square F_q)$ with multiplicity 1, where $j=1,2\dots ,q-2$.

(3).

$1+4si{n}^2\left(\frac{i\pi }{(p-1)}\right),q+1+4si{n}^2\left(\frac{i\pi }{(p-1)}\right)\in SL(W_p\square F_q)$ with multiplicity 1, where $i=1,2,\dots ,p-2$.

(4).

$2+4si{n}^2\left(\frac{i\pi }{(p-1)}\right)+4si{n}^2\left(\frac{j\pi }{2(q-1)}\right)\in SL(W_p\square F_q)$ with multiplicity 1, where $i=1,2,\dots ,$$p-2$, $j=1,2\dots ,q-2$.

The L-spectrum of the subgraph $(K_a\cup {\mathfrak{E}}_b)$ can be described as:

$$SL(K_a\cup {\mathfrak{E}}_b)=\left(\begin{array}{cc}0& a\\ b+1& a-1\end{array}\right);$$

Then, according to the theorem on the corona operation [32,33], the characterization of $SL\left({\mathcal{F}}_1\right)$ can be listed as follows:

(1).

0 and $a+b+1\in SL\left({\mathcal{F}}_1\right)$ with multiplicity 1;

(2).

$\frac{(q+a+b+1)\pm \sqrt{{(q+a+b+1)}^2-4q}}{2}\in SL\left({\mathcal{F}}_1\right)$ with multiplicity 1; $\frac{(p+a+b+1)\pm \sqrt{{(p+a+b+1)}^2-4p}}{2}\in SL\left({\mathcal{F}}_1\right)$ with multiplicity 1; $\frac{(p+q+a+b+1)\pm \sqrt{{(p+q+a+b+1)}^2-4(p+q)}}{2}\in SL\left({\mathcal{F}}_1\right)$ with multiplicity 1.

(3).

$\frac{(2+4si{n}^2\left(\frac{j\pi }{2(q-1)}\right)+a+b)\pm \sqrt{{(2+4si{n}^2\left(\frac{j\pi }{2(q-1)}\right)+a+b)}^2-4(1+4si{n}^2\left(\frac{j\pi }{2(q-1)}\right))}}{2}\in SL\left({\mathcal{F}}_1\right)$ with multiplicity 1, where $j=1,2,\dots ,q-2$.

(4).

$\frac{(p+2+4si{n}^2\left(\frac{j\pi }{2(q-1)}\right)+a+b)\pm \sqrt{{(p+2+4si{n}^2\left(\frac{j\pi }{2(q-1)}\right)+a+b)}^2-4(p+1+4si{n}^2\left(\frac{j\pi }{2(q-1)}\right))}}{2}\in SL\left({\mathcal{F}}_1\right)$ with multiplicity 1, where $j=1,2,\dots ,q-2$.

(5).

$\frac{(2+4si{n}^2\left(\frac{i\pi }{p-1}\right)+a+b)\pm \sqrt{{(2+4si{n}^2\left(\frac{i\pi }{p-1}\right)+a+b)}^2-4(1+4si{n}^2\left(\frac{i\pi }{p-1}\right))}}{2}\in SL\left({\mathcal{F}}_1\right)$ with multiplicity 1, where $i=1,2,\dots ,p-2$.

(6).

$\frac{(q+2+4si{n}^2\left(\frac{i\pi }{p-1}\right)+a+b)\pm \sqrt{{(q+2+4si{n}^2\left(\frac{i\pi }{p-1}\right)+a+b)}^2-4(q+1+4si{n}^2\left(\frac{i\pi }{p-1}\right))}}{2}\in SL\left({\mathcal{F}}_1\right)$ with multiplicity 1, where $i=1,2,\dots ,p-2$.

(7).

$\frac{(3+4si{n}^2\left(\frac{i\pi }{p-1}\right)+4si{n}^2\left(\frac{j\pi }{2(q-1)}\right)+a+b)\pm \sqrt{{(3+4si{n}^2\left(\frac{i\pi }{p-1}\right)+4si{n}^2\left(\frac{j\pi }{2(q-1)}\right)+a+b)}^2-4(2+4si{n}^2\left(\frac{i\pi }{p-1}\right)+4si{n}^2\left(\frac{j\pi }{2(q-1)}\right))}}{2}$$\in SL\left({\mathcal{F}}_1\right)$ with multiplicity 1, where $i=1,2,\dots ,p-2$; $j=1,2,\dots ,q-2$.

(8).

$1\in SL\left({\mathcal{F}}_1\right)$ repeated $bpq$ times; $a+1\in SL\left({\mathcal{F}}_1\right)$ repeated $pq(a-1)$ times.

Therefore, the FONC of ${\mathfrak{F}}_1$ is:

$$\begin{array}{cc}\hfill H\left({\mathfrak{F}}_1\right)=& \frac{1}{2N}\sum _{k=2}^N\frac{1}{{\rho }_k}\hfill \\ \hfill =& \frac{1}{2(pq+pq(a+b\left)\right)}(\frac{1}{a+b+1}+\frac{q+a+b+1}{q}+\sum _{j=1}^{q-2}\frac{2+4si{n}^2\left(\frac{j\pi }{2(q-1)}\right)+a+b}{1+4si{n}^2\left(\frac{j\pi }{2(q-1)}\right)}\hfill \\ \hfill & +\frac{p+a+b+1}{p}+\frac{p+q+a+b+1}{p+q}+\sum _{j=1}^{q-2}\frac{p+2+4si{n}^2\left(\frac{j\pi }{2(q-1)}\right)+a+b}{p+1+4si{n}^2\left(\frac{j\pi }{2(q-1)}\right)}\hfill \\ \hfill & +\sum _{i=1}^{p-2}\frac{2+4si{n}^2\left(\frac{i\pi }{(p-1)}\right)+a+b}{1+4si{n}^2\left(\frac{i\pi }{(p-1)}\right)}+\sum _{i=1}^{p-2}\frac{q+2+4si{n}^2\left(\frac{i\pi }{(p-1)}\right)+a+b}{q+1+4si{n}^2\left(\frac{i\pi }{(p-1)}\right)}\hfill \\ \hfill & +\sum _{j=1}^{q-2}\sum _{i=1}^{p-2}\frac{3+4si{n}^2\left(\frac{i\pi }{(p-1)}\right)+4si{n}^2\left(\frac{j\pi }{\left(2\right(q-1\left)\right)}\right)+a+b}{2+4si{n}^2\left(\frac{i\pi }{(p-1)}\right)+4si{n}^2\left(\frac{j\pi }{2(q-1)}\right)}+bpq+\frac{pq(a-1)}{a+1}).\hfill \end{array}$$

Therefore, we have

$$\begin{array}{cc}\hfill \underset{p,q\to \infty }{lim}H\left({\mathfrak{F}}_1\right)=& \frac{1}{2(1+a+b)}+\frac{1}{2}{\int }_0^1{\int }_0^1\frac{1}{2+4si{n}^2\left(\pi x\right)+4si{n}^2\left(\frac{\pi y}{2}\right)}dxdy\hfill \\ \hfill & +\frac{b}{2(1+a+b)}+\frac{a-1}{2(1+a+b)(a+1)}\hfill \\ \hfill =& \frac{2a+ab+b}{2(1+a+b)(a+1)}+0.096.\hfill \end{array}$$

It can be seen that if the cardinality of the coronary complete substructure, i.e., a, is large enough, the performance index will tend to 0.096, and if b tends to infinity, then the asymptotic index will be 0.596.

3.2. The Performance Index for ${\mathfrak{F}}_2$

In this subsection, a class of lattice-like star-fan composed network is designed. The vertices in the peripheral subgraph are required to be disconnected with other layers. The layered lattice-like structure is defined by $F_2(p,q,a,b):=(W_p\square F_q)\circ (P_a\cup {\mathfrak{E}}_b)$ and abbreviated as ${\mathcal{F}}_2$, where $p,q$ denote the number of vertices in the wheel and fan graph of the lattice-like central structure (see Figure 1), and the corresponding noisy network is denoted as ${\mathfrak{F}}_2$. Figure 3 gives an example to show the partial coronary substructure, i.e., $P_a$. It is designed to form a fan graph copy during the graph operation, and the other part of the peripheral substructure is designed to be a star graph copy.

Since $SL\left(P_a\right)=(0,4si{n}^2\left(\frac{k\pi }{2a}\right)),k=1,2,\dots ,a-1$,

$SL(P_a\cup {\mathfrak{E}}_b)=\left(\begin{array}{cc}0& 4si{n}^2\left(\frac{m\pi }{2a}\right)\\ b+1& a-1\end{array}\right)$, where $m=1,2,\dots ,a-1$.

According to lemmas on the coronary graph operation [32,33], the L-spectrum $SL\left({\mathcal{F}}_2\right)$ has the characterization as follows:

(1).

0 and $a+b+1\in SL\left({\mathcal{F}}_2\right)$ with multiplicity 1;

(2).

$\frac{(q+a+b+1)\pm \sqrt{{(q+a+b+1)}^2-4q}}{2}\in SL\left({\mathcal{F}}_2\right)$ with multiplicity 1; $\frac{(p+a+b+1)\pm \sqrt{{(p+a+b+1)}^2-4p}}{2}\in SL\left({\mathcal{F}}_2\right)$ with multiplicity 1; $\frac{(p+q+a+b+1)\pm \sqrt{{(p+q+a+b+1)}^2-4(p+q)}}{2}\in SL\left({\mathcal{F}}_2\right)$ with multiplicity 1.

(3).

$\frac{(2+4si{n}^2\left(\frac{j\pi }{2(q-1)}\right)+a+b)\pm \sqrt{{(2+4si{n}^2\left(\frac{j\pi }{2(q-1)}\right)+a+b)}^2-4(1+4si{n}^2\left(\frac{j\pi }{2(q-1)}\right))}}{2}\in SL\left({\mathcal{F}}_2\right)$ with multiplicity 1, where $j=1,2,\dots ,q-2$.

(4).

$\frac{(p+2+4si{n}^2\left(\frac{j\pi }{2(q-1)}\right)+a+b)\pm \sqrt{{(p+2+4si{n}^2\left(\frac{j\pi }{2(q-1)}\right)+a+b)}^2-4(p+1+4si{n}^2\left(\frac{j\pi }{2(q-1)}\right))}}{2}\in SL\left({\mathcal{F}}_2\right)$ with multiplicity 1, where $j=1,2,\dots ,q-2$.

(5).

$\frac{(2+4si{n}^2\left(\frac{i\pi }{p-1}\right)+a+b)\pm \sqrt{{(2+4si{n}^2\left(\frac{i\pi }{p-1}\right)+a+b)}^2-4(1+4si{n}^2\left(\frac{i\pi }{p-1}\right))}}{2}\in SL\left({\mathcal{F}}_2\right)$ with multiplicity 1, where $i=1,2,\dots ,p-2$.

(6).

$\frac{(q+2+4si{n}^2\left(\frac{i\pi }{p-1}\right)+a+b)\pm \sqrt{{(q+2+4si{n}^2\left(\frac{i\pi }{p-1}\right)+a+b)}^2-4(q+1+4si{n}^2\left(\frac{i\pi }{p-1}\right))}}{2}\in SL\left({\mathcal{F}}_2\right)$ with multiplicity 1, where $i=1,2,\dots ,p-2$.

(7).

$\frac{(3+4si{n}^2\left(\frac{i\pi }{p-1}\right)+4si{n}^2\left(\frac{j\pi }{2(q-1)}\right)+a+b)\pm \sqrt{{(3+4si{n}^2\left(\frac{i\pi }{p-1}\right)+4si{n}^2\left(\frac{j\pi }{2(q-1)}\right)+a+b)}^2-4(2+4si{n}^2\left(\frac{i\pi }{p-1}\right)+4si{n}^2\left(\frac{j\pi }{2(q-1)}\right))}}{2}$$\in SL\left({\mathcal{F}}_2\right)$ with multiplicity 1, where $i=1,2,\dots ,p-2$; $j=1,2,\dots ,q-2$.

(8).

$1\in SL\left({\mathcal{F}}_2\right)$ repeated $bpq$ times; $4si{n}^2\left(\frac{m\pi }{2a}\right)+1\in SL\left({\mathcal{F}}_2\right)$ repeated $pq$ times, where $m=1,2,\dots ,a-1$.

It can be seen that the only difference of L-spectrum between ${\mathfrak{F}}_1$ and ${\mathfrak{F}}_2$ is the item (8) above; that is, $4si{n}^2\left(\frac{m\pi }{2a}\right)+1\in SL\left({\mathcal{F}}_2\right)$ repeated $pq$ times.

Therefore, similarly, the FONC of ${\mathfrak{F}}_2$ can be obtained, and it is omitted here. When $p,q\to \infty$, the asymptotic difference of FONC between ${\mathfrak{F}}_2$ and ${\mathfrak{F}}_1$, denoted by $▿{\mathfrak{F}}_{12}$, can be obtained:

$$▿{\mathfrak{F}}_{12}\to \frac{1}{2(a+b+1)}\left[\sum _{m=1}^{a-1}\frac{1}{4si{n}^2\left(\frac{m\pi }{2a}\right)+1}-\frac{a-1}{a+1}\right].$$

(3)

Hence, it can be determined that the asymptotic difference tends to $\frac{\sqrt{5}}{10}$ as a tends to infinity, and the asymptotic value of $H\left({\mathfrak{F}}_2\right)$ is larger than that of $H\left({\mathfrak{F}}_1\right)$; when b is large enough, they have the same asymptotic index, and it can be interpreted as the asymptotic result of the difference above being closed when b tends to infinity.

Remark 1. 

In fact, if the layered lattice-like structure is changed to $(F_p\square F_q)\circ (P_a\cup {\mathfrak{E}}_b)$, then the same asymptotic results with the above section can be obtained. These results are omitted here.

Remark 2. 

The construction design of this coronary structure implies that the peripheral substructure of each layer may not simply be a star or fan graph but may be a graph composed of several different classic subgraphs. The lattice-like structure in the middle can be interpreted as consisting of the hub nodes with the highest degree.

3.3. The Performance Index for ${\mathfrak{F}}_3$

The network structure in this subsection is described as follows. From a vertical view, the counterpart nodes with a higher degree of different layers are designed to form the fan graph, and the coronary substructure is a balanced complete k-partite graph. The graph is characterized by $F_3(p,q,a,m):=(W_p\square F_q)\circ \left(K(a,m)\right)$ and abbreviated as ${\mathcal{F}}_3$, where the definition of $p,q$ is the same as that of Section 3.2, and $a,m$ means the multipartite substructure being acted on has a partition of vertex set and each part has m vertices. The related noisy network is denoted by ${\mathfrak{F}}_3$. Figure 4 gives an example of the coronary substructures placed on each node of $P_3$.

The L-spectrum of $K(a,m)$ can be characterized by:

$SL\left(K(a,m)\right)=\left(\begin{array}{ccc}0& am& (a-1)m\\ 1& a-1& am-a\end{array}\right)$

Thus, the Laplacian spectrum of ${\mathcal{F}}_3$ can be described as follows:

(1).

0 and $am+1\in SL\left({\mathcal{F}}_3\right)$ with multiplicity 1;

(2).

$\frac{(q+am+1)\pm \sqrt{{(q+a+b+1)}^2-4q}}{2}\in SL\left({\mathcal{F}}_3\right)$ with multiplicity 1; $\frac{(p+am+1)\pm \sqrt{{(p+am+1)}^2-4p}}{2}\in SL\left({\mathcal{F}}_3\right)$ with multiplicity 1; $\frac{(p+q+am+1)\pm \sqrt{{(p+q+am+1)}^2-4(p+q)}}{2}\in SL\left({\mathcal{F}}_3\right)$ with multiplicity 1.

(3).

$\frac{(2+4si{n}^2\left(\frac{j\pi }{2(q-1)}\right)+am)\pm \sqrt{{(2+4si{n}^2\left(\frac{j\pi }{2(q-1)}\right)+am)}^2-4(1+4si{n}^2\left(\frac{j\pi }{2(q-1)}\right))}}{2}\in SL\left({\mathcal{F}}_3\right)$ with multiplicity 1, where $j=1,2,\dots ,q-2$.

(4).

$\frac{(p+2+4si{n}^2\left(\frac{j\pi }{2(q-1)}\right)+am)\pm \sqrt{{(p+2+4si{n}^2\left(\frac{j\pi }{2(q-1)}\right)+am)}^2-4(p+1+4si{n}^2\left(\frac{j\pi }{2(q-1)}\right))}}{2}\in SL\left({\mathcal{F}}_3\right)$ with multiplicity 1, where $j=1,2,\dots ,q-2$.

(5).

$\frac{(2+4si{n}^2\left(\frac{i\pi }{p-1}\right)+am)\pm \sqrt{{(2+4si{n}^2\left(\frac{i\pi }{p-1}\right)+am)}^2-4(1+4si{n}^2\left(\frac{i\pi }{p-1}\right))}}{2}\in SL\left({\mathcal{F}}_3\right)$ with multiplicity 1, where $i=1,2,\dots ,p-2$.

(6).

$\frac{(q+2+4si{n}^2\left(\frac{i\pi }{p-1}\right)+am)\pm \sqrt{{(q+2+4si{n}^2\left(\frac{i\pi }{p-1}\right)+am)}^2-4(q+1+4si{n}^2\left(\frac{i\pi }{p-1}\right))}}{2}\in SL\left({\mathcal{F}}_3\right)$ with multiplicity 1, where $i=1,2,\dots ,p-2$.

(7).

$\frac{(3+4si{n}^2\left(\frac{i\pi }{p-1}\right)+4si{n}^2\left(\frac{j\pi }{2(q-1)}\right)+am)\pm \sqrt{{(3+4si{n}^2\left(\frac{i\pi }{p-1}\right)+4si{n}^2\left(\frac{j\pi }{2(q-1)}\right)+am)}^2-4(2+4si{n}^2\left(\frac{i\pi }{p-1}\right)+4si{n}^2\left(\frac{j\pi }{2(q-1)}\right))}}{2}$$\in SL\left({\mathcal{F}}_3\right)$ with multiplicity 1, where $i=1,2,\dots ,p-2$; $j=1,2,\dots ,q-2$.

(8).

$am+1\in SL\left({\mathcal{F}}_3\right)$ repeated $(a-1)pq$ times; $(a-1)m+1\in SL\left({\mathcal{F}}_3\right)$ repeated $(am-a)pq$ times.

Hence, the FONC of ${\mathfrak{F}}_3$ can be derived as:

$$\begin{array}{cc}\hfill H\left({\mathfrak{F}}_3\right)=& \frac{1}{2N}\sum _{k=2}^N\frac{1}{{\rho }_k}\hfill \\ \hfill =& \frac{1}{2(pq+pqam)}(\frac{1}{am+1}+\frac{q+am+1}{q}+\sum _{j=1}^{q-2}\frac{2+4si{n}^2\left(\frac{j\pi }{2(q-1)}\right)+am}{1+4si{n}^2\left(\frac{j\pi }{2(q-1)}\right)}\hfill \\ \hfill & +\frac{p+am+1}{p}+\frac{p+q+am+1}{p+q}+\sum _{j=1}^{q-2}\frac{p+2+4si{n}^2\left(\frac{j\pi }{2(q-1)}\right)+am}{p+1+4si{n}^2\left(\frac{j\pi }{2(q-1)}\right)}\hfill \\ \hfill & +\sum _{i=1}^{p-2}\frac{2+4si{n}^2\left(\frac{i\pi }{(p-1)}\right)+am}{1+4si{n}^2\left(\frac{i\pi }{(p-1)}\right)}+\sum _{i=1}^{p-2}\frac{q+2+4si{n}^2\left(\frac{i\pi }{(p-1)}\right)+am}{q+1+4si{n}^2\left(\frac{i\pi }{(p-1)}\right)}\hfill \\ \hfill & +\sum _{j=1}^{q-2}\sum _{i=1}^{p-2}\frac{3+4si{n}^2\left(\frac{i\pi }{(p-1)}\right)+4si{n}^2\left(\frac{j\pi }{\left(2\right(q-1\left)\right)}\right)+am}{2+4si{n}^2\left(\frac{i\pi }{(p-1)}\right)+4si{n}^2\left(\frac{j\pi }{2(q-1)}\right)}+\frac{1}{am+1}(a-1)pq\hfill \\ \hfill & +\frac{1}{(a-1)m+1}(am-a)pq).\hfill \end{array}$$

Therefore, we have

$$\begin{array}{cc}\hfill \underset{p,q\to \infty }{lim}H\left({\mathfrak{F}}_3\right)=& \frac{1}{2(1+am)}+\frac{1}{2}{\int }_0^1{\int }_0^1\frac{1}{2+4si{n}^2\left(\pi x\right)+4si{n}^2\left(\frac{\pi y}{2}\right)}dxdy\hfill \\ \hfill & +\frac{a-1}{2{(1+am)}^2}+\frac{am-a}{2(1+am)(am-m+1)}\hfill \\ \hfill =& \frac{am+a}{2{(1+am)}^2}+\frac{am-a}{2(1+am)(am-m+1)}+0.096.\hfill \end{array}$$

We can see that if the parameter a or m is large enough, the coherence index will approximate to 0.096.

Remark 3. 

When $p,q$ and m are fixed, and if the parameter $a\to +\infty$ is considered, we can find that the asymptotic result of $H\left({\mathfrak{F}}_3\right)$ is irrelevant to m, and we have $H\left({\mathfrak{F}}_3\right)\to \frac{1}{2p{q}^2}+\frac{1}{2p^{2}q}+\frac{1}{2pq(p+q)}+\frac{1}{2pq}[{\sum }_{j=1}^{q-2}\frac{1}{1+4si{n}^2\left(\frac{j\pi }{2(q-1)}\right)}+{\sum }_{j=1}^{p-2}\frac{1}{1+4si{n}^2\left(\frac{j\pi }{(p-1)}\right)}+{\sum }_{j=1}^{q-2}\frac{1}{p+1+4si{n}^2\left(\frac{j\pi }{2(q-1)}\right)}$$+{\sum }_{j=1}^{p-2}\frac{1}{q+1+4si{n}^2\left(\frac{j\pi }{(p-1)}\right)}+{\sum }_{j=1}^{q-2}{\sum }_{i=1}^{p-2}\frac{1}{2+4si{n}^2\left(\frac{i\pi }{(p-1)}\right)+4si{n}^2\left(\frac{j\pi }{2(q-1)}\right)}]$. Similarly, when m tends to infinity, the limitation is irrelevant to the parameter a, and we omit the result here.

3.4. The Performance Index for ${\mathfrak{F}}_4$

In this subsection, a lattice-like structure with a sort of multi-fan composed graph as the coronary peripheral structure (see Figure 5) is considered. Intuitively speaking, the structure’s formation can be seen as adhering copied multi-paths to each nodes of the lattice-like structure. Thus, ${\mathcal{F}}_4:=(W_p\square F_q)\circ \left({\cup }_a{P}_m\right)$.

The L-spectrum of $SL\left({\cup }_a{P}_m\right)=\left(\begin{array}{cc}0& 4si{n}^2\frac{k\pi }{2m}\\ a& a\end{array}\right)$, where $k=1,2,\dots ,m-1$.

Hence, the L-spectrum of ${\mathcal{F}}_4$ has the following description:

The conclusions (1)–(7) are the same as those of $SL\left({\mathcal{F}}_3\right)$, and the item (8) has changed into $1\in SL\left({\mathcal{F}}_4\right)$ repeated $(a-1)pq$ times and $4si{n}^2\frac{k\pi }{2m}+1\in SL\left({\mathcal{F}}_4\right)$ with multiplicity $apq$, where $k=1,2,\dots m-1$.

Therefore, the FONC of ${\mathfrak{F}}_4$ is:

$$\begin{array}{cc}\hfill H\left({\mathfrak{F}}_4\right)=& \frac{1}{2N}\sum _{k=2}^N\frac{1}{{\rho }_k}\hfill \\ \hfill =& \frac{1}{2(pq+pqam)}(\frac{1}{am+1}+\frac{q+am+1}{q}+\sum _{j=1}^{q-2}\frac{2+4si{n}^2\left(\frac{j\pi }{2(q-1)}\right)+am}{1+4si{n}^2\left(\frac{j\pi }{2(q-1)}\right)}\hfill \\ \hfill & +\frac{p+am+1}{p}+\frac{p+q+am+1}{p+q}+\sum _{j=1}^{q-2}\frac{p+2+4si{n}^2\left(\frac{j\pi }{2(q-1)}\right)+am}{p+1+4si{n}^2\left(\frac{j\pi }{2(q-1)}\right)}\hfill \\ \hfill & +\sum _{i=1}^{p-2}\frac{2+4si{n}^2\left(\frac{i\pi }{(p-1)}\right)+am}{1+4si{n}^2\left(\frac{i\pi }{(p-1)}\right)}+\sum _{i=1}^{p-2}\frac{q+2+4si{n}^2\left(\frac{i\pi }{(p-1)}\right)+am}{q+1+4si{n}^2\left(\frac{i\pi }{(p-1)}\right)}\hfill \\ \hfill & +\sum _{j=1}^{q-2}\sum _{i=1}^{p-2}\frac{3+4si{n}^2\left(\frac{i\pi }{(p-1)}\right)+4si{n}^2\left(\frac{j\pi }{\left(2\right(q-1\left)\right)}\right)+am}{2+4si{n}^2\left(\frac{i\pi }{(p-1)}\right)+4si{n}^2\left(\frac{j\pi }{2(q-1)}\right)}+(a-1)pq\hfill \\ \hfill & +\sum _{k=1}^{m-1}\frac{1}{4si{n}^2\frac{k\pi }{2m}+1}apq).\hfill \end{array}$$

Similar to the FONC of ${\mathfrak{F}}_3$, it can be derived that $H\left({\mathfrak{F}}_4\right)\to \frac{a}{2(1+am)}$$(1+{\sum }_{k=1}^{m-1}\frac{1}{4si{n}^2\frac{k\pi }{2m}+1})+0.096$; thus, $H\left({\mathfrak{F}}_4\right)$ tends to $\frac{\sqrt{5}}{5}+0.096$ when the parameter m is large enough, and meanwhile the difference between the FONC of ${\mathfrak{F}}_3$ and ${\mathfrak{F}}_4$ is equal to $\frac{\sqrt{5}}{5}$, and we also find that whether a or m is large enough, $H\left({\mathfrak{F}}_3\right)<H\left({\mathfrak{F}}_4\right)$ holds.

Remark 4. 

It is supposed that the coronary copy of ${\mathfrak{F}}_3$ and ${\mathfrak{F}}_4$ has the same cardinality of vertex sets of partition; only the connection structures within each partition and the links among all partition sets are different. Thus, the coronary linking structure of ${\mathfrak{F}}_3$ and ${\mathfrak{F}}_4$, which is located at the edge of the graph, has the same number of nodes; that is, $\left|V\left(K(a,m)\right)\right|=|V\left({\cup }_a{P}_m\right)|$. These two graph classes both have a parts, and each part has m vertices. One can see that when m is large enough (tends to infinity), $H\left({\mathfrak{F}}_4\right)$ is 0.5 larger than $H\left({\mathfrak{F}}_3\right)$, and when a tends to infinity, $H\left({\mathfrak{F}}_4\right)$ is $(1+{\sum }_{k=1}^{m-1}\frac{1}{4si{n}^2\frac{k\pi }{2m}+1})/2m$ larger than $H\left({\mathfrak{F}}_3\right)$.

Remark 5. 

The asymptotic results can be applied to analyze or improve the first-order network robustness. The layered lattice-like structure in this paper can be a reference for the research of layered weighted complex networks.

4. Simulation

The coherence indices of the MASs with layered lattice-like graph are simulated and compared in this section.

As a simulation example for the changing relation of the coherence $H\left({\mathfrak{F}}_1\right)$ and the other graph parameters, Figure 6 describes the change in coherence index with p and q when a and b are both fixed to 3.

When p and q both tend to infinity, $H\left({\mathfrak{F}}_1\right)\to 0.417$ (see the point (46,43,0.4176)). This coincides with the calculation results of Section 3.1.

From Figure 6, one can also see that when one of p and q is fixed to a relatively small value, the change in p has a greater effect on the change in H. When p and q are both large enough, the robustness of the network is better than the case that one of $p,q$ is relatively small.

Figure 7 describes the change surface of $H\left({\mathfrak{F}}_2\right)$ with the parameters p and q when $a=b=3$. It implies that the point (46,43,0.4355) is in accordance with the tendency $H\left({\mathfrak{F}}_2\right)\to 0.4347$ as $p,q\to \infty$, and similar results to Figure 6 can be acquired. In Figure 8, the comparison of $H\left({\mathfrak{F}}_1\right)$ and $H\left({\mathfrak{F}}_2\right)$ with the change in p and q is given. From the point (49,49,0.4355) and (49,49,0.4176), we can see that the difference of the two function values is equal to 0.0179, which is consistent with the result (3) on page 6. Figure 9 shows the variance of $H\left({\mathfrak{F}}_3\right)$ with the change in a and m. Through Figure 9, we can see that when $p,q$ are both relatively small, $H\left({\mathfrak{F}}_3\right)$ is larger than that in the case where at least one of $p,q$ is relatively large. The two pair of points (45, 100, 0.09928), (70, 100, 0.09921) and (100, 85, 0.09919), (100, 28, 0.09942) imply that when a or m tends to infinity, $H\left(F_3\right)$ will decrease monotonously to the constant 0.099, and the value is only relevant to p and q, which is consistent with Remark 3. Figure 10 shows the changing curve of $H\left({\mathfrak{F}}_4\right)$ with a and m, $p=q=3$. Compared with Figure 9 and Figure 10, and combined with the result in Section 3.4, we find that when $p,q$ are fixed to the same value for $H\left({\mathfrak{F}}_3\right)$ and $H\left({\mathfrak{F}}_4\right)$, the inequality $H\left({\mathfrak{F}}_3\right)<H\left({\mathfrak{F}}_4\right)$ always holds. When m, p, q are fixed, the coherence $H\left({\mathfrak{F}}_4\right)$ will increase monotonously to a constant.

5. Conclusions

This article mainly studied the FONC of the layered noisy systems. To be specific, the methods of graph spectra were utilized to analyze the layered lattice-like graph, then the specific mathematical expressions for FONC were derived, and novel asymptotic results were acquired. We find that when the cardinality of the node sets of coronary substructures with better connectedness tends to infinity, the FONC of the whole network will have approximate asymptotic behavior with the central lattice-like structure in the considered classic graph frameworks.