Results 21 to 30 of about 6,352,710 (356)
Is Distance Matrix Enough for Geometric Deep Learning? [PDF]
Graph Neural Networks (GNNs) are often used for tasks involving the 3D geometry of a given graph, such as molecular dynamics simulation. While incorporating Euclidean distance into Message Passing Neural Networks (referred to as Vanilla DisGNN) is a ...
Zian Li +3 more
semanticscholar +1 more source
Squared distance matrices of trees with matrix weights
Let T be a tree on n vertices whose edge weights are positive definite matrices of order s. The squared distance matrix of T, denoted by Δ, is the ns × ns block matrix with [Formula: see text], where d(i, j) is the sum of the weights of the edges in the ...
Iswar Mahato, M. Rajesh Kannan
doaj +1 more source
Comparing representational geometries using whitened unbiased-distance-matrix similarity [PDF]
Representational similarity analysis (RSA) tests models of brain computation by investigating how neural activity patterns reflect experimental conditions.
J. Diedrichsen +5 more
semanticscholar +1 more source
The subject of the paper is the methods of image classification in computer vision systems. The goal is the further development of structural classification methods in terms of introducing a system of classification features based on the values of the ...
V. Gorokhovatskyi +3 more
semanticscholar +1 more source
A Semismooth Newton Method for the Nearest Euclidean Distance Matrix Problem [PDF]
Houduo Qi
openalex +2 more sources
Product distance matrix of a graph and squared distance matrix of a tree [PDF]
Let G be a strongly connected, weighted directed graph. We define a product distance ?(i,j) for pairs i,j of vertices and form the corresponding product distance matrix. We obtain a formula for the determinant and the inverse of the product distance matrix.
BAPAT, RB, SIVASUBRAMANIAN, S
openaire +3 more sources
A Distance-Preserving Matrix Sketch
38 pages, 13 ...
Wilkinson, Leland, Luo, Hengrui
openaire +2 more sources
Distance matrix polynomials of trees [PDF]
AbstractLet G be a finite connected graph. If x and y are vertices of G, one may define a distance function dG on G by letting dG(x, y) be the minimal length of any path between x and y in G (with dG(x, x) = 0). Thus, for example, dG(x, y) = 1 if and only if {x, y} is an edge of G.
Ron Graham, László Lovász
openaire +2 more sources
On the distance energy of k-uniform hypergraphs
In this article, we extend the concept of distance energy for hypergraphs. We first establish a relation between the distance energy and the distance spectral radius.
Sharma Kshitij, Panda Swarup Kumar
doaj +1 more source
The Generalized Distance Spectrum of the Join of Graphs [PDF]
Let G be a simple connected graph. In this paper, we study the spectral properties of the generalized distance matrix of graphs, the convex combination of the symmetric distance matrix D(G) and diagonal matrix of the vertex transmissions Tr(G) .
Alhevaz, Abdollah +3 more
core +2 more sources

