Discrepancy inequalities for directed graphs

DOI10.1016/j.dam.2014.03.023zbMath1298.05142OpenAlexW1979872406MaRDI QIDQ403560

Franklin H. J. Kenter, Fan R. K. Chung

Publication date: 29 August 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2014.03.023

zbMATH Keywords

eigenvaluesdirected graphdiscrepancysingular valuesskew-symmetric matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Random walks on graphs (05C81)

Related Items (3)

Sharp spectral bounds of several graph parameters using eigenvector norms ⋮ Harmonic analysis on graphs via Bratteli diagrams and path-space measures ⋮ GPU-accelerated discontinuous Galerkin methods on hybrid meshes

Cites Work

• Unnamed Item
• Unnamed Item
• Stationary distribution and cover time of random walks on random digraphs
• Using discrepancy to control singular values for nonnegative matrices
• Explicit construction of linear sized tolerant networks
• Laplacians and the Cheeger inequality for directed graphs
• Hermitian matrices and graphs: Singular values and discrepancy
• Expander graphs and their applications

This page was built for publication: Discrepancy inequalities for directed graphs