Discrepancy inequalities for directed graphs

DOI10.1016/J.DAM.2014.03.023zbMATH Open1298.05142OpenAlexW1979872406MaRDI QIDQ403560FDOQ403560

Authors: Fan Chung, Franklin Kenter 

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

Recommendations

• Using discrepancy to control singular values for nonnegative matrices
• Laplacians and the Cheeger inequality for directed graphs
• Discrepancy properties for random regular digraphs
• Discrepancy in graphs and hypergraphs
• Digraph Laplacian and the degree of asymmetry

zbMATH Keywords

eigenvaluesdiscrepancysingular valuesdirected graphskew-symmetric matrix

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Hermitian matrices and graphs: Singular values and discrepancy
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• Expander graphs and their applications
• Using discrepancy to control singular values for nonnegative matrices
• Laplacians and the Cheeger inequality for directed graphs
• Explicit construction of linear sized tolerant networks
• Stationary distribution and cover time of random walks on random digraphs

Cited In (5)

• Using discrepancy to control singular values for nonnegative matrices
• Sharp spectral bounds of several graph parameters using eigenvector norms
• Harmonic analysis on graphs via Bratteli diagrams and path-space measures
• When Janson meets McDiarmid: Bounded difference inequalities under graph-dependence
• GPU-accelerated discontinuous Galerkin methods on hybrid meshes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q403560)