AMS Subject Classication: 05C20, 05C50, 15A42, 60J05 Abstract. We consider Laplacians for directed graphs and examine their eigenvalues. We intro-duce a notion of a circulation in a directed graph and its connection with the Rayleigh quotient. We then dene a Cheeger constant and establish the Cheeger inequality for directed graphs. These relations can be used to deal with various problems that often arise in the study of non-reversible Markov chains including bounding the rate of convergence and deriving comparison theorems
The graph Cheeger constant and Cheeger inequalities are generalized to the case of hypergraphs whose...
For graphs there exists a strong connection between spectral and combinatorial expansion properties....
For graphs there exists a strong connection between spectral and combinatorial expansion properties....
We apply spectral theory to study random processes involving directed graphs. In the first half of t...
AbstractThe relationship between the isoperimetric constants of a connected finite graph and the fir...
AbstractFor a specified subset S of vertices in a graph G we consider local cuts that separate a sub...
AbstractWe introduce a set of multi-way dual Cheeger constants and prove universal higher-order dual...
LNCS v.9188 entitled: Computing and Combinatorics: 21st International Conference, COCOON 2015, Beiji...
Abstract. We introduce a set of multi-way dual Cheeger constants and prove universal higher-order du...
Abstract. The O(d) synchronization problem consists of estimating a set of n unknown orthog-onal d ×...
The Poincaré and Cheeger bounds are two useful bounds for the second largest eigenvalue of a reversi...
AbstractLet L be a reversible Markovian generator on a finite set V. Relations between the spectral ...
AbstractWe consider the normalized Laplace operator for directed graphs with positive and negative e...
AbstractWe study the relationship between the first eigenvalue of the Laplacian and Cheeger constant...
The celebrated Cheeger's Inequality (Alon and Milman 1985; Alon 1986) establishes a bound on the edg...
The graph Cheeger constant and Cheeger inequalities are generalized to the case of hypergraphs whose...
For graphs there exists a strong connection between spectral and combinatorial expansion properties....
For graphs there exists a strong connection between spectral and combinatorial expansion properties....
We apply spectral theory to study random processes involving directed graphs. In the first half of t...
AbstractThe relationship between the isoperimetric constants of a connected finite graph and the fir...
AbstractFor a specified subset S of vertices in a graph G we consider local cuts that separate a sub...
AbstractWe introduce a set of multi-way dual Cheeger constants and prove universal higher-order dual...
LNCS v.9188 entitled: Computing and Combinatorics: 21st International Conference, COCOON 2015, Beiji...
Abstract. We introduce a set of multi-way dual Cheeger constants and prove universal higher-order du...
Abstract. The O(d) synchronization problem consists of estimating a set of n unknown orthog-onal d ×...
The Poincaré and Cheeger bounds are two useful bounds for the second largest eigenvalue of a reversi...
AbstractLet L be a reversible Markovian generator on a finite set V. Relations between the spectral ...
AbstractWe consider the normalized Laplace operator for directed graphs with positive and negative e...
AbstractWe study the relationship between the first eigenvalue of the Laplacian and Cheeger constant...
The celebrated Cheeger's Inequality (Alon and Milman 1985; Alon 1986) establishes a bound on the edg...
The graph Cheeger constant and Cheeger inequalities are generalized to the case of hypergraphs whose...
For graphs there exists a strong connection between spectral and combinatorial expansion properties....
For graphs there exists a strong connection between spectral and combinatorial expansion properties....