Philipp Loick
YOU?
Author Swipe
Optimization of Next-Day Delivery Coverage using Constraint Programming and Random Key Optimizers Open
We consider the logistics network of an e-commerce retailer, specifically the so-called "middle mile" network, that routes inventory from supply warehouses to distribution stations to be ingested into the terminal ("last mile") delivery ne…
Efficient and Accurate Group Testing via Belief Propagation: An Empirical Study Open
The group testing problem asks for efficient pooling schemes and inference algorithms that allow to screen moderately large numbers of samples for rare infections. The goal is to accurately identify the infected individuals while minimizin…
Improved Bounds for Noisy Group Testing With Constant Tests per Item Open
The group testing problem is concerned with identifying a small set of\ninfected individuals in a large population. At our disposal is a testing\nprocedure that allows us to test several individuals together. In an idealized\nsetting, a te…
Efficient and accurate group testing via Belief Propagation: an empirical study Open
The group testing problem asks for efficient pooling schemes and algorithms that allow to screen moderately large numbers of samples for rare infections. The goal is to accurately identify the infected samples while conducting the least po…
Note on the offspring distribution for group testing in the linear regime Open
The group testing problem is concerned with identifying a small set of $k$ infected individuals in a large population of $n$ people. At our disposal is a testing scheme that can test groups of individuals. A test comes back positive if and…
Generation and validation of a formula to calculate hemoglobin loss on a cohort of healthy adults subjected to controlled blood loss Open
Background The ability to approximate intra-operative hemoglobin loss with reasonable precision and linearity is prerequisite for determination of a relevant surgical outcome parameter: This information enables comparison of surgical proce…
The Ising antiferromagnet in the replica symmetric phase Open
Partition functions are an important research object in combinatorics and mathematical physics [Barvinok, 2016]. In this work, we consider the partition function of the Ising antiferromagnet on random regular graphs and characterize its li…
Optimal group testing Open
In the group testing problem the aim is to identify a small set of k ⁓ n θ infected individuals out of a population size n , 0 < θ < 1. We avail ourselves of a test procedure capable of testing groups of individuals, with the test returnin…
Inference and Mutual Information on Random Factor Graphs Open
Random factor graphs provide a powerful framework for the study of inference problems such as decoding problems or the stochastic block model. Information-theoretically the key quantity of interest is the mutual information between the obs…
Additional file 1 of Generation and validation of a formula to calculate hemoglobin loss on a cohort of healthy adults subjected to controlled blood loss Open
Additional file 1. Excel worksheet for volume loss calculation. Values are pasted into the respective fields, ENTER calculates the incurred blood loss (mean, range).
The Ising antiferromagnet and max cut on random regular graphs Open
The Ising antiferromagnet is an important statistical physics model with close connections to the {\sc Max Cut} problem. Combining spatial mixing arguments with the method of moments and the interpolation method, we pinpoint the replica sy…
Improved bounds for noisy group testing with constant tests per item Open
The group testing problem is concerned with identifying a small set of infected individuals in a large population. At our disposal is a testing procedure that allows us to test several individuals together. In an idealized setting, a test …
Optimal adaptive group testing Open
The group testing problem is concerned with identifying a small number $k \sim n^θ$ for $θ\in (0,1)$ of infected individuals in a large population of size $n$. At our disposal is a testing procedure that allows us to test groups of individ…
Optimal group testing Open
In the group testing problem the aim is to identify a small set of $k\sim n^θ$ infected individuals out of a population size $n$, $0
Optimal non-adaptive group testing Open
In non-adaptive group testing we aim to identify a small set of $k\sim n^\theta$ infected individuals out of a population size $n$, $0<\theta<1$. We avail ourselves to a test procedure that can test a group of individuals, with the test re…
Quantitative Group Testing in the Sublinear Regime: Information-Theoretic and Algorithmic Bounds Open
The quantitative group testing (QGT) problem deals with efficiently identifying a small number of infected individuals among a large population. To this end, we can test groups of individuals where each test returns the total number of inf…
Quantitative Group Testing in the Sublinear Regime. Open
The quantitative group testing (QGT) problem deals with efficiently identifying a small number of infected individuals among a large population. To this end, we can test groups of individuals where each test returns the total number of inf…
On the Parallel Reconstruction from Pooled Data Open
In the pooled data problem the goal is to efficiently reconstruct a binary signal from additive measurements. Given a signal $σ\in \{ 0,1 \}^n$, we can query multiple entries at once and get the total number of non-zero entries in the quer…
Information-Theoretic and Algorithmic Thresholds for Group Testing Open
In the group testing problem we aim to identify a small number of infected individuals within a large population. We avail ourselves to a procedure that can test a group of multiple individuals, with the test result coming out positive iff…