Results 111 to 120 of about 76,384 (242)
On Laplacian-energy-like invariant and incidence energy [PDF]
For a simple connected graph G with n -vertices having Laplacian eigenvalues μ 1 , μ 2 , … , μ n−1 , μ n =0 , and signless Laplacian eigenvalues q 1 ,q 2 ,…,q n , the Laplacian-energy-like invariant(LEL ) and the incidence energy ...
Shariefuddin Pirzada , Hilal A. Ganie
doaj
A New Surrogating Algorithm by the Complex Graph Fourier Transform (CGFT)
The essential step of surrogating algorithms is phase randomizing the Fourier transform while preserving the original spectrum amplitude before computing the inverse Fourier transform.
Jordi Belda +4 more
doaj +1 more source
A New Decomposition of the Graph Laplacian and the Binomial Structure of Mass-Action Systems. [PDF]
Müller S.
europepmc +1 more source
ABSTRACT Intrinsic motivation serves as the predominant paradigm of exploration in reinforcement learning. In pursuit of an informative and robust state representation, the behavioural metric groups behaviourally equivalent states together, which share the same single‐step reward and transition distribution.
Anjie Zhu +3 more
wiley +1 more source
The coalescence of multi-wheel and starlike graphs is DLS [PDF]
The Laplacian spectrum of a graph is obtained by taking the difference of the adjacency spectrum from the diagonal matrix of degrees. If a graph has a unique Laplacian spectrum, it means that it can be identified by this spectrum, it is called $DLS ...
Mohammad Hasan Ahangarani Farahani +1 more
doaj +1 more source
Democratising Multi‐Projector Displays
Spatially augmented reality (SAR) transforms large, surround, collaborative experiences out of VR/AR headsets to the real world by merging content from projectors with the physical environment. This detailed state‐of‐the‐art survey reports on the advancements in multi‐projector aggregation and hardware technologies used to achieve SAR and build ...
Aditi Majumder, Muhammad Twaha Ibrahim
wiley +1 more source
Constructing Connectome Atlas by Graph Laplacian Learning. [PDF]
Kim M +5 more
europepmc +1 more source
Laplacian {−1,0,1}- and {−1,1}-diagonalizable graphs
A graph is called "Laplacian integral" if the eigenvalues of its Laplacian matrix are all integers. We investigate the subset of these graphs whose Laplacian is furthermore diagonalized by a matrix with entries coming from a fixed set, in particular, the sets $\{-1,0,1\}$ or $\{-1,1\}$.
Nathaniel Johnston, Sarah Plosker
openaire +3 more sources
Real‐Time Conformal Maps and Parameterizations
Abstract We present a simple algorithm to conformally map between two simple and bounded planar domains based on the concept of harmonic measure, which is a conformal invariant. With suitable preprocessing, the algorithm is fast enough to compute all possible conformal maps (having three real degrees of freedom) between the two domains in real time in
Q. Chang, C. Gotsman, K. Hormann
wiley +1 more source
Combining non-negative matrix factorization with graph Laplacian regularization for predicting drug-miRNA associations based on multi-source information fusion. [PDF]
Wang MN, Li Y, Lei LL, Ding DW, Xie XJ.
europepmc +1 more source

