Results 161 to 170 of about 13,640 (282)

THE GRAPH ∞-LAPLACIAN EIGENVALUE PROBLEM

. We analyze various formulations of the ∞-Laplacian eigenvalue problem on graphs, comparing their properties and highlighting their respective advantages and limitations.
MARTIN BURGER, FRANCESCO TUDISCO, Deidda, Piero, Putti, Mario, Burger, Martin, Tudisco, Francesco, PIERO DEIDDA, MARIO PUTTI   +7 more
core   +1 more source

Beauty in the Eye of AI: Aligning LLMs and Vision Models with Human Aesthetics in Network Visualization

Computer Graphics Forum, EarlyView.
Abstract Network visualization has traditionally relied on heuristic metrics, such as stress, under the assumption that optimizing them leads to aesthetic and informative layouts. However, no single metric consistently produces the most effective results.
X. Li, P. Zhang, X. Wang, H. Shen, Y. Hu
wiley   +1 more source

Laplacian pair state transfer in Q-graph

In 2018, Chen and Godsil proposed the concept of Laplacian perfect pair state transfer which is a brilliant generalization of Laplacian perfect state transfer.
Liu, Xiaogang, Jiang, Ming, Wang, Jing
core  

The Hodge Laplacian in higher-order data analysis [PDF]

openGraph theory is a well-established and widely used framework for modeling problems in data analysis, and one of the most helpful tools in this context is the graph Laplacian.
BOGANI, LUCA
core  

Laplacian energy of a graph

, 2006
Let G be a graph with n vertices and m edges. Let λ1,λ2,…,λn be the eigenvalues of the adjacency matrix of G, and let μ1,μ2,…,μn be the eigenvalues of the Laplacian matrix of G. An earlier much studied quantity E(G)=∑i=1n|λi| is the energy of the graph G.
Zhou, Bo, Gutman, Ivan
core   +1 more source

Class Angular Distortion Index for Dimensionality Reduction

Computer Graphics Forum, EarlyView.
Abstract Dimensionality reduction (DR) techniques are often characterized by whether they preserve global, high‐level structures in the data or local, neighborhood structures. This distinction matters in visualization: global methods can obscure clusters while local methods can over‐emphasize them.
Kaviru Gunaratne, Stephen Kobourov, Jacob Miller   +2 more
wiley   +1 more source

ENERGY OF NON-COPRIME GRAPH ON MODULO GROUP

Barekeng
A graph is a mathematical structure consisting of a non-empty set of vertices and a set of edges connecting these vertices. In recent years, extensive research on graphs has been conducted, with one of the intriguing topics being the representation of ...
Gusti Yogananda Karang, I Gede Adhitya Wisnu Wardhana, Manimaran Angamuthu   +2 more
doaj   +1 more source

On Metric Choice in Dimension Reduction for Fréchet Regression

International Statistical Review, EarlyView.
Summary Fréchet regression is becoming a mainstay in modern data analysis for analysing non‐traditional data types belonging to general metric spaces. This novel regression method is especially useful in the analysis of complex health data such as continuous monitoring and imaging data.
Abdul‐Nasah Soale, Congli Ma, Siyu Chen, Obed Koomson   +3 more
wiley   +1 more source

On stochastic completeness of weighted graphs

, 2011
Huang X. On stochastic completeness of weighted graphs. Bielefeld: Universität; 2011.In this thesis we are concerned with the long time behavior of continuous time random walks on infinite graphs. The following three related problems are considered.
Huang, Xueping
core  

The sun graph is determined by its signless Laplacian spectrum

, 2010
For a simple undirected graph G, the corresponding signless Laplacian matrix is defined as D(G) + A(G) in which D(G) and A(G) are degree matrix and adjacency matrix of G, respectively.
Mirzakhah, Maryam, Kiani, Dariush
core   +1 more source