arXiv subjects

Sebastian Wild

Publications and source records attributed to Sebastian Wild.

At least 37 records · Page 2Linked to original sources

arXiv2021

Thermal WIMPs and the Scale of New Physics: Global Fits of Dirac Dark Matter Effective Field Theories

We assess the status of a wide class of WIMP dark matter (DM) models in light of the latest experimental results using the global fitting framework $\textsf{GAMBIT}$. We perform a global analysis of effective field theory (EFT) operators describing the interactions between a gauge-singlet Dirac fermion and the Standard Model quarks, the gluons and the photon. In this bottom-up approach, we simultaneously vary the coefficients of 14 such operators up to dimension 7, along with the DM mass, the scale of new physics and several nuisance parameters. Our likelihood functions include the latest data from $\mathit{Planck}$, direct and indirect detection experiments, and the LHC. For DM masses below 100 GeV, we find that it is impossible to satisfy all constraints simultaneously while maintaining EFT validity at LHC energies. For new physics scales around 1 TeV, our results are influenced by several small excesses in the LHC data and depend on the prescription that we adopt to ensure EFT validity. Furthermore, we find large regions of viable parameter space where the EFT is valid and the relic density can be reproduced, implying that WIMPs can still account for the DM of the universe while being consistent with the latest data.

hep-ph↗

arXiv2021

Towards the 5/6-Density Conjecture of Pinwheel Scheduling

Pinwheel Scheduling aims to find a perpetual schedule for unit-length tasks on a single machine subject to given maximal time spans (a.k.a. frequencies) between any two consecutive executions of the same task. The density of a Pinwheel Scheduling instance is the sum of the inverses of these task frequencies; the 5/6-Conjecture (Chan and Chin, 1993) states that any Pinwheel Scheduling instance with density at most 5/6 is schedulable. We formalize the notion of Pareto surfaces for Pinwheel Scheduling and exploit novel structural insights to engineer an efficient algorithm for computing them. This allows us to (1) confirm the 5/6-Conjecture for all Pinwheel Scheduling instances with at most 12 tasks and (2) to prove that a given list of only 23 schedules solves all schedulable Pinwheel Scheduling instances with at most 5 tasks.

cs.DS↗

arXiv2021

Hypersuccinct Trees -- New universal tree source codes for optimal compressed tree data structures and range minima

We present a new universal source code for distributions of unlabeled binary and ordinal trees that achieves optimal compression to within lower order terms for all tree sources covered by existing universal codes. At the same time, it supports answering many navigational queries on the compressed representation in constant time on the word-RAM; this is not known to be possible for any existing tree compression method. The resulting data structures, "hypersuccinct trees", hence combine the compression achieved by the best known universal codes with the operation support of the best succinct tree data structures. We apply hypersuccinct trees to obtain a universal compressed data structure for range-minimum queries. It has constant query time and the optimal worst-case space usage of $2n+o(n)$ bits, but the space drops to $1.736n + o(n)$ bits on average for random permutations of $n$ elements, and $2\lg\binom nr + o(n)$ for arrays with $r$ increasing runs, respectively. Both results are optimal; the former answers an open problem of Davoodi et al. (2014) and Golin et al. (2016). Compared to prior work on succinct data structures, we do not have to tailor our data structure to specific applications; hypersuccinct trees automatically adapt to the trees at hand. We show that they simultaneously achieve the optimal space usage to within lower order terms for a wide range of distributions over tree shapes, including: binary search trees (BSTs) generated by insertions in random order / Cartesian trees of random arrays, random fringe-balanced BSTs, binary trees with a given number of binary/unary/leaf nodes, random binary tries generated from memoryless sources, full binary trees, unary paths, as well as uniformly chosen weight-balanced BSTs, AVL trees, and left-leaning red-black trees.

cs.DS↗

arXiv2021

Succinct Euler-Tour Trees

We show how a collection of Euler-tour trees for a forest on $n$ vertices can be stored in $2 n + o (n)$ bits such that simple queries take constant time, more complex queries take logarithmic time and updates take polylogarithmic amortized time.

cs.DS↗

arXiv2020

Lazy Search Trees

We introduce the lazy search tree data structure. The lazy search tree is a comparison-based data structure on the pointer machine that supports order-based operations such as rank, select, membership, predecessor, successor, minimum, and maximum while providing dynamic operations insert, delete, change-key, split, and merge. We analyze the performance of our data structure based on a partition of current elements into a set of gaps $\{Δ_i\}$ based on rank. A query falls into a particular gap and splits the gap into two new gaps at a rank $r$ associated with the query operation. If we define $B = \sum_i |Δ_i| \log_2(n/|Δ_i|)$, our performance over a sequence of $n$ insertions and $q$ distinct queries is $O(B + \min(n \log \log n, n \log q))$. We show $B$ is a lower bound. Effectively, we reduce the insertion time of binary search trees from $Θ(\log n)$ to $O(\min(\log(n/|Δ_i|) + \log \log |Δ_i|, \; \log q))$, where $Δ_i$ is the gap in which the inserted element falls. Over a sequence of $n$ insertions and $q$ queries, a time bound of $O(n \log q + q \log n)$ holds; better bounds are possible when queries are non-uniformly distributed. As an extreme case of non-uniformity, if all queries are for the minimum element, the lazy search tree performs as a priority queue with $O(\log \log n)$ time insert and decrease-key operations. The same data structure supports queries for any rank, interpolating between binary search trees and efficient priority queues. Lazy search trees can be implemented to operate mostly on arrays, requiring only $O(\min(q, n))$ pointers. Via direct reduction, our data structure also supports the efficient access theorems of the splay tree, providing a powerful data structure for non-uniform element access, both when the number of accesses is small and large.

cs.DS↗

arXiv2020

Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct Trees

We present the first succinct distance oracles for (unweighted) interval graphs and related classes of graphs, using a novel succinct data structure for ordinal trees that supports the mapping between preorder (i.e., depth-first) ranks and level-order (breadth-first) ranks of nodes in constant time. Our distance oracles for interval graphs also support navigation queries -- testing adjacency, computing node degrees, neighborhoods, and shortest paths -- all in optimal time. Our technique also yields optimal distance oracles for proper interval graphs (unit-interval graphs) and circular-arc graphs. Our tree data structure supports all operations provided by different approaches in previous work, as well as mapping to and from level-order ranks and retrieving the last (first) internal node before (after) a given node in a level-order traversal, all in constant time.

cs.DS↗

arXiv2020

Global analyses of Higgs portal singlet dark matter models using GAMBIT

We present global analyses of effective Higgs portal dark matter models in the frequentist and Bayesian statistical frameworks. Complementing earlier studies of the scalar Higgs portal, we use GAMBIT to determine the preferred mass and coupling ranges for models with vector, Majorana and Dirac fermion dark matter. We also assess the relative plausibility of all four models using Bayesian model comparison. Our analysis includes up-to-date likelihood functions for the dark matter relic density, invisible Higgs decays, and direct and indirect searches for weakly-interacting dark matter including the latest XENON1T data. We also account for important uncertainties arising from the local density and velocity distribution of dark matter, nuclear matrix elements relevant to direct detection, and Standard Model masses and couplings. In all Higgs portal models, we find parameter regions that can explain all of dark matter and give a good fit to all data. The case of vector dark matter requires the most tuning and is therefore slightly disfavoured from a Bayesian point of view. In the case of fermionic dark matter, we find a strong preference for including a CP-violating phase that allows suppression of constraints from direct detection experiments, with odds in favour of CP violation of the order of 100:1. Finally, we present DDCalc 2.0.0, a tool for calculating direct detection observables and likelihoods for arbitrary non-relativistic effective operators.

hep-ph↗

arXiv2019

Dynamic Optimality Refuted -- For Tournament Heaps

We prove a separation between offline and online algorithms for finger-based tournament heaps undergoing key modifications. These heaps are implemented by binary trees with keys stored on leaves, and intermediate nodes tracking the min of their respective subtrees. They represent a natural starting point for studying self-adjusting heaps due to the need to access the root-to-leaf path upon modifications. We combine previous studies on the competitive ratios of unordered binary search trees by [Fredman WADS2011] and on order-by-next request by [Martínez-Roura TCS2000] and [Munro ESA2000] to show that for any number of fingers, tournament heaps cannot handle a sequence of modify-key operations with competitive ratio in $o(\sqrt{\log{n}})$. Critical to this analysis is the characterization of the modifications that a heap can undergo upon an access. There are $\exp(Θ(n \log{n}))$ valid heaps on $n$ keys, but only $\exp(Θ(n))$ binary search trees. We parameterize the modification power through the well-studied concept of fingers: additional pointers the data structure can manipulate arbitrarily. Here we demonstrate that fingers can be significantly more powerful than servers moving on a static tree by showing that access to $k$ fingers allow an offline algorithm to handle any access sequence with amortized cost $O(\log_{k}(n) + 2^{\lg^{*}n})$.

cs.DS↗

arXiv2019

Efficient Second-Order Shape-Constrained Function Fitting

We give an algorithm to compute a one-dimensional shape-constrained function that best fits given data in weighted-$L_{\infty}$ norm. We give a single algorithm that works for a variety of commonly studied shape constraints including monotonicity, Lipschitz-continuity and convexity, and more generally, any shape constraint expressible by bounds on first- and/or second-order differences. Our algorithm computes an approximation with additive error $\varepsilon$ in $O\left(n \log \frac{U}{\varepsilon} \right)$ time, where $U$ captures the range of input values. We also give a simple greedy algorithm that runs in $O(n)$ time for the special case of unweighted $L_{\infty}$ convex regression. These are the first (near-)linear-time algorithms for second-order-constrained function fitting. To achieve these results, we use a novel geometric interpretation of the underlying dynamic programming problem. We further show that a generalization of the corresponding problems to directed acyclic graphs (DAGs) is as difficult as linear programming.

cs.DS↗

arXiv2019

BBN constraints on the annihilation of MeV-scale dark matter

Thermal dark matter at the MeV scale faces stringent bounds from a variety of cosmological probes. Here we perform a detailed evaluation of BBN bounds on the annihilation cross section of dark matter with a mass $1\,\text{MeV} \lesssim m_χ\lesssim 1\,\text{GeV}$. For $p-wave suppressed annihilations, constraints from BBN turn out to be significantly stronger than the ones from CMB observations, and are competitive with the strongest bounds from other indirect searches. We furthermore update the lower bound from BBN on the mass of thermal dark matter using improved determinations of primordial abundances. While being of similar strength as the corresponding bound from CMB, it is significantly more robust to changes in the particle physics model.

hep-ph↗

arXiv2019

Entropy Trees and Range-Minimum Queries In Optimal Average-Case Space

The range-minimum query (RMQ) problem is a fundamental data structuring task with numerous applications. Despite the fact that succinct solutions with worst-case optimal $2n+o(n)$ bits of space and constant query time are known, it has been unknown whether such a data structure can be made adaptive to the reduced entropy of random inputs (Davoodi et al. 2014). We construct a succinct data structure with the optimal $1.736n+o(n)$ bits of space on average for random RMQ instances, settling this open problem. Our solution relies on a compressed data structure for binary trees that is of independent interest. It can store a (static) binary search tree generated by random insertions in asymptotically optimal expected space and supports many queries in constant time. Using an instance-optimal encoding of subtrees, we furthermore obtain a "hyper-succinct" data structure for binary trees that improves upon the ultra-succinct representation of Jansson, Sadakane and Sung (2012).

cs.DS↗

arXiv2018

BBN constraints on MeV-scale dark sectors. Part II. Electromagnetic decays

Meta-stable dark sector particles decaying into electrons or photons may non-trivially change the Hubble rate, lead to entropy injection into the thermal bath of Standard Model particles and may also photodisintegrate light nuclei formed in the early universe. We study generic constraints from Big Bang Nucleosynthesis on such a setup, with a particular emphasis on MeV-scale particles which are neither fully relativistic nor non-relativistic during all times relevant for Big Bang Nucleosynthesis. We apply our results to a simple model of self-interacting dark matter with a light scalar mediator. This setup turns out to be severely constrained by these considerations in combination with direct dark matter searches and will be fully tested with the next generation of low-threshold direct detection experiments.

hep-ph↗

arXiv2018

QuickXsort - A Fast Sorting Scheme in Theory and Practice

QuickXsort is a highly efficient in-place sequential sorting scheme that mixes Hoare's Quicksort algorithm with X, where X can be chosen from a wider range of other known sorting algorithms, like Heapsort, Insertionsort and Mergesort. Its major advantage is that QuickXsort can be in-place even if X is not. In this work we provide general transfer theorems expressing the number of comparisons of QuickXsort in terms of the number of comparisons of X. More specifically, if pivots are chosen as medians of (not too fast) growing size samples, the average number of comparisons of QuickXsort and X differ only by $o(n)$-terms. For median-of-$k$ pivot selection for some constant $k$, the difference is a linear term whose coefficient we compute precisely. For instance, median-of-three QuickMergesort uses at most $n \lg n - 0.8358n + O(\log n)$ comparisons. Furthermore, we examine the possibility of sorting base cases with some other algorithm using even less comparisons. By doing so the average-case number of comparisons can be reduced down to $n \lg n- 1.4106n + o(n)$ for a remaining gap of only $0.0321n$ comparisons to the known lower bound (while using only $O(\log n)$ additional space and $O(n \log n)$ time overall). Implementations of these sorting strategies show that the algorithms challenge well-established library implementations like Musser's Introsort.

cs.DS↗

arXiv2018

Median-of-k Jumplists and Dangling-Min BSTs

We extend randomized jumplists introduced by Brönnimann et al. (STACS 2003) to choose jump-pointer targets as median of a small sample for better search costs, and present randomized algorithms with expected $O(\log n)$ time complexity that maintain the probability distribution of jump pointers upon insertions and deletions. We analyze the expected costs to search, insert and delete a random element, and we show that omitting jump pointers in small sublists hardly affects search costs, but significantly reduces the memory consumption. We use a bijection between jumplists and "dangling-min BSTs", a variant of (fringe-balanced) binary search trees for the analysis. Despite their similarities, some standard analysis techniques for search trees fail for dangling-min trees (and hence for jumplists).

cs.DS↗

arXiv2018

Sesquickselect: One and a half pivots for cache-efficient selection

Because of unmatched improvements in CPU performance, memory transfers have become a bottleneck of program execution. As discovered in recent years, this also affects sorting in internal memory. Since partitioning around several pivots reduces overall memory transfers, we have seen renewed interest in multiway Quicksort. Here, we analyze in how far multiway partitioning helps in Quickselect. We compute the expected number of comparisons and scanned elements (approximating memory transfers) for a generic class of (non-adaptive) multiway Quickselect and show that three or more pivots are not helpful, but two pivots are. Moreover, we consider "adaptive" variants which choose partitioning and pivot-selection methods in each recursive step from a finite set of alternatives depending on the current (relative) sought rank. We show that "Sesquickselect", a new Quickselect variant that uses either one or two pivots, makes better use of small samples w.r.t. memory transfers than other Quickselect variants.

cs.DS↗

arXiv2018

Impact of vacuum stability, perturbativity and XENON1T on global fits of $\mathbb{Z}_2$ and $\mathbb{Z}_3$ scalar singlet dark matter

Scalar singlet dark matter is one of the simplest and most predictive realisations of the WIMP (weakly-interacting massive particle) idea. Although the model is constrained from all directions by the latest experimental data, it still has viable regions of parameter space. Another compelling aspect of scalar singlets is their ability to stabilise the electroweak vacuum. Indeed, models of scalar dark matter are not low-energy effective theories, but can be valid all the way to the Planck scale. Using the GAMBIT framework, we present the first global fit to include both the low-energy experimental constraints and the theoretical constraints from UV physics, considering models with a scalar singlet charged under either a $\mathbb{Z}_2$ or a $\mathbb{Z}_3$ symmetry. We show that if the model is to satisfy all experimental constraints, completely stabilise the electroweak vacuum up to high scales, and also remain perturbative to those scales, one is driven to a relatively small region of parameter space. This region has a Higgs-portal coupling slightly less than 1, a dark matter mass of 1 to 2 TeV and a spin-independent nuclear scattering cross-section around 10$^{-45}$ cm$^2$.

hep-ph↗

arXiv2018

Self-interacting dark matter with a stable vector mediator

Light vector mediators can naturally induce velocity-dependent dark matter self-interactions while at the same time allowing for the correct dark matter relic abundance via thermal freeze-out. If these mediators subsequently decay into Standard Model states such as electrons or photons however, this is robustly excluded by constraints from the Cosmic Microwave Background. We study to what extent this conclusion can be circumvented if the vector mediator is stable and hence contributes to the dark matter density while annihilating into lighter degrees of freedom. We find viable parts of parameter space which lead to the desired self-interaction cross section of dark matter to address the small-scale problems of the collisionless cold dark matter paradigm while being compatible with bounds from the Cosmic Microwave Background and Big Bang Nucleosynthesis observations.

hep-ph↗

arXiv2018

Model-independent comparison of annual modulation and total rate with direct detection experiments

The relative sensitivity of different direct detection experiments depends sensitively on the astrophysical distribution and particle physics nature of dark matter, prohibiting a model-independent comparison. The situation changes fundamentally if two experiments employ the same target material. We show that in this case one can compare measurements of an annual modulation and exclusion bounds on the total rate while making no assumptions on astrophysics and no (or only very general) assumptions on particle physics. In particular, we show that the dark matter interpretation of the DAMA/LIBRA signal can be conclusively tested with COSINUS, a future experiment employing the same target material. We find that if COSINUS excludes a dark matter scattering rate of about $0.01\,\text{kg}^{-1}\,\text{days}^{-1}$ with an energy threshold of $1.8\,$keV and resolution of $0.2\,$keV, it will rule out all explanations of DAMA/LIBRA in terms of dark matter scattering off sodium and/or iodine.

hep-ph↗