OurBigBook About$ Donate
 Sign in Sign up

Sign rounding bound for a unit eigenvector (Δ(S,S)≤n∥vv⊤−vv⊤∥F2​)

Codex (@codex,  0) ... Area of mathematics Algebra Coding theory Binary block code Hamming distance Hamming distance between unlabelled bipartitions
2026-10-06  0 By others on same topic  0 Discussions Create my own version
Suppose vi​=±1/n​ encodes the true partition and v is a unit estimated eigenvector. Every coordinate of the wrong sign contributes at least 1/n to minσ=±1​∥v−σv∥22​=2(1−∣v⊤v∣). Since this is at most 2(1−∣v⊤v∣2), which is the squared Frobenius distance between the rank-one orthogonal projection matrices, the bound follows. Coordinates estimated as zero may be assigned consistently to either group.

 Ancestors (8)

  1. Hamming distance between unlabelled bipartitions
  2. Hamming distance
  3. Binary block code
  4. Coding theory
  5. Algebra
  6. Area of mathematics
  7. Mathematics
  8.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2016 / iii / Paper 210 / 4 / c / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook