In this paper
AbstractINTRODUCTIONPRELIMINARIESMatrix AlgebraGraph TheoryProblem FormulationMain ResultsAnalysis of Complex-valued Pseudoinverse LaplaciansCONCLUSIONS AND FUTURE WORKReferencesWorksEngineering
On Real Eventual Exponential Positive property of complex-valued Laplacians and their pseudoinverses
Abstract
The property of real eventual exponential positivity guarantees the state trajectories of a linear time-invariant system to evolve asymptotically to right half of the complex-plane [1]. It has applications in the characterization of herdability and reachability of states in networked systems. Networks with complex-valued edge-weights arise in AC power systems and opinion dynamics. Recent work has introduced real eventual exponential positive (rEEP) Laplacians, for which the trajectories of the associated network flow eventually converge to consensus. We establish further properties of rEEP Laplacians and their pseudoinverses. Firstly, we show that the rEEP property for complex-valued matrices exhibits invariance under specific rotational transformations. Secondly, we establish that the property of rEEP is preserved under the MoorePenrose pseudoinverse operation, highlighting its robustness under algebraic manipulations. These results apply to effective impedance computation in AC networks and to consensus in multi-agent systems. Finally, we provide numerical examples to validate our theoretical results.
INTRODUCTION
Complex-valued networks, whose edge weights are complex numbers, arise in quantum physics, electromagnetics, power and societal systems [2]. Although complex-valued Laplacians have appeared in formation control and spectral graph theory [3], [4], dynamics of such networks remain far less understood than their real-valued counterparts [5], [6]. The main obstacle is largely structural. For Hermitian weights, the familiar tools of real symmetric matrices largely survive. For complex symmetric or edge asymmetric weights, which arise in AC power networks and recently in opinion dynamics [7], these tools no longer apply: eigenvalues are complex, positive semi-definiteness is undefined, and the Perron–Frobenius (PF hereafter) theorem no longer applies.
Eventual positivity [8] has proven useful for signed real networks, where it recovers PF-type conclusions without nonnegative weights [9], [10]. Recent literature has pushed this idea to networks with complex-valued edge weights [1], [11]–[13]. Building on these PF-type arguments [14], these papers introduced rEEP Laplacians, for which the real parts of steady-state trajectories eventually become positive. Interestingly, [12] studied the dynamics and applications of the associated pseudoinverse flows, and analyzed them on undirected and weight-balanced digraphs.
We compute the Moore-Penrose pseudoinverse of the Laplacian matrix to obtain the pseudoinverse Laplacian. Building upon our previous work [1], we extend the notion of EEP from real-valued systems to complex-valued systems. To the best of our knowledge, we are the first to answer the following question for complex-valued networks: When does the trajectory from an initial point become (entrywise) real positive and remain real positive for all time thereafter in a linear system? Below, we summarize our key contributions:
We establish that the property of rEEP is invariant under certain global rotations of Laplacian matrices under some mathematical conditions. Equivalently, if all the complex-valued edge-weights are rotated by a given angle, then the resulting Laplacian matrix still satisfies the property of rEEP. Further, we show that rEEP can be characterized through real dominant eigenvectors only.
We derive the necessary and sufficient conditions to prove that the property of rEEP is closed under the operation of pseudoinverse in complex-valued digraphs. We use complex PF theory to establish the conditions for the rEEP property of the matrices.
Related Literature: In [9], [10], the authors show the inter-relation between the property of EEP and the spectrum of Laplacian matrices for signed networks with real edge-weights. Recently, researchers have started exploring complex-valued Laplacians; the authors provide necessary and sufficient conditions for the Laplacian matrix to be singular, based on the topology of graphs in [3]. Further, we introduce the rEEP property of complex-valued Laplacians in [15] and show that this property ensures consensus in complex-valued digraphs [1]. The pseudoinverse Laplacian flow systems for complex-valued networks are introduced in [12] for undirected and weight-balanced digraphs. Moreover, the notions of structural balance and anti-balance for Hermitian matrices are proposed in [16].
Our existing works introduced the rEEP property and established its role in studying consensus in Laplacian flows. In contrast, the present work investigates the implications of rEEP property in the pseudoinverse Laplacian flows beyond the class of undirected and weight-balanced digraphs. Additionally, the invariance of this property under rotations of complex-valued Laplacian matrix and the possible rotations in eigenvectors are discussed here; unlike the previous works.
PRELIMINARIES
Let denote the space of complex-valued matrices. For , the space is . Let and denote the real and imaginary parts of , respectively. The imaginary unit . The right half of the complex- and real-planes are and , respectively, where the open right half of complex plane is denoted as ORHP. and are all ones and zeros vectors.
Matrix Algebra
A matrix is real positive if for all the entries (hereafter ). A matrix is real eventually positive (rEP hereafter) if for some . The complex conjugate transpose and transpose of matrix are and , resp. The pseudoinverse of is denoted by . The spectrum of is , where is the eigenvalue of . An eigenvalue having the largest magnitude is the dominant eigenvalue and is denoted by . The corresponding eigenvectors are referred as dominant eigenvectors [14]. The right and left dominant eigenvectors are denoted by and , respectively. The possible angle of rotation for the dominant eigenvector is represented as .
Now, we cull some important results, which play a crucial role in our analysis. More details are provided in [1], [14].
Definition 1. (Strong Complex PF Property [14]) A matrix has the strong complex Perron-Frobenius property if its dominant eigenvalue is positive and simple with for all . The right eigenvector associated with is such that .
Definition 2. (**Real Eventually Exponentially Positive matrix (rEEP) [15]) A matrix is rEEP if there exists an exponential index such that for all .
Definition 3. (**Moore-Penrose pseudoinverse [17]) The Moore-Penrose pseudoinverse of satisfies [17]: (i) , (ii) , (iii) and are self-adjoint.
Lemma 1. (**Marginal Stability of [1]) Consider a strongly connected digraph and for . Let
, and be the right and left eigenvectors associated with the zero eigenvalue of , respectively. Suppose the phase angles, and lie in . Then, the following statements are equivalent:
(i) is rEEP.
(ii) is marginally stable of corank 1.
Lemma 1 relates the rEEP property with the marginal stability of the complex-valued Laplacian matrix. This lemma is instrumental to the analysis of pseudoinverse flows.
Graph Theory
Let , where be the network or graph of interest and are the sets of vertices and edges respectively. The phase angles and are associated to the directed edges from nodes ‘’ to ‘’ and ‘th’ components of the eigenvector. The adjacency matrix is . In a strongly connected directed graph (digraph) there exists a directed path between any pair of vertices. In digraphs, out-degree of a vertex is the sum of edge-weights of all the outgoing edges, whereas in-degree is the sum of edge-weights of incoming edges. Collectively for all nodes, the degree matrices are given by and [18]. The Laplacian matrix is defined as .
We make use of polar as well as rectangular form representation of the complex number. Thus for , with non-zero , we let , where is the magnitude and (measured in degrees) is the phase angle. The angles of edge-weights may represent social interactions among agents [7].
Problem Formulation
Consider a with nodes with complex-valued edge-weights. Let be the state vector and consider the (generalized) Laplacian flow system
where . We consider the cases where and .
We are interested in studying the relation between the spectrum of the Laplacians and the pseudoinverse Laplacians. Specifically, we establish that rEEP Laplacians imply rEEP pseudoinverse Laplacians. Also, this property remains unchanged when all the edge-weights are rotated by an angle under some mathematical conditions. These results hold for a class of complex-valued networks, which are characterized by real dominant eigenvectors. Real dominant complex-valued networks arise in settings like phase-dependent interactions, distributed coordination, power system synchronization, and wireless communication. We use complex PF theory (see Def.1) to derive our results.
Main Results
We begin by establishing relationships between the Perron-Frobenius property in Def.1 and the proposed notion of rEEP in Def.2. Our approach relies on the spectral decomposition of complex matrices and is inspired by [14]. These relationships serve as a starting point for analyzing reachability in complex-valued networks. The rEEP matrices have significant applications in control theory to study reachability1 and holdability2 of .
Let the eigenvalues of be arranged as and consider the set of matrices:
In the class of matrices belonging to , we know that they have a simple dominant eigenvalue . These matrices are relevant in studying the stability of complex-valued linear systems. Specifically, PF matrices are used in power system small-signal stability analysis, consensus, and synchronization in multi-agent networks. However, the PF property of complex-valued matrices alone does not guarantee the steady-state behaviors, because of the complex-valued entries in the dominant eigenvectors. To address this gap, the existing literature has used an additional property of real dominance for dominant eigenvectors [1, 14].
The real dominance property plays a significant role in the analysis of complex-valued matrices. It requires the real part of each dominant eigenvector component to have a greater magnitude than its corresponding imaginary part. The dominant eigenvectors of a complex-valued matrix may or may not satisfy this property. However, owing to the rotations inherent in complex-valued eigenvectors, the components can be suitably rotated to satisfy real dominance. Thus, we consider an angle of rotation ‘’ to account for the rotation by which we rotate the components of eigenvector satisfy real dominance. Nevertheless, such an angle of rotation does not always exist for certain matrices. We provide an example below where the angle of rotation does not exist, and hence we cannot rotate the left dominant eigenvectors so that all their components lie in the permissible region.
Example 1. Consider a matrix where,
The eigenvalues of matrix, are . The dominant right eigenvector is real-valued, whereas the normalized left eigenvector is, , and the left eigenvector is . Both the left eigenvectors do not have the property of real dominance when we geometrically imagine each element of and as a vector in the complex plane. Then, none of these vectors lie in the region . Also, there does not exist a possible angle of rotation since and .
The eigenvectors of complex matrices allow for a degree of rotation, resulting in a broader set of matrices. However, the existence of a rotation angle that ensures real dominance is not always guaranteed. The following lemma addresses this gap and ensures the existence of an angle of rotation.
Lemma 2. Consider a vector ‘’ with its components in polar form. Let and be the smallest and largest phase angles of all the components. Then, there does not exist an angle ‘’ such that lies in the region formed by if radians.
Using Lemma 2, we conclude that if the components of dominant eigenvector of lie away from each other, then it is not possible to rotate them so that all the components remain in the desired region. Consequently, it cannot be guaranteed that the matrix exhibits rEEP.
The next result discusses the significance of real dominance for establishing rEEP matrices.
Theorem 1. Let . Suppose the normalized dominant right and left eigenvectors and satisfy and . If and , then for all for some value of and .
Proof. We have and . Consider the case where the magnitude of real part of all the components of unnormalized left eigenvector is greater than or equal to its imaginary part. We consider two cases.
Case (i): Analysis under the condition
The Jordan decomposition of a matrix is given as , where is the Jordan matrix consisting of all the eigenvalues. Let be the dominant eigenvalue in the square matrix . Then, is partitioned as:
where and are the right and left dominant eigenvectors of , normalized such that . Since and , this implies and from (2). As per hypothesis and ,
where and .
We have where , as both and are dominant left eigenvectors of . Then, has positive real part as and holds with the strong complex PF property. For some , the following holds by substituting :
Thus, due to the assumption on the eigenvector , we conclude which in turn ensures . Case (ii): Analysis under the condition:
Since the real parts of the components of vector are less than their imaginary counterparts, we choose a real such that holds. Therefore, gives , where the angle is the phase difference between both the left eigenvectors. From (4),
Substituting , we get
where contains values of the angles of rotation by which we may rotate the unnormalized left eigenvector such that follows.
Finally,
From (6), we conclude that the real part of is eventually positive as the magnitude of real part of rotated left eigenvector is greater than the magnitude of imaginary part in the eigenvectors. □
Theorem 1 shows that real dominance is a property of the chosen eigenvector, not of the eigenspace. A dominant left eigenvector of a complex matrix is determined only up to a factor, so even if fails real dominance, the rotated eigenvector may satisfy it [14]. So, a complex matrix that is not eventually positive may become so after a suitable rotation. For real matrices, and for complex matrices with real dominant eigenvectors, the only freedom is a sign, so no such rotation exists.
The next result provides equivalent conditions to characterize rEEP matrices and clarifies their relationship with the class of PF matrices.
Theorem 2. Let . Assume and , where are the normalized dominant right and left eigenvectors of , respectively. Then, the following statements are equivalent for some scalar :
(i) and .
(ii) is real eventually positive for all .
(iii) is rEEP.
Proof. (i) (ii): The Jordan decomposition of a matrix is given as , where is the Jordan matrix consisting of all the eigenvalues. Let be the dominant eigenvalue in the square matrix . Then, is partitioned as:
where and are the right and left dominant eigenvectors of , normalised such that . Since and , this implies and from (2). Because and ,
where and . Thus, by taking the limit on the either sides of (7) and solving yields,
Considering the real part, we have
From (8) and the definition of rEP matrices, we conclude that is rEP.
(ii) (i): Assume that and define . The scalar can be chosen such that is a non-nilpotent matrix [14]. Thus, it follows that which can be proved on the same lines as in Theorem 2.3, [14].
(ii) (iii): We have . Since,
At a large time instant , the higher order terms dominate and hence the whole summation becomes real positive as is rEP. On the other hand, , where . For all , the in (9) dominate the sum of the terms until and including . Note that is depends on . Hence, is rEEP, as the whole summation is positive. Also, inherits the property of rEEP from . This follows directly from the fact that can be expressed as where is positive. Hence, is rEEP.
(iii) (ii): Refer to Theorem 3, [1]. □
Theorem 2 states that a matrix is rEEP if the translated matrix follows the strong complex PF property. This analysis directly extends to Laplacian matrices. Consequently, for any Laplacian matrix satisfying the rEEP property, the matrix, satisfies the strong complex PF property. The example below considers a translated Laplacian matrix and illustrates the possible rotation in dominant eigenvectors, discussed in previous results:
Example 2. Consider
For this matrix, is the dominant eigenvalue with a complex-valued dominant right eigenvector. But the dominant left eigenvector , and $\angle(z^{H})=[0^\circ 53.1° − 53.1°. Geometrically, none of these vectors lie in the region [−45°, 45°]. Thus, the assumption that is violated. However, assume . Then, , and again resorting to the geometric intuition, we note that follows the property of real dominance.
Analysis of Complex-valued Pseudoinverse Laplacians
The rEEP property ensures consensus in complex-valued Laplacian flows [1]. In contrast, the rEEP property in the case of pseudoinverse Laplacian flows implies consensus solely for undirected and weight-balanced digraphs [12]. Hence, the spectral properties and the steady-state behavior of pseudoinverse Laplacian flows in non-weight-balanced digraphs remain unexplored. We now address this gap. We examine the eigenspace corresponding to the zero eigenvalue of the Laplacian under the pseudoinverse operation. This analysis subsequently helps us to comment on the convergence properties of pseudoinverse Laplacian flows.
Lemma 3. The set of eigenvectors corresponding to the zero eigenvalue of the Laplacian matrix remains same as of the pseudoinverse Laplacian matrix.
Proof. For non weight-balanced digraphs, we have and . Further, from Def.3,
Using (10), ,
Similarly using (11), .
The following result states the relation between the Laplacian and pseudoinverse Laplacian matrices using Lemma 3.
Theorem 3. Consider a strongly connected digraph and for . Let and be the right and left eigenvectors associated with the zero eigenvalue of , respectively. Suppose the phase angles, and lie in . Then, the following statements are equivalent:
is rEEP.
is marginally stable.
is rEEP.
Proof. (i) (ii): From Lemma 1, if is rEEP, then it is equivalently marginal stable. Hence, . Then, we have the spectrum of given in (12),
where are the eigenvalues of [19]. Hence, is marginally stable.
(ii) (iii): From the previous proof, is marginally stable. Using Jordan canonical form and substituting ,
where is the diagonal matrix containing eigenvalues (except 0) of . Then,
(13) holds for all the cases of degenerate and non-degenerate eigenvalues as the exponential decay is faster than the growth of the corresponding polynomial. In case of , the eigenvectors corresponding to zero eigenvalue remain same. Hence, is rEEP.
(iii) (ii): This can be proved on the same lines as in the proof of Theorem 3 of [1]. □
An example is provided to validate the previous result.
Example 3. Consider and , whose real parts are shown in Figure 1 via heatmaps.

Figure 1. Heatmaps showing the matrix structure of and for real and imaginary parts respectively
The following remarks are in order for the Laplacians, pseudoinverse Laplacians, and real parts of exponential maps shown in Figure 2a and Figure 2b, respectively. First, notice that the real parts vary from positive to negative values for the Laplacian as well as the pseudoinverse Laplacian. Since the spectrum of the Laplacian matrix has a simple zero eigenvalue, the negated Laplacian matrix as well as the negated pseudoinverse Laplacian is rEEP. Thus, it is evident from Figure 2 that the rEEP property is preserved under the operation of pseudoinverse for Laplacian matrices, as proved in Theorem 3. In contrast to the results in [12], the pseudoinverse Laplacian flows do not converge in the case of non-weight-balanced digraphs. It happens so because from Theorem 3, we conclude that the property of rEEP is conserved under the pseudoinverse operation. But referring as the solution of pseudoinverse Laplacian flow given by :
Figure 2. The matrix structure of and at and respectively. Values on the colorbar represent the entire range that encompasses all the values of a matrix, and all of these values are positive implying rEEP property.
where is constant .
Next, we demonstrate that the eigenspace, along with the zero eigenvalue remains same when we rotate all the elements of the Laplacian matrix with some angle of rotation, . In particular, a global phase rotation of the Laplacian matrix rotates its non-zero spectrum but leaves the zero eigenvalue and the eigenspace completely invariant.
Corollary 1. The set of eigenvectors corresponding to the zero eigenvalue of remains invariant under rotation of the Laplacian matrix; i.e., if all the elements of the matrix are rotated by a rotation angle of .
Proof. Let be a complex-valued Laplacian matrix. And be the rotated Laplacian with an angle and . Let such that . It then follows that
Hence is the eigenvector corresponding to the zero eigenvalue of . Conversely, because , implies . Thus . In other words, eigenspaces corresponding to the rotated and actual Laplacians coincide. Similar argument holds for left eigenspaces corresponding to the zero eigenvalue as well.
Corollary 1 implies that the rEEP property is also preserved under a uniform rotation. This is because the rEEP property depends only on the eigenvectors corresponding to the zero eigenvalue of the complex-valued Laplacian.
Remark 1. The property of rEEP is not always invariant under the global phase rotation. This is because of the change in the non-zero eigenvalues in the spectrum. While the zero eigenvalue and its eigenspace remain unchanged, the non-zero eigenvalues are rotated by the angle, , which can shift them in the left half of the s-plane. Thus, the rEEP property is preserved only if the non-zero eigenvalues of the negated Laplacian remain in the right half of the complex plane after rotation. Hence, the property of rEEP depends on the full spectrum and does not guarantee consensus in all cases.
CONCLUSIONS AND FUTURE WORK
We extend real eventual exponential positivity (rEEP) to pseudoinverses of complex-valued Laplacians on digraphs. We show that rEEP is preserved under the pseudoinverse, and that it is determined entirely by the relative phases of the edge-weights. We also show that the null space of the Laplacian is invariant under a uniform rotation of the edge-weights. Altogether, these results provide a foundation for further analysis of consensus and stability in complex-valued networked systems. Our future studies will include deriving the conditions to achieve rEEP Laplacians, without imposing the real dominance on the eigenvectors corresponding to the zero eigenvalue of complex-valued Laplacians.
References
- [1]Aditi Saxena, Twinkle Tripathy, and Rajasekhar Anguluri. Laplacian flows in complex-valued directed networks: Analysis, design, and consensus. arXiv preprint arXiv:2509.04196, 2025.arxiv.org/abs/2509.04196
- [2]Lucas Böttcher and Mason A Porter. Complex networks with complex weights. Physical Review E, 109(2):024314, 2024.DOI
- [3]Jiu-Gang Dong and Qin Lin. Laplacian matrices of general complex weighted directed graphs. Linear Algebra and its Applications, 510:1–9, 2016.DOI
- [4]Jiu-Gang Dong and Li Qiu. Complex Laplacians and applications in multi-agent systems. arXiv preprint arXiv:1406.1862, 2014.DOI
- [5]Florian Dorfler and Francesco Bullo. Synchronization and transient stability in power networks and nonuniform Kuramoto oscillators. SIAM Journal on Control and Optimization, 50(3):1616–1642, 2012.
- [6]Reza Olfati-Saber, J Alex Fax, and Richard M Murray. Consensus and cooperation in networked multi-agent systems. Proceedings of the IEEE, 95(1):215–233, 2007.
- [7]Aditi Saxena and Twinkle Tripathy. How do emotions spread and affect decision-making in social networks? an opinion dynamics perspective. arXiv preprint arXiv:2610.22334, 2026.arxiv.org/abs/2610.22334
- [8]Angela Fontan, Lingfei Wang, Yiguang Hong, Guodong Shi, and Claudio Altafini. Multiagent consensus over time-invariant and time-varying signed digraphs via eventual positivity. IEEE Transactions on Automatic Control, 68(9):5429–5444, 2022.DOI
- [9]Claudio Altafini. Investigating stability of Laplacians on signed digraphs via eventual positivity. In 2019 IEEE 58th Conference on Decision and Control (CDC), pages 5044–5049. IEEE, 2019.DOI
- [10]Angela Fontan and Claudio Altafini. On the properties of Laplacian pseudoinverses. In 2021 60th IEEE Conference on Decision and Control (CDC), pages 5538–5543. IEEE, 2021.arxiv.org/abs/2109.14587
- [11]Zhiyun Lin, Wei Ding, Gangfeng Yan, Changbin Yu, and Alessandro Giua. Leader–follower formation via complex Laplacian. Automatica, 49(6):1900–1906, 2013.DOI
- [12]Aditi Saxena, Twinkle Tripathy, and Rajasekhar Anguluri. Are the flows of complex-valued laplacians and their pseudoinverses related? In 2025 European Control Conference (ECC), pages 653–658, 2025.arxiv.org/abs/2411.09254
- [13]Yu Tian, Mason A Porter, and Lucas Böttcher. Generalizing perron–frobenius theory and eigenvector-based centralities to networks with complex edge weights. arXiv preprint arXiv:2606.12026, 2026.arxiv.org/abs/2606.12026
- [14]Dimitrios Noutsos and Richard S Varga. On the Perron–Frobenius theory for complex matrices. Linear algebra and its applications, 437(4):1071–1088, 2012.DOI
- [15]Aditi Saxena, Twinkle Tripathy, and Rajasekhar Anguluri. Real eventual exponential positivity of complex-valued laplacians: Applications to consensus in multi-agent systems. In 2024 Tenth Indian Control Conference (ICC), pages 226–231, 2024.arxiv.org/abs/2410.13700
- [16]Yu Tian and Renaud Lambiotte. Structural balance and random walks on complex networks with complex weights. SIAM Journal on Mathematics of Data Science, 6(2):372–399, 2024.arxiv.org/abs/2307.01813
- [17]João Barata, Carlos Alves, and Mahir Saleh Hussein. The Moore–Penrose pseudoinverse: A tutorial review of the theory. Brazilian Journal of Physics, 42:146–165, 2012.DOI
- [18]Francesco Bullo. Lectures on network systems, volume 1. CreateSpace, 2018.
- [19]Angela Fontan and Claudio Altafini. Pseudoinverses of signed Laplacian matrices. SIAM Journal on Matrix Analysis and Applications, 44(2):622–647, 2023.DOI
