.png){kind=icon}
返回
How Likely is a Random Network Graph Shift-Enabled?
.png){kind=icon}
OA
AI
DOI：10.1109/TSIPN.2022.3216099.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In graph signal processing, the shift-enabled property of an underlying graph is essential in designing distributed filters. This article discusses when a random network graph is shift-enabled. In particular, popular network graph models Erdos-Renyi (ER), Watts-Strogatz (WS), Barabasi-Albert (BA) for both weighted and unweighted are considered. Moreover, both balanced and unbalanced signed graphs constructing using ER are considered. Our results show that the considered unweighted connected random network graphs are shift-enabled with high probability when the number of edges is moderately high. However, very dense graphs, as well as fully connected graphs, are not shift-enabled. Interestingly, this behaviour is not observed for weighted connected graphs, which are always shift-enabled unless the number of edges in the graph is very low. Finally, we evaluate the shift-enabled property of nine real-world graphs. The experimental results are consistent with our findings on randomly generated data. The results provide the basis for the filter design in a graph network.
Keyword:
Graph signal processing
shift-enabled graphs
random network graph
filtering
期刊
IF:
4.9
论文数:
728
被引数:
1.9K
机构
引用论文
分享收藏分享收藏Undirected Graphs: Is the Shift-Enabled Condition Trivial or Necessary?无向图: 启用移位的条件是平凡的还是必要的？.png)
IEEE ACCESS
OAAI
IEEE ACCESSIF3.6
OAAI分享收藏Graph Signal Processing: Overview, Challenges, and Applications图信号处理: 概述、挑战与应用PROCEEDINGS OF THE IEEEOAAI
PROCEEDINGS OF THE IEEEIF25.9
OAAI分享收藏
查看更多内容