Papers
Topics
Authors
Recent
Search
2000 character limit reached

Concentration for the zero set of large random polynomial systems

Published 21 Mar 2023 in math.PR | (2303.11924v2)

Abstract: For random systems of $K$ polynomials in $N + 1$ real variables which include the models of Kostlan (1987) and Shub and Smale (1993), we prove that the number of zeros on the unit sphere for $K = N$ or the Hausdorff measure of the zero set for $K < N$ concentrates around its mean as $N\to\infty$. To prove concentration we show that the variance of the latter random variable normalized by its mean goes to zero. The polynomial systems we consider depend on a set of parameters which determine the variance of their Gaussian coefficients. We prove that the convergence is uniform in those parameters and $K$.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (45)
  1. Asymptotic variance of the number of real roots of random polynomial systems. Proc. Amer. Math. Soc., 146(12):5437–5449, 2018.
  2. Central limit theorem for the number of real roots of Kostlan Shub Smale random polynomial systems. Amer. J. Math., 143(4):1011–1042, 2021.
  3. Central limit theorem for the volume of the zero set of Kostlan-Shub-Smale random polynomial systems. J. Complexity, 72:Paper No. 101668, 22, 2022.
  4. A. Auffinger and G. Ben Arous. Complexity of random smooth functions on the high-dimensional sphere. Ann. Probab., 41(6):4214–4247, 2013.
  5. Random matrices and complexity of spin glasses. Comm. Pure Appl. Math., 66(2):165–201, 2013.
  6. J.-M. Azaïs and M. Wschebor. On the roots of a random system of equations. The theorem of Shub and Smale and some extensions. Found. Comput. Math., 5(2):125–144, 2005.
  7. J.-M. Azaïs and M. Wschebor. Level sets and extrema of random processes and fields. John Wiley & Sons, Inc., Hoboken, NJ, 2009.
  8. A. Barvinok and M. Rudelson. When a system of real quadratic equations has a solution. Adv. Math., 403:Paper No. 108391, 38, 2022.
  9. M. Bayati and A. Montanari. The LASSO risk for Gaussian matrices. IEEE Trans. Inform. Theory, 58(4):1997–2017, 2012.
  10. C. Beltrán and L. M. Pardo. On Smale’s 17th problem: a probabilistic positive solution. Found. Comput. Math., 8(1):1–43, 2008.
  11. C. Beltrán and L. M. Pardo. Smale’s 17th problem: average polynomial time to compute affine and projective solutions. J. Amer. Math. Soc., 22(2):363–385, 2009.
  12. Geometry and temperature chaos in mixed spherical spin glasses at low temperature: the perturbative regime. Comm. Pure Appl. Math., 73(8):1732–1828, 2020.
  13. A. T. Bharucha-Reid and M. Sambandham. Random polynomials. Probability and Mathematical Statistics. Academic Press, Inc., Orlando, FL, 1986.
  14. A. Bloch and G. Pólya. On the Roots of Certain Algebraic Equations. Proc. London Math. Soc. (2), 33(2):102–114, 1931.
  15. P. Bürgisser and F. Cucker. On a problem posed by Steve Smale. Ann. of Math. (2), 174(3):1785–1836, 2011.
  16. A. Edelman and E. Kostlan. How many zeros of a random polynomial are real? Bull. Amer. Math. Soc. (N.S.), 32(1):1–37, 1995.
  17. K. Farahmand. Topics in random polynomials, volume 393 of Pitman Research Notes in Mathematics Series. Longman, Harlow, 1998.
  18. Y. V. Fyodorov. Complexity of random energy landscapes, glass transition, and absolute value of the spectral determinant of random matrices. Phys. Rev. Lett., 92(24):240601, 4, 2004.
  19. Zeros of Gaussian analytic functions and determinantal point processes, volume 51 of University Lecture Series. American Mathematical Society, Providence, RI, 2009.
  20. M. Kac. On the average number of real roots of a random algebraic equation. Bull. Amer. Math. Soc., 49:314–320, 1943.
  21. E. Kostlan. Random polynomials and the statistical fundamental theorem of algebra. unpublished, 1987.
  22. E. Kostlan. On the distribution of roots of random polynomials. In From Topology to Computation: Proceedings of the Smalefest (Berkeley, CA, 1990), pages 419–431. Springer, New York, 1993.
  23. E. Kostlan. On the expected number of real roots of a system of random polynomial equations. In Foundations of computational mathematics (Hong Kong, 2000), pages 149–188. World Sci. Publ., River Edge, NJ, 2002.
  24. P. Lairez. A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time. Found. Comput. Math., 17(5):1265–1292, 2017.
  25. Pierre Lairez. Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems. J. Amer. Math. Soc., 33(2):487–526, 2020.
  26. T. Letendre. Variance of the volume of random real algebraic submanifolds. Trans. Amer. Math. Soc., 371(6):4129–4192, 2019.
  27. On the Number of Real Roots of a Random Algebraic Equation. J. London Math. Soc., 13(4):288–295, 1938.
  28. On the number of real roots of a random algebraic equation. III. Rec. Math. [Mat. Sbornik] N.S., 12(54):277–286, 1943.
  29. On the distribution of the zeros and a𝑎aitalic_a-values of a random integral function. I. J. London Math. Soc., 20:130–136, 1945.
  30. On the distribution of zeros and a𝑎aitalic_a-values of a random integral function. II. Ann. of Math. (2), 49:885–952; errata 50, 990–991 (1949), 1948.
  31. A. McLennan. The expected number of real roots of a multihomogeneous system of polynomial equations. Amer. J. Math., 124(1):49–73, 2002.
  32. Feng Qi. Bounds for the ratio of two gamma functions. J. Inequal. Appl., pages Art. ID 493058, 84, 2010.
  33. S. O. Rice. Mathematical analysis of random noise. Bell System Tech. J., 24:46–156, 1945.
  34. J. M. Rojas. On the average number of real roots of certain random sparse polynomial systems. In The mathematics of numerical analysis (Park City, UT, 1995), volume 32 of Lectures in Appl. Math., pages 689–699. Amer. Math. Soc., Providence, RI, 1996.
  35. M. Shub and S. Smale. Complexity of Bézout’s theorem. I. Geometric aspects. J. Amer. Math. Soc., 6(2):459–501, 1993.
  36. M. Shub and S. Smale. Complexity of Bezout’s theorem. II. Volumes and probabilities. In Computational algebraic geometry (Nice, 1992), volume 109 of Progr. Math., pages 267–285. Birkhäuser Boston, Boston, MA, 1993.
  37. M. Shub and S. Smale. Complexity of Bezout’s theorem. III. Condition number and packing. volume 9, pages 4–14. 1993. Festschrift for Joseph F. Traub, Part I.
  38. M. Shub and S. Smale. Complexity of Bezout’s theorem. V. Polynomial time. volume 133, pages 141–164. 1994. Selected papers of the Workshop on Continuous Algorithms and Complexity (Barcelona, 1993).
  39. M. Shub and S. Smale. Complexity of Bezout’s theorem. IV. Probability of success; extensions. SIAM J. Numer. Anal., 33(1):128–148, 1996.
  40. S. Smale. Mathematical problems for the next century. Math. Intelligencer, 20(2):7–15, 1998.
  41. E. Subag. The complexity of spherical p𝑝pitalic_p-spin models—A second moment approach. Ann. Probab., 45(5):3385–3450, 2017.
  42. E. Subag. The geometry of the Gibbs measure of pure spherical spin glasses. Invent. Math., 210(1):135–209, 2017.
  43. E. Subag and O. Zeitouni. The extremal process of critical points of the pure p𝑝pitalic_p-spin spherical spin glass model. Probab. Theory Related Fields, 168(3-4):773–820, 2017.
  44. E. Subag and O. Zeitouni. Concentration of the complexity of spherical pure p𝑝pitalic_p-spin models at arbitrary energies. J. Math. Phys., 62(12):Paper No. 123301, 15, 2021.
  45. M. Wschebor. On the Kostlan-Shub-Smale model for random polynomial systems. Variance of the number of roots. J. Complexity, 21(6):773–789, 2005.
Citations (1)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (1)

  1. Eliran Subag 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.

Sign Up for Free