Results 21 to 30 of about 464,627 (312)
Identifying Influential Nodes Based on Evidence Theory in Complex Network [PDF]
EntropyInfluential node identification is an important and hot topic in the field of complex network science. Classical algorithms for identifying influential nodes are typically based on a single attribute of nodes or the simple fusion of a few attributes ...
Fu Tan +5 more
doaj +2 more sources
Rank Collapse Causes Over-Smoothing and Over-Correlation in Graph Neural Networks [PDF]
LOG IN, 2023 Our study reveals new theoretical insights into over-smoothing and feature over-correlation in graph neural networks. Specifically, we demonstrate that with increased depth, node representations become dominated by a low-dimensional subspace that depends
Andreas Roth, T. Liebig
semanticscholar +1 more source
Tensor rank and other multipartite entanglement measures of graph states [PDF]
Physical Review A, 2022 Graph states play an important role in quantum information theory through their connection to measurement-based computing and error correction. Prior work has revealed elegant connections between the graph structure of these states and their multipartite
Louis Schatzki +3 more
semanticscholar +1 more source
Современные информационные технологии и IT-образование, 2021 The theory discussed in the article refers to the theory of functional systems. This branch of mathematics explores functions defined on finite sets, as well as the composition of these functions.
Dmitriy Eremenko
doaj +1 more source
Evaluation of Water Distribution Network Partitioning Methods Based on Graph Theory Using AHP [PDF]
آب و فاضلاب, 2020 The dramatic decline in renewable water resources, leakage and pollution in water distribution systems has led to a significant increase in the focus on leakage management and control approaches in most parts of the world.
Vida Dahrazma +1 more
doaj +1 more source
Ranks for families of regular graph theories
Herald of the Kazakh-British technical university, 2022 This article deals with families of regular graph theories. Using invariants of regular graph theory, a criterion for e-minimality,a-minimality, and α-minimality of subfamilies of the family of all regular graph theories is obtained. These ranks and degrees play a similar role for families of theories with hierarchies for definable theories, such as ...
N. D. Markhabatov, S. V. Sudoplatov
openaire +1 more source
Lanczos method for spatio‐temporal graph convolutional networks to forecast expressway flow
IET Intelligent Transport Systems, 2023 Traffic forecasting has made pronounced progress with the development of graph convolution networks and the use of the topology of road networks. However, existing works face some limitations when it comes to modelling spatial dependencies.
Zhumei Gou, Yonggang Shen, Shuifu Chen
doaj +1 more source
PLoS ONE, 2022 Organized into a global network of critical infrastructures, the oil & gas industry remains to this day the main energy contributor to the world’s economy. Severe accidents occasionally occur resulting in fatalities and disruption.
Arnaud Mignan +4 more
doaj +2 more sources
Nondeterministic quantum communication complexity: the cyclic equality game and iterated matrix multiplication [PDF]
, 2016 We study nondeterministic multiparty quantum communication with a quantum generalization of broadcasts. We show that, with number-in-hand classical inputs, the communication complexity of a Boolean function in this communication model equals the ...
Buhrman, Harry +2 more
core +11 more sources
How to construct the symmetric cycle of length 5 using Haj\'os construction with an adapted Rank Genetic Algorithm [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 In 2020 Bang-Jensen et. al. generalized the Haj\'os join of two graphs to the class of digraphs and generalized several results for vertex colorings in digraphs.
Juan Carlos García-Altamirano +2 more
doaj +1 more source