Computer Science – Discrete Mathematics
Scientific paper
2008-05-14
Computer Science
Discrete Mathematics
11 pages, 3 figures
Scientific paper
In an earlier paper, we discussed the probability that the determinant of a matrix undergoes the least change upon perturbation of one of its elements, provided that most or all of the elements of the matrix are chosen at random and that the randomly chosen elements have a fixed probability of being non-zero. In this paper, we derive approximate formulas for that probability by assuming that the terms in the permanent of a matrix are independent of one another, and we apply that assumption to several classes of matrices. In the course of deriving those formulas, we identified several integer sequences that are not listed on Sloane's Web site.
No associations
LandOfFree
Approximate formulation of the probability that the Determinant or Permanent of a matrix undergoes the least change under perturbation of a single element does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Approximate formulation of the probability that the Determinant or Permanent of a matrix undergoes the least change under perturbation of a single element, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximate formulation of the probability that the Determinant or Permanent of a matrix undergoes the least change under perturbation of a single element will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-56009