In this paper, we introduce a unified framework of Tensor Higher-Degree EigenvalueComplementarity Problem (THDEiCP),which goes beyond the framework of the typical Quadratic Eigenvalue Complementarity Problem for matrices. First, we study some topological properties of higher-degree cone eigenvalues of tensors. Based upon the symmetry assumptions on the underlying tensors, we then reformulate TH...

the paper presents a mathematical base modeling combined to modified-winding -function-approach (mwfa) for eccentricity fault detection of a round-rotor synchronous machine. for this aim, a 6-pole machine is considered, and the machine inductances are computed by mwfa in healthy and also under eccentricity fault. a numerical discrete-time method has been proposed to machine modeling in voltage-...

The energy of a graph G is equal to the sum of absolute values of the eigenvalues of the adjacency matrix of G, whereas the Laplacian energy of a graph G is equal to the sum of the absolute value of the difference between the eigenvalues of the Laplacian matrix of G and average degree of the vertices of G. Motivated by the work from Sharafdini et al. [R. Sharafdini, H. Panahbar, Vertex weighted...

Temporal modulation sensitivity functions were measured centrally and at eccentricities of 2.5 degrees, 5 degrees and 10 degrees in the temporal visual field of 12 patients with recovered optic neuritis and in a group of matched normal controls. A circular, spatially uniform stimulus of 1 degree angular subtense was presented with sinusoidal modulation at 5, 8, 14 and 23 Hz. The general pattern...

The eccentricity distribution of exoplanets is known from radial velocity surveys to be divergent from circular orbits beyond 0.1 au. This is particularly the case for large planets where the radial velocity technique is most sensitive. The eccentricity of planetary orbits can have a large effect on the transit probability and subsequently the planet yield of transit surveys. The Kepler mission...

The largest eigenvalue λ1 of the adjacency matrix powerfully characterizes dynamic processes on networks, such as virus spread and synchronization. The minimization of the spectral radius by removing a set of links (or nodes) has been shown to be an NP-complete problem. So far, the best heuristic strategy is to remove links/nodes based on the principal eigenvector corresponding to the largest e...

We study evolving networks where new nodes when attached to the network form links with other nodes of preferred distances. A particular case is where always the shortest distances are selected ("make friends with the friends of your present friends"). We present simulation results for network parameters like the first eigenvalue of the graph Laplacian (synchronizability), clustering coefficien...

Abstract We introduce a broad class of multi-hooking networks, wherein multiple copies seed are hooked at each step random locations, and the number follows predetermined building sequence numbers. analyze degree profile in networks by tracking two kinds node degrees—the local average specific over time global overall graph. The former experiences phases latter is invariant with respect to type...