Mathematics – Probability
Scientific paper
2008-07-02
Bernoulli 2009, Vol. 15, No. 1, 249-266
Mathematics
Probability
Published in at http://dx.doi.org/10.3150/08-BEJ149 the Bernoulli (http://isi.cbs.nl/bernoulli/) by the International Statisti
Scientific paper
10.3150/08-BEJ149
We consider random systems of equations over the reals, with $m$ equations and $m$ unknowns $P_i(t)+X_i(t)=0$, $t\in\mathbb{R}^m$, $i=1,...,m$, where the $P_i$'s are non-random polynomials having degrees $d_i$'s (the "signal") and the $X_i$'s (the "noise") are independent real-valued Gaussian centered random polynomial fields defined on $\mathbb{R}^m$, with a probability law satisfying some invariance properties. For each $i$, $P_i$ and $X_i$ have degree $d_i$. The problem is the behavior of the number of roots for large $m$. We prove that under specified conditions on the relation signal over noise, which imply that in a certain sense this relation is neither too large nor too small, it follows that the quotient between the expected value of the number of roots of the perturbed system and the expected value corresponding to the centered system (i.e., $P_i$ identically zero for all $i=1,...,m$), tends to zero geometrically fast as $m$ tends to infinity. In particular, this means that the behavior of this expected value is governed by the noise part.
Armentano Diego
Wschebor Mario
No associations
LandOfFree
Random systems of polynomial equations. The expected number of roots under smooth analysis 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 Random systems of polynomial equations. The expected number of roots under smooth analysis, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Random systems of polynomial equations. The expected number of roots under smooth analysis will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-421640