Using discrepancy to control singular values for nonnegative matrices (Q865410): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.laa.2006.05.015 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1987992382 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hermitian matrices and graphs: Singular values and discrepancy / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Relating singular values and discrepancy of weighted directed graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5691133 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Quasi‐random graphs with given degree sequences / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4220521 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Revision as of 13:23, 25 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Using discrepancy to control singular values for nonnegative matrices |
scientific article |
Statements
Using discrepancy to control singular values for nonnegative matrices (English)
0 references
14 February 2007
0 references
This paper combines ideas and results by \textit{B. Bollobás} and \textit{V. Nikiforov} [Discrete Math. 285, No. 1, 1--3, 17--32 (2004; Zbl 1050.05081)] and \textit{Y. Bilu} and \textit{N. Linial} [Proc. 45th Annual IEEE Symposium on Foundations of Computer Science, 17--19 October 2004, Rome, Italy, 404--412 (2004)] to obtain a result for nonnegative rectangular matrices on discrepancy that can be bounded by the second largest singular value and conversely. By defining the discrepancy of alternating \(t\)-walks this becomes applicable to weighted digraphs without sources of sinks.
0 references
singular values
0 references
discrepancy
0 references
directed graphs
0 references
alternating walks
0 references