Skip to main content

2018 | OriginalPaper | Buchkapitel

Solving the Likelihood Equations to Compute Euler Obstruction Functions

verfasst von : Jose Israel Rodriguez

Erschienen in: Mathematical Software – ICMS 2018

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Macpherson defined Chern-Schwartz-Macpherson classes by introducing the (local) Euler obstruction function, which is an integer valued function on the variety that is constant on each stratum of a Whitney stratification. By understanding the Euler obstruction, one gains insights about a singular algebraic variety. It was recently shown by the author and B. Wang, how to compute these functions using maximum likelihood degrees. This paper discusses a symbolic and a numerical implementation of algorithms to compute the Euler obstruction at a point.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Fußnoten
1
The author is thankful for the helpful comments of Botong Wang and Xiping Zhang.
 
Literatur
1.
Zurück zum Zitat Allgower, E.L., Georg, K.: Continuation and path following. In: Acta Numerica 1993, pages 1–64. Cambridge University Press, Cambridge (1993)MathSciNetCrossRef Allgower, E.L., Georg, K.: Continuation and path following. In: Acta Numerica 1993, pages 1–64. Cambridge University Press, Cambridge (1993)MathSciNetCrossRef
4.
Zurück zum Zitat Brasselet, J.-P., Trang, L.D., Seade, J.: Euler obstruction and indices of vector fields. Topology 39(6), 1193–1208 (2000)MathSciNetCrossRef Brasselet, J.-P., Trang, L.D., Seade, J.: Euler obstruction and indices of vector fields. Topology 39(6), 1193–1208 (2000)MathSciNetCrossRef
5.
Zurück zum Zitat Catanese, F., Hoşten, S., Khetan, A., Sturmfels, B.: The maximum likelihood degree. Amer. J. Math. 128(3), 671–697 (2006)MathSciNetCrossRef Catanese, F., Hoşten, S., Khetan, A., Sturmfels, B.: The maximum likelihood degree. Amer. J. Math. 128(3), 671–697 (2006)MathSciNetCrossRef
7.
Zurück zum Zitat Franecki, J., Kapranov, M.: The Gauss map and a noncompact Riemann-Roch formula for constructible sheaves on semiabelian varieties. Duke Math. J. 104(1), 171–180 (2000)MathSciNetCrossRef Franecki, J., Kapranov, M.: The Gauss map and a noncompact Riemann-Roch formula for constructible sheaves on semiabelian varieties. Duke Math. J. 104(1), 171–180 (2000)MathSciNetCrossRef
8.
Zurück zum Zitat Gaffney, T., Grulha, Jr., N.G., Ruas, M.A.S.: The local Euler obstruction and topology of the stabilization of associated determinantal varieties. Preprint arXiv:1611.00749 (2017) Gaffney, T., Grulha, Jr., N.G., Ruas, M.A.S.: The local Euler obstruction and topology of the stabilization of associated determinantal varieties. Preprint arXiv:​1611.​00749 (2017)
10.
Zurück zum Zitat Gross, E., Drton, M., Petrović, S.: Maximum likelihood degree of variance component models. Electron. J. Stat. 6, 993–1016 (2012)MathSciNetCrossRef Gross, E., Drton, M., Petrović, S.: Maximum likelihood degree of variance component models. Electron. J. Stat. 6, 993–1016 (2012)MathSciNetCrossRef
11.
Zurück zum Zitat Gross, E., Rodriguez, J.I.: Maximum likelihood geometry in the presence of data zeros. In: Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation, ISSAC 2014, pp. 232–239. ACM, New York (2014) Gross, E., Rodriguez, J.I.: Maximum likelihood geometry in the presence of data zeros. In: Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation, ISSAC 2014, pp. 232–239. ACM, New York (2014)
12.
Zurück zum Zitat Hauenstein, J.D., Rodriguez, J.I., Sturmfels, B.: Maximum likelihood for matrices with rank constraints. J. Algebr. Stat. 5(1), 18–38 (2014)MathSciNetCrossRef Hauenstein, J.D., Rodriguez, J.I., Sturmfels, B.: Maximum likelihood for matrices with rank constraints. J. Algebr. Stat. 5(1), 18–38 (2014)MathSciNetCrossRef
13.
Zurück zum Zitat Horobet, E., Rodriguez, J.I.: The maximum likelihood data singular locus. J. Symbolic Comput. 79(part 1), 99–107 (2017)MathSciNetCrossRef Horobet, E., Rodriguez, J.I.: The maximum likelihood data singular locus. J. Symbolic Comput. 79(part 1), 99–107 (2017)MathSciNetCrossRef
14.
Zurück zum Zitat Hoşten, S., Khetan, A., Sturmfels, B.: Solving the likelihood equations. Found. Comput. Math. 5(4), 389–407 (2005)MathSciNetCrossRef Hoşten, S., Khetan, A., Sturmfels, B.: Solving the likelihood equations. Found. Comput. Math. 5(4), 389–407 (2005)MathSciNetCrossRef
15.
Zurück zum Zitat Hoşten, S., Sullivant, S.: The algebraic complexity of maximum likelihood estimation for bivariate missing data. In: Gibilisco, P., Riccomagno, E., Rogantin, M.P., Wynn, H.P. (eds.) Algebraic and Geometric Methods in Statistics, pp. 123–134. Cambridge Books Online, Cambridge University Press, Cambridge (2009)CrossRef Hoşten, S., Sullivant, S.: The algebraic complexity of maximum likelihood estimation for bivariate missing data. In: Gibilisco, P., Riccomagno, E., Rogantin, M.P., Wynn, H.P. (eds.) Algebraic and Geometric Methods in Statistics, pp. 123–134. Cambridge Books Online, Cambridge University Press, Cambridge (2009)CrossRef
16.
18.
Zurück zum Zitat Kubjas, K., Robeva, E., Sturmfels, B.: Fixed points of the EM algorithm and nonnegative rank boundaries. Ann. Statist. 43(1), 422–461 (2015)MathSciNetCrossRef Kubjas, K., Robeva, E., Sturmfels, B.: Fixed points of the EM algorithm and nonnegative rank boundaries. Ann. Statist. 43(1), 422–461 (2015)MathSciNetCrossRef
19.
20.
21.
Zurück zum Zitat Sommese, A.J., Wampler, II, C.W.: The Numerical Solution of Systems of Polynomials: Arising in Engineering and Science. World Scientific Publishing Co., Pte. Ltd., Hackensack (2005) Sommese, A.J., Wampler, II, C.W.: The Numerical Solution of Systems of Polynomials: Arising in Engineering and Science. World Scientific Publishing Co., Pte. Ltd., Hackensack (2005)
22.
Zurück zum Zitat Uhler, C.: Geometry of maximum likelihood estimation in Gaussian graphical models. Ann. Stat. 40(1), 238–261 (2012)MathSciNetCrossRef Uhler, C.: Geometry of maximum likelihood estimation in Gaussian graphical models. Ann. Stat. 40(1), 238–261 (2012)MathSciNetCrossRef
23.
Metadaten
Titel
Solving the Likelihood Equations to Compute Euler Obstruction Functions
verfasst von
Jose Israel Rodriguez
Copyright-Jahr
2018
DOI
https://doi.org/10.1007/978-3-319-96418-8_48

Premium Partner