This paper presents a general methodology to calculate the resiliency of complex engineered systems based on complex network theory. Graph spectral theory has been used simultaneously with complex network theory for years. Resiliency is a key driver in how systems are developed to operate in an expected operating environment, and how systems change and respond to the environments in which they ...

We prove a Matrix-Tree Theorem enumerating the spanning trees of a cell complex in terms of the eigenvalues of its cellular Laplacian operators, generalizing a previous result for simplicial complexes. As an application, we obtain explicit formulas for spanning tree enumerators and Laplacian eigenvalues of cubes; the latter are integers. We prove a weighted version of the eigenvalue formula, pr...

one of the main goals of interpretation of gravity data is to detect location and edges of the anomalies. edge detection of gravity anomalies is carried out by different methods. terracing of the data is one of the approaches that help the interpreter to achieve appropriate results of edge detection. this goal becomes a complex task when the gravity anomalies have smooth borders due to gradual ...

We calculate the complex phase of chiral determinant by the vacuum overlap formula with configurations of two-dimensional U(1) gauge field fixed in Landau and Laplacian gauge. The complex phase fluctuates over the Gribov copies, which appear in the process of Landau gauge fixing and contain vortex-like singularities. In the Laplacian gauge, the fluctuation can be reduced and the phase can be de...

In this paper, we study synchronization of complex random networks of nonlinear oscillators, with specifiable expected degree distribution. We review a sufficient condition for synchronization and a sufficient condition for desynchronization, expressed in terms of the eigenvalue distribution of the Laplacian of the graph and the coupling strength. We then provide a general way to approximate th...

Abstract. We generalize the definition and enumeration of spanning trees from the setting of graphs to that of arbitrary-dimensional simplicial complexes ∆, extending an idea due to G. Kalai. We prove a simplicial version of the Matrix-Tree Theorem that counts simplicial spanning trees, weighted by the squares of the orders of their top-dimensional integral homology groups, in terms of the Lapl...

We calculate the complex phase of chiral determinant by the vacuum overlap formula with configurations of two-dimensional U(1) gauge field fixed in Landau and Laplacian gauge. The complex phase fluctuates over the Gribov copies, which appear in the process of Landau gauge fixing and contain vortex-like singularities. In the Laplacian gauge, the fluctuation can be reduced and the phase can be de...

Abstract. Simplicial complexes represent useful and accurate models of complex networks and complex systems in general. We explore the properties of spectra of combinatorial Laplacian operator of simplicial complexes and show its relationship with connectivity properties of the Q-vector and with connectivities of cliques in the simplicial clique complex. We demonstrate the need for higher order...

let $a = (a_{i,j})_{1 leq i,j leq n}$ be an $n times n$ matrixwhere $n geq 2$. let $dt(a)$, its second immanant be the immanant corresponding to the partition $lambda_2 = 2,1^{n-2}$. let $g$ be a connected graph with blocks $b_1, b_2, ldots b_p$ and with$q$-exponential distance matrix $ed_g$. we given an explicitformula for $dt(ed_g)$ which shows that $dt(ed_g)$ is independent of the manner in ...