Axion miniclusters made easy
نویسندگان
چکیده
We use a modified version of the Peak Patch excursion set formalism to compute mass and size distribution QCD axion miniclusters from fully non-Gaussian initial density field obtained numerical simulations string decay. find strong agreement with N-Body at significantly lower computational cost. employ spherical collapse model provide fitting functions for barrier in radiation era. The halo function $z=629$ has power-law $M^{-0.6}$ masses within range $10^{-15}\lesssim M\lesssim 10^{-10}M_{\odot}$, all scaling as $(m_a/50\mu\mathrm{eV})^{-0.5}$. construct merger trees estimate redshift concentration relation, $C(M)$, which is well described using analytical results power spectrum linear growth. Using calibrated analytic extrapolate $z=0$, our method predicts mean $C\sim \mathcal{O}(\text{few})\times10^4$. low cost makes future investigation statistics rare, dense easy achieve.
منابع مشابه
Axion miniclusters and Bose stars.
Evolution of inhomogeneities in the axion field around the QCD epoch is studied numerically, including for the first time important nonlinear effects. It is found that perturbations on scales corresponding to causally disconnected regions at T ∼ 1GeV can lead to very dense axion clumps, with present density ρa > ∼ 10 g cm. This is high enough for the collisional 2a → 2a process to lead to Bose–...
متن کاملFemtolensing and Picolensing by Axion Miniclusters
Non-linear effects in the evolution of the axion field in the early Universe may lead to the formation of gravitationally bound clumps of axions, known as “miniclusters.” Minicluster masses and radii should be in the range Mmc ∼ 10M⊙ and Rmc ∼ 10cm, and in plausible early-Universe scenarios a significant fraction of the mass density of the Universe may be in the form of axion miniclusters. If s...
متن کاملConcurrent Programming Made Easy
The task of programming concurrent systems is substantially more difficult than the task of programming sequential systems with respect to both correctness and efficiency. In this paper we describe a constraint-based methodology for writing concurrent applications. A system is modeled as: (a) a set of processes containing a sequence of “markers” denoting the processes points of interest; and (b...
متن کاملDistributed CQL Made Easy
This talk is about making it easy to implement a distributed CQL. CQL is a continuous query language that extends SQL with a notion of windows over infinite streams of data. Programmers like using CQL, because its syntax is already familiar to them from their experience with other database-backed applications. CQL was originally designed to target a single node implementation of the Stanford St...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical review
سال: 2021
ISSN: ['0556-2813', '1538-4497', '1089-490X']
DOI: https://doi.org/10.1103/physrevd.103.083525