Results 181 to 190 of about 13,640 (282)
A graph discretization of vector Laplacian
International audienceAs known, the scalar Laplacian gives the celebrated Laplacian matrix of a graph. In this paper, we determine the graph matrix presentation of vector Laplacian (or Helmholtz operator), named as Helmholtzian matrix.
Lu, Lu, Li, Shu, Wang, Jianfeng
core +1 more source
The Normalized Laplacian Estrada Index of a Graph [PDF]
, 2014 . In this paper, we define and investigate the normalized Laplacian Estrada index of a graph. Some bounds for the normalized Laplacian Estrada index of a graph in term of its vertex number, maximum (or minimum) degree are obtained, some inequalities ...
core
Bayesian Network Marker Selection via the Thresholded Graph Laplacian Gaussian Prior. [PDF]
Bayesian Anal, 2020 Cai Q, Kang J, Yu T.
europepmc +1 more source
Invariant Measure and Universality of the 2D Yang–Mills Langevin Dynamic
Communications on Pure and Applied Mathematics, Volume 79, Issue 8, Page 1973-2102, August 2026.ABSTRACT We prove that the Yang–Mills (YM) measure for the trivial principal bundle over the two‐dimensional torus, with any connected, compact structure group, is invariant for the associated renormalised Langevin dynamic. Our argument relies on a combination of regularity structures, lattice gauge‐fixing and Bourgain's method for invariant measures ...
Ilya Chevyrev, Hao Shen
wiley +1 more source
Geometric Planted Matchings Beyond the Gaussian Model
Random Structures &Algorithms, Volume 68, Issue 4, July 2026.ABSTRACT We consider the problem of recovering an unknown matching between a set of n$$ n $$ randomly placed points in ℝd$$ {\mathbb{R}}^d $$ and random perturbations of these points. This can be seen as a model for particle tracking and more generally, entity resolution.
Lucas R. Schwengber, Roberto I. Oliveira
wiley +1 more source
Fatigue &Fracture of Engineering Materials &Structures, Volume 49, Issue 7, Page 2892-2907, July 2026.ABSTRACT Characterization of the crack tip, such as the stress intensity factor (SIF), is a vital step for the assessment of fatigue crack growth and prediction of potential failure in engineering structures. This study investigates the use of thermoelastic stress analysis (TSA) for SIF evaluation, including a methodology for non‐adiabatic stress field
John Codrington +3 more
wiley +1 more source
Performance Analysis of Graph Laplacian Matrices in Node Classification
Graph neural networks have received great attention in recent years due to their wide range of applications. In particular, the use of graph convolutional networks to deal with classification tasks has seen rapid advancements recently.
Liu, Ying +4 more
core +1 more source
Human Brain Mapping, Volume 47, Issue 9, June 15, 2026.We propose biologically motivated deep learning models to predict individualized task‐evoked brain activation from resting‐state functional magnetic resonance imaging. By integrating attention mechanisms and graph‐based cortical modeling, our approach matches state‐of‐the‐art accuracy while substantially reducing computational cost and revealing how ...
Soren J. Madsen +10 more
wiley +1 more source
International Journal of Quantum Chemistry, Volume 126, Issue 12, June 15, 2026.DFT (GGA) analysis reveals that the Rh‐Met metallodrug forms a stable ionic pair driven by a network of supramolecular interactions. QTAIM and IGMH insights elucidate the quantum‐mechanical nature of intra‐ and intermolecular contacts governing its self‐assembly and structural organization in the crystal. ABSTRACT A recently proposed (J. Am. Chem. Soc.
Costantino Zazza +2 more
wiley +1 more source
A Comparison Study of Graph Laplacian Computation
171197Graphs provide a powerful and intuitive way to represent the physical world, especially when the data is defined on an irregular domain. The pairwise relationship between the nodes of the graph is described by edges and can be modeled by a matrix ...
Liu, Yuan +7 more
core +1 more source