A Distributed Algorithm for the Assignment of the Laplacian Spectrum for Path Graphs

Abstract

In this paper, we bring forward a distributed algorithm for the assignment of a prescribed Laplacian spectrum for path graphs by means of asymmetric weight assignment. We first describe the meaningfulness and the relevance of this mathematical setting in modern technological applications, and some examples are reported, revealing its practical usefulness in a variety of applications. Then, the solution is derived both theoretically and through an algorithm. Special attention is devoted to a distributed implementation of the main algorithm, which is a valuable feature for several modern applications. Finally, the positivity is discussed, which is revealed to be a consequence of the strict interlacing property.

1. Introduction

In recent decades, an increasing number of research activities arose studying the behavior of interacting devices for applications in disparate technological areas, giving rise to the subject of networked systems [1,2,3,4]. Network topology became a fundamental new design paradigm, and mainly the spectral properties of some graph-related matrices, such as adjacency or Laplacian matrix, were researched.

The Laplacian matrix of a graph is a potent tool for the theoretical study and design of many contemporary technological applications where the graph encodes local interactions among agents, thus including [5,6] multi-agent systems, computer networks, sparse coding, and collaborative robotic networks. In such applications, the spectral properties of a graph-related matrix, and especially the Laplacian matrix, often play a key role in explaining some internal structure or condition, such as clustering, partitioning, consensus or synchronization [5,7,8]. Grounded Laplacian refers to the main submatrix that results from eliminating the i-th row and column of a Laplacian matrix. The performance of various applications is also directly correlated with the spectral features of a grounded Laplacian, which have undergone many studies in recent years as well [9,10]. In this paper, we shed a light on the class of Laplacian matrices associated with path graphs, which have the structure of (asymmetric) Jacobi matrices, and they constitute a class of graphs of great importance which has been widely studied over the years [11,12,13].

On the one hand, from a mathematical standpoint, this topic comes within the category of inverse eigenvalue problems, that is, the existence analysis and computation of structured matrices with assigned eigenstructure [14], which has a long history among mathematicians and it is still widely debated [15,16,17]. With reference to such literature, the contribution of this paper is the derivation of an algorithm, which can be distributed with respect to the nodes of the path, and this is a fundamental peculiarity for several modern applications, as detailed in Section 2.

On the other hand, however, the topic of the present paper stems from modern applications, and this makes the challenge different from the classical mathematical settings, as described in [14]. It also has strong connections with control systems theory, and more specifically, it is close to the pole allocation through feedback [18,19,20]. As a final remark, it is worth noting that the knowledge of the Laplacian spectrum allows to monitor the system evolution and detect any anomaly caused by edge malfunctioning or malicious behaviors [21,22].

An early short version of this work was presented in [23]. The paper is organized as follows. In Section 2, after a brief introduction of the notation, we provide some motivating examples that are strongly related to the mathematical problem. In Section 3, the main results of the paper are derived; first, a global algorithm solving the stated problem is deduced using and inductive logic over n, then, it is rearranged to implement it in a distributed fashion, where each node can compute its own weights based only on data gathered by its neighborhood. Here, the analysis is thorough, including complete proofs for all statements. Finally, a discussion on the positivity of the gains provided by the algorithm closes the paper. Furthermore, this paper contains a much improved comprehensive and thorough treatment. A final section describes an illustrative example in the distributed setting for a network of six nodes.

Notation

We now briefly introduce the notation adopted in this paper and we report some basic facts of Graph Theory that are useful to understand the following sections. Given $A\in {\mathbb{R}}^{d_1\times d_2}$, ${\left[A\right]}_{ij}$ denotes its $(i,j)$-th entry and ${\left[A\right]}_i$ its i-th column, while ${\left(A\right)}_{ij}\in {\mathbb{R}}^{(n-1)\times (n-1)}$ is the submatrix obtained by removing the i-th row and j-th column of A. The Laplace expansion rule for the computation of the determinant of a square matrix $A\in {\mathbb{R}}^{n\times n}$ is: $detA={\sum }_{j=1}^n{(-1)}^{i+j}{\left[A\right]}_{ij}det{\left(A\right)}_{ij}$.

A nonnegative (positive) matrix $A\in {\mathbb{R}}^{n\times n}$ is a matrix with the property ${\left[A\right]}_{ij}\ge 0$ (${\left[A\right]}_{ij}>0$). A matrix $A\in {\mathbb{R}}^{n\times n}$ is combinatorially symmetric [24] or structurally symmetric when it holds that ${\left[A\right]}_{ij}\ne 0$ if and only if ${\left[A\right]}_{ji}\ne 0$. A matrix $A\in {\mathbb{R}}^{n\times m}$ is called generalized row stochastic matrix if there exists a $c\in \mathbb{R}$ so that ${\sum }_{j=1}^n{\left[A\right]}_{ij}=c$ for any $i=1,\cdots ,n,$ and zero row sum matrix if such a c is $c=0$. In this paper, we deal with zero-row sum combinatorially symmetric matrices [25]. In the following, we denote by $\mathsf{\Lambda }$ the spectrum of a matrix $A\in {\mathbb{R}}^{n\times n}$, namely the set of its eigenvalues, and by ${\rho }_A$ the spectral radius of A, i.e.,  the maximum modulus of its eigenvalues. For a reference book on polynomials, the reader is referred to the book [26].

A graph $\mathcal{G}=(\mathcal{V},\mathcal{E})$ is a mathematical object made of a vertex set $\mathcal{V}=\{1,2,\dots ,n\}$ and an edge set$\mathcal{E}\subset \mathcal{V}\times \mathcal{V}$. A path connecting vertex $j_1$ with $j_{k+1}$ is a subset of edges ${\left\{\left(j_{\ell }{,}_{\ell +1}\right)\right\}}_{{|}_{\ell \in [1,k]}}$. Given a graph $\mathcal{G}=(\mathcal{V},\mathcal{E})$, we define the adjacency matrix $A\in {\mathbb{R}}^{n\times n}$ as ${\left[A\right]}_{ij}=1$ if $(i,j)\in \mathcal{E}$ and ${\left[A\right]}_{ij}=0$ if $(i,j)\notin \mathcal{E}$, and the weighted adjacency matrix as ${\left[A_w\right]}_{ij}={\alpha }_{ij}$ with ${\alpha }_{ij}>0$ if $(i,j)\in \mathcal{E}$ and ${\left[A_w\right]}_{ij}=0$ if $(i,j)\notin \mathcal{E}$. Finally, the weighted Laplacian matrix is defined as ${\left[L_w\right]}_{ij}=-{\left[A_w\right]}_{ij}$ if $i\ne j$ and ${\left[L_w\right]}_{ii}={\sum }_{j=1,i\ne j}^n{\left[A_w\right]}_{ij}$. By construction, $L_w\mathbf{1}=\mathbf{0}$ for any $L_w\in {\mathcal{L}}_w$, i.e., the Laplacian is a zero-row sum matrix. Finally, the ${\mathbb{R}}^{(n-1)\times (n-1)}$ matrix obtained by removing the ℓ-th row and column of $L_w$ is the so-called grounded Laplacian matrix (or Dirichlet Laplacian matrix) (see for information [9,27]), which we denote in the following by $L_w^{(\ell )}$.

Conversely, for a graph $\mathcal{G}$, we use the symbol ${\mathcal{L}}_w\left(\mathcal{G}\right)$ to denote the set of all possible weighted Laplacian matrices $L_w$ whose graph is $\mathcal{G}$; in other words, ${\mathcal{L}}_w\left(\mathcal{G}\right)$ denotes the set of all $n\times n$ zero-row sum $\mathcal{G}$-structured square matrices.

2. Motivating Examples

In this section, we provide an abstract multi-agent system setting where the problem afforded in this paper is meaningful, and then, we provide some examples of several modern technological fields where the algorithms provided in this paper can be effectively adopted.

2.1. Collaborative Multi-Agent Systems and Consensus Networks

In the following, we describe the abstract multi-agent setting [5,28], which is the mathematical framework of the applications described soon after. Given a set of N variables $x_i\left(t\right)$, $i\in \{1,\cdots ,N\}$ updating as ${\dot{x}}_i\left(t\right)=u_i\left(t\right)$, where $u_i\left(t\right)$ is an update variable chosen by each node i. A graph $\mathcal{G}=\{\mathcal{V},\mathcal{E}\}$ describes the communication among nodes, namely two neighbor nodes i, j which are connected through an edge $(i,j)\in \mathcal{E}$ are able to exchange their values (that is, node i sends $x_i\left(t\right)$ to node j and vice versa), so node i can choose $u_i\left(t\right)={\sum }_{j\in {\mathcal{N}}_i}{k}_{ij}(x_j\left(t\right)-x_i\left(t\right))$, where $k_{ij}$ are set by node i. The resulting dynamics of the team can be compactly written $\dot{\mathbf{x}}\left(t\right)=-L_{\kappa }\mathbf{x}\left(t\right)$ using a vector $\mathbf{x}\in {\mathbb{R}}^{\mathbf{N}}$ built as ${\left[\mathbf{x}\right]}_i\left(t\right)=x_i\left(t\right)$ for a $L_{\kappa }$, which belongs to the set ${\mathcal{L}}_w$, and the evolution of the network is governed by the spectrum of $L_{\kappa }$ [29]. In this framework, the design of asymmetric gains was recently studied [30,31,32] to increase the convergence rate, which is a key feature; this was recently explored in [33,34,35].

Assume now that one node, e.g., node 1, takes the role of a leader and it adds a driving signal $v_1\left(t\right)$ to its update variable, namely:

$$u_1\left(t\right)=\sum _{j\in {\mathcal{N}}_1}{k}_{1j}(x_j\left(t\right)-x_1\left(t\right))+v_1\left(t\right)$$

(1)

to take control of the team evolution [36]. This setting is known as leader follower network, [37,38,39] and its dynamics is described by:

$$\begin{array}{cc}\hfill \dot{\mathbf{x}}\left(t\right)& =-L_{\kappa }\mathbf{x}\left(t\right)+{\mathbf{e}}_1{v}_1\left(t\right)\hfill \end{array}$$

(2)

$$\begin{array}{cc}\hfill y\left(t\right)& ={\mathbf{e}}_1^T\mathbf{x}\left(t\right)\hfill \end{array}$$

(3)

with $L_{\kappa }\in {\mathcal{L}}_w$ or, equivalently, using the transfer function:

$$G_1\left(s\right)={\mathbf{e}}_1^T{(sI+L_{\kappa })}^{-1}{\mathbf{e}}_1={\displaystyle \frac{n\left(s\right)}{d\left(s\right)}}$$

where $d\left(s\right)=det(sI+L_{\kappa })$ and $n\left(s\right)={\mathbf{e}}_1^{T}Adj(sI+L_{\kappa }){\mathbf{e}}_1={\left[Adj(sI+L_{\kappa })\right]}_{11}=det(sI+L_k^{\left(1\right)})$, and hence, the zeros of $n\left(s\right)$ and $d\left(s\right)$ are the poles and zeros of system (2), (3), so that their allocation allows to set all the fundamental input-output properties of the team (such as the zero-pole distance and, in turn, to influence several dynamical properties of the team driven by a prescribed node, such as controllability and observability of the whole network from node 1). It is worth remarking that coprimeness between $n\left(s\right)$ and $d\left(s\right)$ is necessary for the full control of the team by the leader [40].

2.2. Some Examples of Applications Scenarios

The above setting is applied to several technological modern applications, for example: (a) Robotic networks. In this application area, the above setting is widely used to perform global actions (such as rendez-vous, deployment, formation control) without recurring to a supervisory device [41]. (b) Wireless sensor networks. Several fundamental issues of wireless sensor networks are solved using the above setting, for example the synchronization problem [42,43] and the average value of a measured environmental quantity [44]. (c) Vehicle platooning. The above setting is adopted to model the dynamics of vehicles platoon, where Laplacian and grounded Laplacian of path graphs are well suited to describe the common case of bidirectional non-cyclic interactions between the agents [45]. It is worth remarking that weight asymmetry has already been investigated  [46] to improve the team performances. (d) Electrical power systems. The multi-agent setting is widely adopted when the numerous challenges of the evolution of the electric grid toward a smart grid are taken into account  [47,48,49].

2.3. Problem Statement

Based on the motivating examples introduced so far, we introduce the Problem Statement afforded in the following.

Problem 1. 

Consider a graph $\mathcal{G}=(\mathcal{V},\mathcal{E})$, and two polynomials $a\left(s\right)$, $b\left(s\right)$ having zeros as ${\lambda }_i,{\mu }_i\in \mathbb{R}$ satisfying $0<{\mu }_1<{\lambda }_2<\dots <{\mu }_{n-1}<{\lambda }_n$, compute gains ${\alpha }_{ij}$, such that ${\alpha }_{ij}=0$ if $(i,j)\notin \mathcal{E}$ and ${\alpha }_{ij}>0$ if $(i,j)\in \mathcal{E}$ satisfying $det[sI-L_w]=a\left(s\right)$ and $det[sI-L_w^{\left(1\right)}]=b\left(s\right)$.

Remark 1. 

The above Problem Statement is strictly related to the examples in Section 2.2, and does not include the possibility of overlap between Λ and ${\mathsf{\Lambda }}^{\left(1\right)}$, which is an unfavorable condition in most applications (as, for example, it implies the loss of controllability and observability by the leader [50]).

3. Problem Solution

The proposed solution follows an inductive approach over $n\in \mathbb{N}$. We start with the solution of $n=2$ and $n=3$, then we extend the solution to a generic n through an iterative algorithm.

3.1. Preliminary Results on n = 2 and n = 3

Consider $n=2$, which is described by the following matrices:

$$A=\left[\begin{array}{cc}0& 1\\ 1& 0\end{array}\right],A_w=\left[\begin{array}{cc}0& {\alpha }_{12}\\ {\alpha }_{21}& 0\end{array}\right]L_w=\left[\begin{array}{cc}{\alpha }_{12}& -{\alpha }_{12}\\ -{\alpha }_{21}& {\alpha }_{21}\end{array}\right],L_w^{\left(1\right)}=\left[\begin{array}{c}{\alpha }_{21}\end{array}\right].$$

(4)

For any $0<{\mu }_1<{\lambda }_2$, the solution of the problem can be parametrized as:

$$L_w=\left[\begin{array}{cc}{\lambda }_2-{\mu }_1& {\mu }_1-{\lambda }_2\\ -{\mu }_1& {\mu }_1\end{array}\right]$$

(5)

We now consider case $n=3$ when ℓ is a leaf, that is:

$$A=\left[\begin{array}{ccc}0& 1& 0\\ 1& 0& 1\\ 0& 1& 0\end{array}\right],A_w=\left[\begin{array}{ccc}0& {\alpha }_{12}& 0\\ {\alpha }_{21}& 0& {\alpha }_{23}\\ 0& {\alpha }_{32}& 0\end{array}\right]\mathrm{and}{L}_w=\left[\begin{array}{ccc}{\alpha }_{12}& -{\alpha }_{12}& 0\\ -{\alpha }_{21}& {\alpha }_{21}+{\alpha }_{23}& -{\alpha }_{23}\\ 0& -{\alpha }_{32}& {\alpha }_{32}\end{array}\right]$$

(6)

with associated grounded Laplacian $L_w^{\left(1\right)}=\left[\begin{array}{cc}{\alpha }_{21}+{\alpha }_{23}& -{\alpha }_{23}\\ -{\alpha }_{32}& {\alpha }_{32}\end{array}\right].$

The computation of the characteristic polynomial shows that:

$$det[sI-L_w]=(s-{\alpha }_{12}){\varphi }_2\left(s\right)-s{\alpha }_{21}{\psi }_2\left(s\right),$$

(7)

$$det[sI-L_w^{\left(1\right)}]={\varphi }_2\left(s\right)-{\alpha }_{21}{\psi }_2\left(s\right)$$

(8)

where

$${\varphi }_2\left(s\right)=det\left[\begin{array}{cc}s-{\alpha }_{23}& {\alpha }_{23}\\ {\alpha }_{32}& s-{\alpha }_{32}\end{array}\right]\mathrm{and}{\psi }_2\left(s\right)=det\left[\begin{array}{c}s-{\alpha }_{32}\end{array}\right].$$

Imposing Equations (7) and (8) for given $a\left(s\right)$ and $b\left(s\right)$ allows to compute the weights ${\alpha }_{12}$, ${\alpha }_{21}$, and the two polynomials ${\varphi }_2\left(s\right)$, ${\psi }_2\left(s\right)$. In turn, by making use of the solution (5), it is easy to compute the remaining coefficients ${\alpha }_{23}$, ${\alpha }_{32}$ from the polynomials ${\varphi }_2\left(s\right)$, ${\psi }_2\left(s\right)$ obtained in the previous step. In the following, we prove that the above procedure can be extended to a general $n\in \mathbb{N}$.

3.2. A Recursive General Solution When ℓ Is a Leaf

We are now ready to derive a solution for a generic $n\in \mathbb{N}$. It follows an inductive logic over $\mathbb{N}$ and the solution is recursive.

Theorem 1. 

Let $\mathcal{G}$ be a path graph and node 1 a leaf node, and  $L_w\in {\mathcal{L}}_w$, $L_w^{\left(1\right)}\in {\mathcal{L}}_w^{\left(1\right)}$ be, respectively, its weighted Laplacian and grounded Laplacian. Take two polynomials $a\left(s\right)=s^n+a_{n-1}{s}^{n-1}+\dots +a_{1}s$ and $b\left(s\right)=s^{n-1}+b_{n-2}{s}^{n-2}+\dots +b_{1}s+b_0$ such that their zeros satisfy the Problem Statement (Section 2.3).

There always exist ${\alpha }_{ij}\in \mathbb{R}$ such that $det\left[sI-L_w\right]=a\left(s\right)$ and $det\left[sI-L_w^{\left(1\right)}\right]=b\left(s\right)$, and they can be computed using Algorithm 1.

Algorithm 1: Computation of the edge weights as the solution of the Problem Statement (Section 2.3).

Data: $a\left(s\right)$, $b\left(s\right)$ Result: ${\alpha }_{ij}$, $i,j=1,\cdots ,n$ initialization: ${\varphi }^{\left(n\right)}\left(s\right)=a\left(s\right)$, ${\psi }^{\left(n\right)}\left(s\right)=b\left(s\right)$, ${\alpha }_{ij}=0$, for all $i,j=1,\cdots ,n;$

Proof. 

For a path graph, $A=\left[\begin{array}{cccc}0& 1& 0& \cdots \\ 1& 0& & \\ & & \ddots & \\ \cdots & 0& 1& 0\end{array}\right]$, $A_w=\left[\begin{array}{cccc}0& {\alpha }_{(n-1,)n}& 0& \cdots \\ {\alpha }_{n,(n-1)}& 0& & \\ & & \ddots & {\alpha }_{1,2}\\ \cdots & 0& {\alpha }_{2,1}& 0\end{array}\right]$ and

$$L_w=\left[\begin{array}{cccc}{\alpha }_{(n-1),n}& -{\alpha }_{(n-1),n}& & \cdots \\ -{\alpha }_{n,(n-1)}& a_{(n-1),(n-1)}& & \\ & & \ddots & -{\alpha }_{1,2}\\ \cdots & 0& -{\alpha }_{2,1}& {\alpha }_{2,1}\end{array}\right],L_w^{\left(1\right)}=\left[\begin{array}{ccc}{a}_{(n-1),(n-1)}& -{\alpha }_{(n-2),(n-1)}& \cdots \\ -{\alpha }_{(n-1),(n-2)}& \ddots & \\ & & -{\alpha }_{1,2}\\ \cdots & 0& {\alpha }_{2,1}\end{array}\right]$$

(9)

where $a_{(n-1),(n-1)}={\alpha }_{n,(n-1)}+{\alpha }_{(n-2),(n-1)}$. Define:

$${\varphi }_n\left(s\right)=det\left[sI-L_w\right]\mathrm{and}{\psi }_n\left(s\right)=det\left[sI-L_w^{\left(1\right)}\right];$$

(10)

using the Laplace rule for the determinant along the first line, one can further elaborate:

$$\begin{array}{c}det\left[sI-L_w\right]=(s-{\alpha }_{(n-1),n})det\left[\begin{array}{ccc}s-a_{(n-1),(n-1)}& {\alpha }_{(n-2),(n-1)}& \cdots \\ {\alpha }_{(n-1),(n-2)}& \ddots & \\ & & {\alpha }_{1,2}\\ \cdots & 0& s-{\alpha }_{2,1}\end{array}\right]-\hfill \\ -{\alpha }_{(n-1),n}{\alpha }_{n,(n-1)}det\left[\begin{array}{ccc}s-a_{(n-2),(n-2)}& {\alpha }_{(n-3),(n-2)}& \cdots \\ {\alpha }_{(n-2),(n-3)}& \ddots & \\ & & {\alpha }_{1,2}\\ \cdots & 0& s-{\alpha }_{2,1}\end{array}\right]=\\ \hfill =(s-{\alpha }_{(n-1),n})\left[{\varphi }_{(n-1)}\left(s\right)-{\alpha }_{n,(n-1)}{\psi }_{(n-1)}\left(s\right)\right]-{\alpha }_{(n-1),n}{\alpha }_{n,(n-1)}{\psi }_{(n-1)}\left(s\right)\end{array}$$

where ${\varphi }_{(n-1)}\left(s\right)$ (respectively, ${\psi }_{(n-1)}\left(s\right)$) is the characteristic polynomial of the Laplacian (respectively, grounded Laplacian) of the path graph made of $(n-1)$ nodes once that node n is removed.

The above computation shows that the following iterative relations hold:

$${\varphi }_n\left(s\right)=(s-{\alpha }_{(n-1),n}){\varphi }_{(n-1)}\left(s\right)-s{\alpha }_{n,(n-1)}{\psi }_{(n-1)}\left(s\right)$$

(11)

$${\psi }_n\left(s\right)={\varphi }_{(n-1)}\left(s\right)-{\alpha }_{n,(n-1)}{\psi }_{(n-1)}$$

(12)

Let now $a\left(s\right)=s^n+a_{n-1}{s}^{n-1}+\dots +a_{1}s$ and $b\left(s\right)=s^{n-1}+b_{n-2}{s}^{n-2}+\dots +b_{1}s+b_0$ be two polynomials having $\{0,{\lambda }_2,\dots ,{\lambda }_n\}$ and $\{{\mu }_1,{\mu }_2,\dots ,{\mu }_{n-1}\}$ as zeros, respectively. Forcing ${\varphi }_n\left(s\right)=a\left(s\right)$ and ${\psi }_n\left(s\right)=b\left(s\right)$ into Equations (11) and (12), one has:

$$\left\{\begin{array}{cc}\hfill a\left(s\right)& =(s-{\alpha }_{(n-1),n}){\varphi }_{(n-1)}\left(s\right)-s{\alpha }_{n,(n-1)}{\psi }_{(n-1)}\left(s\right)\hfill \\ \hfill b\left(s\right)& ={\varphi }_{(n-1)}\left(s\right)-{\alpha }_{n,(n-1)}{\psi }_{(n-1)}\left(s\right)\hfill \end{array}\right.$$

(13)

and, exploiting their expanded form, namely ${\varphi }_{(n-1)}\left(s\right)=s^{(n-1)}+{\overline{\varphi }}_{n-2}{s}^{(n-2)}+\dots +{\overline{p}}_{1}s$ and ${\psi }_{(n-1)}\left(s\right)=s^{(n-2)}+{\overline{\psi }}_{n-3}{s}^{(n-3)}+\dots +{\overline{\psi }}_{1}s+{\overline{\psi }}_0$, it is possible to elaborate further (13) as:

$$\begin{array}{cc}\hfill a\left(s\right)& =\begin{array}{cc}\hfill s^n& +({\overline{\varphi }}_{n-2}-{\alpha }_{(n-1),n}-{\alpha }_{n,(n-1)})s^{(n-1)}+({\overline{\varphi }}_{n-3}-{\alpha }_{(n-1),n}{\overline{\varphi }}_{n-2}-{\alpha }_{n,(n-1)}{\overline{\psi }}_{n-3})s^{(n-2)}+\hfill \\ \hfill & +\cdots +({\overline{\varphi }}_1-{\alpha }_{(n-1),n}{\overline{\varphi }}_2-{\alpha }_{n,(n-1)}{\overline{\psi }}_1)s^2+(-{\alpha }_{(n-1),n}{\overline{\varphi }}_1-{\alpha }_{n,(n-1)}{\overline{\psi }}_0)s,\hfill \end{array}\hfill \\ \hfill b\left(s\right)& =\begin{array}{cc}\hfill s^{(n-1)}& +({\overline{\varphi }}_{n-2}-{\alpha }_{n,(n-1)})s^{(n-2)}+({\overline{\varphi }}_{n-3}-{\alpha }_{n,(n-1)}{\overline{\psi }}_{n-3})s^{(n-2)}+\hfill \\ \hfill & +\cdots +({\overline{\varphi }}_1-{\alpha }_{n,(n-1)}{\overline{\psi }}_1)s-{\alpha }_{n,(n-1)}{\overline{\psi }}_0\hfill \end{array}\hfill \end{array}$$

(14)

and to see that it is possible to have the desired polynomials if the weights ${\alpha }_{(n-1),n}$, ${\alpha }_{n,(n-1)}$ and the coefficients ${\overline{\varphi }}_i$${\overline{\psi }}_i$ satisfy:

$$\begin{array}{cc}\hfill {\overline{\varphi }}_{n-2}-{\alpha }_{(n-1),n}-{\alpha }_{n,(n-1)}& =a_{n-1}\hfill \\ \hfill {\overline{\varphi }}_{n-3}-{\alpha }_{(n-1),n}{\overline{\varphi }}_{n-2}-{\alpha }_{n,(n-1)}{\overline{\psi }}_{n-3}& =a_{n-2}\hfill \\ \hfill ⋮& =⋮\hfill \end{array}$$

and

$$\begin{array}{cc}\hfill {\overline{\varphi }}_{n-2}-{\alpha }_{n,(n-1)}& =b_{n-2}\hfill \\ \hfill {\overline{\varphi }}_{n-3}-{\alpha }_{n,(n-1)}{\overline{\psi }}_{n-3}& =b_{n-3}\hfill \\ \hfill ⋮& =⋮\hfill \end{array}$$

Consider now the first two equations. Inserting the second into the first one gives $b_{n-2}-{\alpha }_{(n-1),n}=a_{n-1}$, so that we choose to set:

$${\alpha }_{(n-1),n}=b_{n-2}-a_{n-1}.$$

(15)

Consider now the two equations at the second line. Inserting the second relation into the first one has $b_{n-3}-{\alpha }_{(n-1),n}{\overline{\psi }}_{n-3}=a_{n-2}$, and considering the previous choice of ${\alpha }_{(n-1),n}$ we obtain ${\overline{\varphi }}_{n-2}={\displaystyle \frac{b_{n-3}-a_{n-2}}{b_{n-2}-a_{n-1}}}$ and, proceeding iteratively backwards:

$${\overline{\varphi }}_j={\displaystyle \frac{b_{j-1}-a_j}{b_{n-2}-a_{n-1}}}\mathrm{for}j=1,\dots ,n-2.$$

(16)

Substituting these values into the second column, one obtains:

$${\alpha }_{n,(n-1)}={\displaystyle \frac{b_{n-3}-a_{n-2}}{b_{n-2}-a_{n-1}}}-b_{n-2}$$

(17)

and, in turn, with the above choices, it is possible to compute:

$${\overline{\psi }}_j={\displaystyle \frac{{\overline{\varphi }}_j-b_j}{{\alpha }_{n,(n-1)}}}\mathrm{for}j=0,\dots ,n-3$$

(18)

as functions of the coefficients of $a\left(s\right)$ and $b\left(s\right)$.

The above procedure allows us to compute the edge weights ${\alpha }_{(n-1),n}$ and ${\alpha }_{n,(n-1)}$ together with the two polynomials ${\varphi }_{(n-1)}\left(s\right)$ (respectively, ${\psi }_{(n-1)}\left(s\right)$) of the path graph of $(n-1)$ nodes obtained by removing node n.

Iterating recursively the previous procedure allows computing all coefficients ${\alpha }_{i,j}$, as follows.

First note that Equations (11) and (12) can be written in a general form for a Path Graph with $\mathcal{V}=\{1,\cdots ,j\}$ choosing j as grounded node, namely:

$$\left\{\begin{array}{cc}\hfill {\varphi }_j\left(s\right)=& (s-{\alpha }_{(j-1),j}){\varphi }_{(j-1)}\left(s\right)-s{\alpha }_{j,(j-1)}{\psi }_{(j-1)}\left(s\right)\hfill \\ \hfill {\psi }_j\left(s\right)=& {\varphi }_{(j-1)}\left(s\right)-{\alpha }_{j,(j-1)}{\psi }_{(j-1)}\hfill \end{array}\right.$$

(19)

for $3\le j\le n$ and ${\psi }_2\left(s\right)=s-{\alpha }_{2,1}$, ${\varphi }_2\left(s\right)=s^2-({\alpha }_{1,2}+{\alpha }_{2,1})s$, which extend Equations (11) and (12).

Put the polynomials ${\varphi }_{(n-1)}\left(s\right)$, ${\psi }_{(n-1)}\left(s\right)$ computed in the previous step as reference polynomials into the two Equation (19) for $j=n-1$. This allows to compute ${\alpha }_{(n-2),(n-1)}$ ${\alpha }_{(n-1),(n-2)}$ together with ${\varphi }_{(n-2)}\left(s\right)$ and ${\psi }_{(n-2)}\left(s\right)$. Iterating this logic using (19) backwards until $j=1$ allows effectively to obtain all ${\alpha }_{ij}$, and it can be effectively encapsulated into an algorithm, as Algorithm 1. □

It is worth noting that Algorithm 1 must be iterated a finite number of steps, equal to the eccentricity of the leader node (namely, the length of a longest shortest path starting at the leader node). This makes the proposed algorithm well suited as a preliminary routine to be run before the main application.

4. A Distributed Implementation of Algorithm 1

One key remark for modern engineering and technological applications is that Algorithm 1 is suited to be implemented in a distributed fashion. In such a case, each node can retrieve the weights of its algorithm by processing data received by its neighbor only.

To achieve this goal, the leader should:

• Compute the polynomials $a\left(s\right)$ and $b\left(s\right)$ starting from the desired zeros and set them as reference polynomials.
• Compute:

  $${\alpha }_{(n-1),n}=b_{n-2}-a_{n-1}$$

  to obtain the value of its own weight and the polynomial ${\varphi }^{(n-1)}\left(s\right)=s^{(n-1)}+{\overline{\varphi }}_{n-2}^{(n-1)}{s}^{n-2}+\dots +{\overline{\varphi }}_1^{(n-1)}s$ through the computation of its coefficients:

  $${\overline{\varphi }}_j^{(n-1)}={\displaystyle \frac{b_{j-1}-a_j}{b_{n-2}-a_{n-1}}}\mathrm{for}j=1,\dots ,n-2.$$
• Transmit ${\alpha }_{(n-1),n}$, ${\varphi }^{(n-1)}\left(s\right)$ and $b\left(s\right)$ to node $n-1$.

When node n ends the above elaboration, based on the received data, node $n-1$ can trigger its elaboration as follows:

• Retrieve ${\alpha }_{n,(n-1)}$ and ${\psi }^{(n-1)}\left(s\right)=s^{(n-2)}+{\overline{\psi }}_{n-3}^{(n-1)}{s}^{(n-3)}+\dots +{\overline{\psi }}_1^{(n-1)}s+{\overline{\psi }}_0^{(n-1)}$ by performing the following elaboration:

  $$\begin{array}{cc}\hfill {\alpha }_{n,(n-1)}& ={\overline{\varphi }}_{n-2}^{(n-1)}-b_{n-2}\hfill \\ \hfill {\overline{\psi }}_j^{(n-1)}& ={\displaystyle \frac{{\overline{\varphi }}_j-b_j}{{\alpha }_{n,(n-1)}}}\mathrm{for}j=0,\dots ,n-3.\hfill \end{array}$$

  (20)
• Then:

  $$\begin{array}{cc}\hfill {\alpha }_{(n-2),(n-1)}& ={\overline{\psi }}_{n-3}^{(n-1)}-{\overline{\varphi }}_{n-2}^{(n-1)}\hfill \\ \hfill {\overline{\varphi }}_j^{(n-2)}& ={\displaystyle \frac{{\psi }_{j-1}^{(n-1)}-{\varphi }_j^{(n-1)}}{{\overline{\psi }}_{n-3}^{(n-1)}-{\overline{\varphi }}_{n-2}^{(n-1)}}}\mathrm{for}j=1,\dots ,n-3.\hfill \end{array}$$

  (21)
• Transmit ${\alpha }_{(n-2),(n-1)}$, ${\varphi }^{(n-2)}\left(s\right)=s^{(n-2)}+{\overline{\varphi }}_{n-3}^{(n-2)}{s}^{(n-3)}+\dots +{\overline{\varphi }}_1^{(n-2)}s$ and ${\psi }^{(n-1)}\left(s\right)$ to node $n-2$.

Based on the above elaboration, node $n-1$ is able compute its own weights ${\alpha }_{n,(n-1)}$ and ${\alpha }_{(n-2),(n-1)}$ through an elaboration on the received data only. The above steps can be generalized using (19), and hence, it is possible to organize the algorithm so that it can be executed in a distributed fashion, as follows. Consider a node $\ell =2,\dots ,n-1$; upon receipt of ${\alpha }_{\ell ,\ell +1}$, ${\varphi }^{(\ell )}\left(s\right)$ and ${\psi }^{(\ell +1)}\left(s\right)$ from node $(\ell +1)$, node ℓ should:

• Retrieve ${\alpha }_{(\ell +1),\ell }$ and ${\psi }^{(\ell )}\left(s\right)=s^{(\ell -1)}+{\overline{\psi }}_{\ell -2}^{(\ell )}{s}^{(\ell -2)}+\dots +{\overline{\psi }}_1^{(\ell )}s+{\overline{\psi }}_0^{(\ell )}$ by performing the following elaboration:

  $$\begin{array}{cc}\hfill {\alpha }_{(\ell +1),\ell }& ={\overline{\varphi }}_{\ell -1}^{(\ell )}-{\overline{\psi }}_{\ell -1}^{(\ell +1)}\hfill \\ \hfill {\overline{\psi }}_j^{(\ell )}& ={\displaystyle \frac{{\overline{\varphi }}_j^{(\ell )}-{\overline{\psi }}_j^{(\ell +1)}}{{\alpha }_{(\ell +1),\ell }}}\mathrm{for}j=0,\dots ,\ell -2\hfill \end{array}$$

  (22)
• Then:

  $$\begin{array}{cc}\hfill {\alpha }_{(\ell -1),\ell }& ={\overline{\psi }}_{\ell -2}^{(\ell )}-{\overline{\varphi }}_{\ell -1}^{(\ell )}\hfill \\ \hfill {\overline{\varphi }}_j^{(\ell -1)}& ={\displaystyle \frac{{\overline{\psi }}_{j-1}^{(\ell )}-{\overline{\varphi }}_j^{(\ell )}}{{\overline{\psi }}_{\ell -2}^{(\ell )}-{\overline{\varphi }}_{\ell -1}^{(\ell )}}}\mathrm{for}j=1,\dots ,n-3.\hfill \end{array}$$

  (23)
• Transmit ${\alpha }_{(\ell -1),\ell }$, ${\varphi }^{(\ell -1)}\left(s\right)=s^{\ell -1}+{\overline{\varphi }}_{\ell -2}^{(\ell -1)}{s}^{\ell -2}+\dots +{\overline{\varphi }}_1^{(\ell -1)}s$ and ${\psi }^{\ell }\left(s\right)$ to node $\ell -1$.

The above procedure allows each node ℓ to compute its own gains ${\alpha }_{(\ell +1),\ell }$, ${\alpha }_{(\ell -1),\ell }$ through an elaboration of local information only (namely, data received from its neighbor). The technical requirement to achieve this is that each node j should be able to send two vectors encoding the coefficients of the two polynomials ${\varphi }^{(j-1)}\left(s\right)$, ${\psi }^{\left(j\right)}\left(s\right)$.

The architecture of the distributed implementation of Algorithm 1 is depicted in Figure 1. Finally, it is worth remarking that the algorithm has finite time execution equal to n time steps so that it can be run as a preliminary routine before other operations in applications.

5. A Final Remark on the Solution of Algorithm 1

In this section, we discuss the sign of the weights obtained as solutions of Algorithm 1, and it is revealed that the condition ${\alpha }_{i,j}\ge 0$ is a consequence of the relative location of ${\lambda }_i$, ${\mu }_i$ in the complex plane. In other words, if the interlacing property is set for ${\lambda }_i$, ${\mu }_i$ beforehand, then the solution of Algorithm 1 always has the property ${\alpha }_{i,j}\ge 0$.

Theorem 2. 

Let $\varphi \left(s\right)=s^n+{\varphi }_{n-1}{s}^{n-1}+{\varphi }_{n-2}{s}^{n-2}+\dots {\varphi }_{1}s$ and $\psi \left(s\right)=s^{n-1}+{\psi }_{n-2}{s}^{n-2}+\dots {\psi }_{1}s+{\psi }_0$ be two polynomials satisfying the Problem Statement (Section 2.3). Then, Algorithm 1 always provides positive weights ${\alpha }_{i,j}\in {\mathbb{R}}_{+}$ satisfying $det[sI-L_w]=\varphi \left(s\right)$ and $det[sI-L_w^{\left(1\right)}]=\psi \left(s\right)$.

Proof. 

Algorithm 1 provides ${\alpha }_{i,j}$ by solving recursively Equation (13), so we prove the statement by showing that, if $a\left(s\right)$ and $b\left(s\right)$ satisfy the interlacing property, then the solutions of Equation (13) are positive weights ${\alpha }_{(n-1,)n}$ ${\alpha }_{n,(n-1)}$ and a pair of polynomials ${\varphi }_{(n-1)}\left(s\right)$, ${\psi }_{(n-1)}\left(s\right)$, which in turn satisfy the interlacing property between themselves. This allows to trigger a recursive logic, which proves that all ${\alpha }_{i,j}$ are positive.

From Equation (13), it is possible to obtain $a\left(s\right)-sb\left(s\right)=-{\alpha }_{(n-1),n}{\varphi }_{(n-1)}\left(s\right)$ so that ${\alpha }_{n-1,n}=a_{n-1}-b_{n-2}$ and, considering that $a_{n-1}=-{\sum }_{i=1}^{n-1}{\lambda }_i$ and analogously for $b_{n-2}$, we obtain ${\sum }_{i=1}^n{\lambda }_i-{\sum }_{i=1}^{n-1}{\mu }_i={\sum }_{i=1}^{n-1}{\lambda }_{i+1}-{\mu }_i$, which is positive under the strict interlacing condition between $\left\{{\lambda }_i\right\}$ and ${\mu }_i$ provided by the Problem Statement. Consider now $\widehat{\varphi }\left(s\right)={\displaystyle \frac{a\left(s\right)-sb\left(s\right)}{-{\alpha }_{(n-1),n}s}}$, which is a monic polynomial of degree $n-1$. Computing $\widehat{\varphi }\left(s\right)$ at several points $s={\lambda }_i$ and $s={\mu }_i$, one has: $\widehat{\varphi }\left({\lambda }_n\right)=\frac{b\left({\lambda }_n\right)}{{\alpha }_{(n-1),n}}=\frac{{\prod }_{i=1}^{n-1}({\lambda }_n-{\mu }_i)}{{\alpha }_{(n-1),n}}>0$ because $({\lambda }_n-{\mu }_i)>0$ and ${\alpha }_{(n-1),n}>0$ under (13), and $\widehat{\varphi }\left({\mu }_{n-1}\right)=\frac{a\left({\mu }_{n-1}\right)}{-{\alpha }_{(n-1),n}}=\frac{{\prod }_{i=2}^n({\mu }_{n-1}-{\lambda }_i)}{-{\alpha }_{(n-1),n}}>0$, $\widehat{\varphi }\left({\lambda }_{n-1}\right)=\frac{b\left({\lambda }_{n-1}\right)}{{\alpha }_{(n-1),n}}=\frac{{\prod }_{i=1}^{n-1}({\lambda }_{n-1}-{\mu }_i)}{{\alpha }_{(n-1),n}}<0$, and $\widehat{\varphi }\left({\mu }_{n-1}\right)=\frac{a\left({\mu }_{n-1}\right)}{-{\alpha }_{(n-1),n}}=\frac{{\prod }_{i=2}^n({\mu }_{n-1}-{\lambda }_i)}{-{\alpha }_{(n-1),n}}<0$, so that, if ${\nu }_{n-1}$ denotes the largest zero of $\widehat{\varphi }\left(s\right)$, then ${\nu }_{n-1}\in ({\lambda }_{n-1},{\mu }_{n-1})$. If ${\nu }_i$ contains any zero of $\widehat{\varphi }\left(s\right)$, the computation of $\widehat{\varphi }\left({\lambda }_i\right)$ and $\widehat{\varphi }\left({\mu }_i\right)$ backwards (iterating the above reasonings from $i-2$ to 0) allows to obtain ${\nu }_i\in ({\lambda }_i,{\mu }_i)$.

Consider now the second of Equation (13), which can be written as $b\left(s\right)-{\varphi }_{n-1}\left(s\right)=-{\alpha }_{n,n-1}{\psi }_{n-1}\left(s\right)$ and the zeros of $b\left(s\right)$, ${\varphi }_{n-1}\left(s\right)$ satisfy $0<{\nu }_1<{\mu }_1<\cdots <{\nu }_{n-1}<{\mu }_{n-1}$. For the same reasons as before, ${\alpha }_{n,n-1}={\sum }_{i=1}^{n-1}({\mu }_i-{\nu }_i)>0$. Building the polynomial $\widehat{\psi }\left(s\right)={\displaystyle \frac{b\left(s\right)-{\varphi }_{n-1}\left(s\right)}{-{\alpha }_{n,(n-1)}}}$ and defining ${\upsilon }_i$ as the zeros of $\widehat{\psi }\left(s\right)$, it is possible to prove analogously that $0<{\upsilon }_1<{\nu }_1<\cdots <{\upsilon }_{n-2}<{\nu }_{n-1}$. □

6. An Illustrative Example

In this section, we provide an illustrative example on the distributed implementation of the Algorithm on a network of six nodes.

Consider that a leaf of a path graph of six nodes starts the algorithm setting $a\left(s\right)=s(s-2)(s-4)(s-6)(s-8)(s-10)=s^6-30s^5+340s^4-1800s^3+4384s^2-3840s$ and $b\left(s\right)=(s-1)(s-3)(s-5)(s-7)(s-9)=s^5-25s^4+230s^3-950s^2+1689s-945$.

According to Section 4, it computes ${\alpha }_{56}=b_5-a_4=5$ and ${\varphi }^{\left(5\right)}\left(s\right)=s^5-22s^4+170s^3-539s^2+579s$. Finally, it sends ${\alpha }_{56}$, ${\varphi }^{\left(5\right)}\left(s\right)$ and $b\left(s\right)$.

Once that node 5 receives its data, it computes: ${\alpha }_{65}=3$, ${\psi }^{\left(5\right)}\left(s\right)=s^4-20s^3+137s^2-370s+315$, and then, ${\alpha }_{45}=2$, ${\varphi }^{\left(4\right)}\left(s\right)=s^4-16.5s^4+84.5s^2-132s$. It sends ${\alpha }_{45}$, ${\varphi }^{\left(4\right)}\left(s\right)$ and ${\psi }^{\left(5\right)}\left(s\right)$ to node 4.

The Algorithm prosecutes at node 4 with the values ${\alpha }_{54}=3.5$, ${\psi }^{\left(4\right)}\left(s\right)=s^3-15s^3+68s^2-90$, and then, ${\alpha }_{34}=1.5$, ${\varphi }^{\left(3\right)}\left(s\right)=s^3-11s^2+28s$. It sends data to node 3, which computes ${\alpha }_{43}=4$, ${\psi }^{\left(3\right)}\left(s\right)=s^2-10s+22.5$, and then, ${\alpha }_{23}=1$, ${\varphi }^{\left(2\right)}\left(s\right)=s^2-5.5s$, and sends data to node 2, which in turn computes ${\alpha }_{32}=4.5$, ${\psi }^{\left(2\right)}\left(s\right)=s-5.5$, and then, ${\alpha }_{12}=5$.

The resulting Laplacian matrix is as follows:

$$\mathcal{L}=\left(\begin{array}{cccccc}5& -5& 0& 0& 0& 0\\ -0.5& 5& -4.5& 0& 0& 0\\ 0& -1& 5& 4& 0& 0\\ 0& 0& -1.5& 5& -3.5& 0\\ 0& 0& 0& -2& 5& -3\\ 0& 0& 0& 0& -5& 5\end{array}\right).$$

7. Conclusions

This paper proposes an algorithm for the assignment of the Laplacian eigenvalues by a suitable choice of edge gains. An iterative algorithm is derived first, after which a distributed implementation is sought, and its usefulness is also shown using an illustrative example. Several research directions are currently under investigation, which includes more complex kinematics models, such as [51], as well as the analysis of several different graph topologies [1].