Cheeger Inequalities for General Edge-Weighted Directed Graphs

被引：1
|
作者：
Chan, T-H. Hubert [1 ]
Tang, Zhihao Gavin [1 ]
Zhane, Chenzi [1 ]
机构：
[1] Univ Hong Kong, Hong Kong, Hong Kong, Peoples R China
来源：
COMPUTING AND COMBINATORICS | 2015年 / 9198卷
关键词：
D O I：
10.1007/978-3-319-21398-9_3
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We consider Cheeger Inequalities for general edge-weighted directed graphs. Previously the directed case was considered by Chung for a probability transition matrix corresponding to a strongly connected graph with weights induced by a stationary distribution. An Eulerian property of these special weights reduces these instances to the undirected case, for which recent results on multi-way spectral partitioning and higher-order Cheeger Inequalities can be applied. We extend Chung's approach to general directed graphs. In particular, we obtain higher-order Cheeger Inequalities for the following scenarios: (1) The underlying graph needs not be strongly connected. (2) The weights can deviate (slightly) from a stationary distribution.
引用
收藏
页码：30 / 41
页数：12
相关论文
共 50 条
12345