We construct an efficient emulator for two-body scattering observables using the general (complex) Kohn variational principle and trial wave functions derived from eigenvector continuation. The simultaneously evaluates array of principles associated with different boundary conditions, which allows detection removal spurious singularities known as anomalies. When applied to K-matrix only, our re...

Eigenvectors, and the related centrality measure Bonacich’s c(β), have advantages over graph-theoretic measures like degree, betweenness, and closeness centrality: they can be used in signed and valued graphs and the beta parameter in c(β) permits the calculation of power measures for a wider variety of types of exchange. Degree, betweenness, and closeness centralities are defined only for clas...

Linear state constraints define a polyhedron in the state space of a dynamical system. If this polyhedron can be made positively invariant by state feedback, the constraints are satisfied all along the trajectory for any initial point in this polyhedron. In this paper, some algebraic invariance relations are established for continuous-time linear systems. The existence of a solution to the corr...

We present a new technique for visually comparing placement results through component coloring using partitioning and the Fiedler eigenvector. By coloring a placement result, we can quickly get insights on how to improve a placement tool and understand what matters and what does not to the placement quality. As a side effect, our coloring scheme may generate beautiful images, making this paper ...

A class of robust estimators of scatter applied to information-plus-impulsive noise samples is studied, where the sample information matrix is assumed of low rank; this generalizes the study (Couillet et al., 2013b) to spiked random matrix models. It is precisely shown that, as opposed to sample covariance matrices which may have asymptotically unbounded (eigen-)spectrum due to the sample impul...

In this chapter we introduce a model for analyzing the spread of epidemics in a disconnected mobile network. The work is based on an extension, to a dynamic setting, of the eigenvector centrality principle introduced by two of the authors for the case of static networks. The extension builds on a new definition of connectivity matrix for a highly partitioned mobile system, where the connectivit...

Detecting and labeling various research groups in the Information Systems (IS) field is crucial to understand the community. Building author collaboration networks and analyzing highly ranked historical publication records are straightforward to approach this goal. In this paper, we collect top IS journal papers to build multiple implicit coauthor networks. We study structural properties of net...

We show that correlation matrices with particular average and variance of the coefficients have a notably restricted spectral structure. Applying geometric methods, we derive lower bounds for largest eigenvalue alignment corresponding eigenvector. explain how to which extent, distinctly large an approximately diagonal eigenvector generically occur specific independently matrix dimension.