Explaining the stellar initial mass function with the theory of spatial networks

The distributions of stars and prestellar cores by mass (initial and dense core mass functions, IMF/DCMF) are among the key factors regulating star formation and are the subject of detailed theoretical and observational studies. Results from numerical simulations of star formation qualitatively resemble an observed mass function, a scale-free power law with a sharp decline at low masses. However, most analytic IMF theories critically depend on the empirically chosen input spectrum of mass fluctuations which evolve into dense cores and, subsequently, stars, and on the scaling relation between the amplitude and mass of a fluctuation. Here we propose a new approach exploiting the techniques from the field of network science. We represent a system of dense cores accreting gas from the surrounding diffuse interstellar medium (ISM) as a spatial network growing by preferential attachment and assume that the ISM density has a self-similar fractal distribution following the Kolmogorov turbulence theory. We effectively combine gravoturbulent and competitive accretion approaches and predict the accretion rate to be proportional to the dense core mass: $dM/dt \propto M$. Then we describe the dense core growth and demonstrate that the power-law core mass function emerges independently of the initial distribution of density fluctuations by mass. Our model yields a power law solely defined by the fractal dimensionalities of the ISM and accreting gas. With a proper choice of the low-mass cut-off, it reproduces observations over three decades in mass. We also rule out a low-mass star dominated "bottom-heavy" IMF in a single star-forming region.Comment: 8 pages, 5 figures, v2 matches the published versio

Computable de Finetti measures

We prove a computable version of de Finetti's theorem on exchangeable sequences of real random variables. As a consequence, exchangeable stochastic processes expressed in probabilistic functional programming languages can be automatically rewritten as procedures that do not modify non-local state. Along the way, we prove that a distribution on the unit interval is computable if and only if its moments are uniformly computable.Comment: 32 pages. Final journal version; expanded somewhat, with minor corrections. To appear in Annals of Pure and Applied Logic. Extended abstract appeared in Proceedings of CiE '09, LNCS 5635, pp. 218-23