Über den zentralen Grenzwertsatz der Wahrscheinlichkeitsrechnung und das Momentenproblem

  title={{\"U}ber den zentralen Grenzwertsatz der Wahrscheinlichkeitsrechnung und das Momentenproblem},
  author={Georg P{\'o}lya},
  journal={Mathematische Zeitschrift},
  • G. Pólya
  • Published 1 September 1920
  • Mathematics
  • Mathematische Zeitschrift
High Efficiency Configuration Space Sampling -- probing the distribution of available states
1 Substantial acceleration of research and more efficient utilization of resources can be achieved in modeling investigated phenomena by identifying the limits of system’s accessible states insteadExpand
Nearest Neighbor Dirichlet Process
This work proposes a class of nearest neighbor-Dirichlet processes, a simple and general alternative to Dirichlet process mixture models for unknown densities, and obtains a simple pseudo-posterior for the weights and kernel parameters. Expand
Dorsal premotor cortex is involved in switching motor plans
These findings support the hypothesis that decisions about actions are made through a competition within the same circuits that guide the actions themselves and suggest that PMd continues to participate in action selection even when the animal changes its mind on-line. Expand
This paper considers bootstrap methods for panel data models with …xed regressors. It is shown that simple resampling methods (i.i.d., individual only or temporal only) are not always valid in simpleExpand
Bootstrap for Panel Data
This paper considers bootstrap methods for panel data. Theoretical results are provided for the sample mean. It is shown that the resampling only in the cross section dimension is not valid in theExpand
Alternative Financial Methods for Improving the Investment in Renewable Energy Companies
Renewable energies have increased in importance in recent years due to the harm caused to the environment by fossil fuels. As a result, renewable energy companies seem to be profitable investmentExpand
Asymptotics for push on the complete graph
Abstract We study the classical randomized rumour spreading protocol push. Initially, a node in a graph possesses some information, which is then spread in a round based manner. In each round, eachExpand