Noela S. Müller

activity

20152023

most citedNear optimal efficient decoding from pooled data

3 citations · 3 across the 4 of their papers we have counts for

collaborators

8 papers

math.PR2023

On a Near-Optimal \& Efficient Algorithm for the Sparse Pooled Data Problem

Max Hahn-Klimroth, Remco van der Hofstad, Noela Müller +1

The pooled data problem asks to identify the unknown labels of a set of items from condensed measurements. More precisely, given $n$ items, assume that each item has a label in $\c…

math.CO2023

The hitting time of clique factors

Annika Heckel, Marc Kaufmann, Noela Müller +1

In a recent paper, Kahn gave the strongest possible, affirmative, answer to Shamir's problem, which had been open since the late 1970s: Let $r \geq 3$ and let $n$ be divisible by $…

math.CO2023

The rank of sparse symmetric matrices over arbitrary fields

Remco van der Hofstad, Noela Müller, Haodong Zhu

Let $\FF$ be an arbitrary field and $(G_{n, d / n})_{n}$ be a sequence of sparse weighted Erdős-Rényi random graphs on $n$ vertices with edge probability $d / n$ , where weights from…

cs.NI2021

Multi-Band Wi-Fi Sensing with Matched Feature Granularity

Jianyuan Yu, Pu, Wang +4

Complementary to the fine-grained channel state information (CSI) from the physical layer and coarse-grained received signal strength indicator (RSSI) measurements, the mid-grained…

cs.IT2021★ 3 cited

Near optimal efficient decoding from pooled data

Max Hahn-Klimroth, Noela Müller

Consider $n$ items, each of which is characterised by one of $d + 1$ possible features in ${0, \dots, d}$ . We study the inference task of learning these types by queries on subset…

math.CO2017

The satisfiability threshold for random linear equations

Peter Ayre, Amin Coja-Oghlan, Pu Gao +1

Let $A$ be a random $m \times n$ matrix over the finite field $F_{q}$ with precisely $k$ non-zero entries per row and let $y \in F_{q}^{m}$ be a random vector chosen independently of $A$ .…

math.PR2016

Refined Asymptotics for the Composition of Cyclic Urns

Noela Müller, Ralph Neininger

A cyclic urn is an urn model for balls of types $0, \dots, m - 1$ . The urn starts at time zero with an initial configuration. Then, in each time step, first a ball is drawn from the u…

math.PR2015

The CLT Analogue for Cyclic Urns

Noela S. Müller, Ralph Neininger

A cyclic urn is an urn model for balls of types $0, \dots, m - 1$ where in each draw the ball drawn, say of type $j$ , is returned to the urn together with a new ball of type $j+1 \mod…