Results 11 to 20 of about 274,477 (261)
From Graph Theory to Graph Neural Networks (GNNs): The Opportunities of GNNs in Power Electronics
IEEE Access, 2023 Graph theory within power electronics, developed over a 50-year span, is continually evolving, necessitating ongoing research endeavors. Facing with the never-been-seen explosion of graph-structured data, the state-of-the-art deep learning technique ...
Yuzhuo Li +3 more
doaj +1 more source
A Spectral Graph Uncertainty Principle [PDF]
, 2013 The spectral theory of graphs provides a bridge between classical signal processing and the nascent field of graph signal processing. In this paper, a spectral graph analogy to Heisenberg's celebrated uncertainty principle is developed.
Ameya Agaskar +3 more
core +1 more source
Local Convergence and Stability of Tight Bridge-Addable Graph Classes [PDF]
, 2016 A class of graphs is bridge-addable if given a graph G in the class, any graph obtained by adding an edge between two connected components of G is also in the class. The authors recently proved a conjecture of McDiarmid, Steger, and Welsh stating that if
Chapuy, Guillaume, Perarnau, Guillem
core +2 more sources
Buildings, 2023 To enhance the safety management of steel-truss-bridge construction, an evaluation method based on the improved DEMATEL–ISM was proposed to analyze the risk factors involved in such construction.
Xudong Wang +4 more
doaj +1 more source
Bridging Theory and Practice in Link Representation with Graph Neural Networks
CoRRGraph Neural Networks (GNNs) are widely used to compute representations of node pairs for downstream tasks such as link prediction. Yet, theoretical understanding of their expressive power has focused almost entirely on graph-level representations. In this work, we shift the focus to links and provide the first comprehensive study of GNN expressiveness
Veronica Lachi +5 more
openaire +4 more sources
K6minors in 6-connected graphs of bounded tree-width [PDF]
, 2017 We prove that every sufficiently large 6-connected graph of bounded tree-width either has a K6 minor, or has a vertex whose deletion makes the graph planar.
Kawarabayashi, Ken-ichi +3 more
core +1 more source
Micromachines, 2018 The piezoelectric-actuated flexure-based compliant platform is commonly adopted in many fields of micro and nanotechnology. In this paper, bond graph modeling, and kinematic and dynamic characteristics of a piezoelectric-actuated micro-/nano compliant ...
Chao Lin +4 more
doaj +1 more source
Relative Tutte polynomials of tensor products of colored graphs [PDF]
, 2012 The tensor product $(G_1,G_2)$ of a graph $G_1$ and a pointed graph $G_2$ (containing one distinguished edge) is obtained by identifying each edge of $G_1$ with the distinguished edge of a separate copy of $G_2$, and then removing the identified edges. A
Brylawski, Chmutov, G. HETYEI, Y. DIAO
core +1 more source
Control and Optimization Algorithms for Lattice Power Grids With Multiple Grid-Forming Converters
Frontiers in Energy Research, 2022 The growth of renewable energies, together with their power converter interfaces, reshapes power systems into more-electronics power systems. Along with this paradigm shift is the requirement of grid formation by grid-tied power converters.
Daniel Wei Zhang +2 more
doaj +1 more source
Connectivity for bridge-alterable graph classes [PDF]
, 2013 A collection of graphs is called bridge-alterable if, for each graph G with a bridge e, G is in the class if and only if G-e is. For example the class of forests is bridge-alterable.
McDiarmid, Colin
core +1 more source