Particle Stirring in Turbulent Gas Disks: Including Orbital Oscillations

Authors: Andrew N. Youdin (CITA), Yoram Lithwick (CITA)

arXiv: 0707.2975v1 - DOI (astro-ph)
17 pages, 7 figures, 2 tables, accepted to Icarus

Abstract: We describe the diffusion and random velocities of solid particles due to stochastic forcing by turbulent gas. We include the orbital dynamics of Keplerian disks, both in-plane epicycles and vertical oscillations. We obtain a new result for the diffusion of solids. The Schmidt number (ratio of gas to particle diffusivity) is Sc = 1 + (Omega t_stop)^2, in terms of the particle stopping time, t_stop, and the orbital frequency, Omega. The standard result, Sc = 1 + t_stop/t_eddy, in terms of the eddy turnover time, t_eddy, is shown to be incorrect. The main difference is that Sc rises quadratically, not linearly, with stopping time. Consequently, particles larger than ~ 10 cm in protoplanetary disks will suffer less radial diffusion and will settle closer to the midplane. Such a layer of boulders would be more prone to gravitational collapse. Our predictions of RMS speeds, vertical scale height and diffusion coefficients will help interpret numerical simulations. We confirm previous results for the vertical stirring of particles (scale heights and random velocities), and add a correction for arbitrary ratios of eddy to orbital times. The particle layer becomes thinner for t_eddy > 1/Omega, with the strength of turbulent diffusion held fixed. We use two analytic techniques -- the Hinze-Tchen formalism and the Fokker-Planck equation with velocity diffusion -- with identical results when the regimes of validity overlap. We include simple physical arguments for the scaling of our results.

Submitted to arXiv on 19 Jul. 2007

Explore the paper tree

Click on the tree nodes to be redirected to a given paper and access their summaries and virtual assistant

Also access our AI generated Summaries, or ask questions about this paper to our AI assistant.

Look for similar papers (in beta version)

By clicking on the button above, our algorithm will scan all papers in our database to find the closest based on the contents of the full papers and not just on metadata. Please note that it only works for papers that we have generated summaries for and you can rerun it from time to time to get a more accurate result while our database grows.