Results 1 to 10 of about 22,178 (248)
Feature Construction Using Network Control Theory and Rank Encoding for Graph Machine Learning
In this article, we utilize the concept of average controllability in graphs, along with a novel rank encoding method, to enhance the performance of Graph Neural Networks (GNNs) in social network classification tasks. GNNs have proven highly effective in
Anwar Said +5 more
doaj +3 more sources
The treewidth of 2-section of hypergraphs [PDF]
Let $H=(V,F)$ be a simple hypergraph without loops. $H$ is called linear if $|f\cap g|\le 1$ for any $f,g\in F$ with $f\not=g$. The $2$-section of $H$, denoted by $[H]_2$, is a graph with $V([H]_2)=V$ and for any $ u,v\in V([H]_2)$, $uv\in E([H]_2)$ if ...
Ke Liu, Mei Lu
doaj +1 more source
Structure theory and stable rank for C*-algebras of finite higher-rank graphs [PDF]
AbstractWe study the structure and compute the stable rank of$C^{*}$-algebras of finite higher-rank graphs. We completely determine the stable rank of the$C^{*}$-algebra when the$k$-graph either contains no cycle with an entrance or is cofinal. We also determine exactly which finite, locally convex$k$-graphs yield unital stably finite$C^{*}$-algebras ...
David Pask, Adam Sierakowski, Aidan Sims
openaire +2 more sources
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]
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
Exponential Graph Regularized Non-Negative Low-Rank Factorization for Robust Latent Representation
Non-negative matrix factorization (NMF) is a fundamental theory that has received much attention and is widely used in image engineering, pattern recognition and other fields.
Guowei Yang, Lin Zhang, Minghua Wan
doaj +1 more source
Graph theory versus minimum rank for index coding [PDF]
We obtain novel index coding schemes and show that they provably outperform all previously known graph theoretic bounds proposed so far. Further, we establish a rather strong negative result: all known graph theoretic bounds are within a logarithmic factor from the chromatic number.
Shanmugam, Karthikeyan +2 more
openaire +2 more sources
Lanczos method for spatio‐temporal graph convolutional networks to forecast expressway flow
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
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
Ranks for families of regular graph theories
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

