Elad Aigner-Horev

activity

20102026

most citedInfinite matroid union

17 citations · 47 across the 21 of their papers we have counts for

collaborators

28 papers

math.CO2026

Exact-palette rainbow embeddings in uniformly coloured pseudorandom graphs

Elad Aigner-Horev, Dan Hefetz, Yury Person +1

We study rainbow spanning configurations in bijumbled graphs whose edges are coloured independently and uniformly from a prescribed palette. For $n$ -vertex $(p, β)$ -bijumbled graphs…

math.CO2026

Resilience of rainbow Hamilton cycles in pseudorandom graphs

Elad Aigner-Horev, Dan Hefetz, Yury Person

For every fixed $ε \in (0, 1/2)$ , we prove that every spanning subgraph $H$ of an $n$ -vertex $(p, β)$ -bijumbled graph satisfying $δ (H) \geq (1/2 + ε) p n$ contains a rain…

math.CO2026

Rainbow spanning configurations in uniformly coloured pseudorandom graphs

Elad Aigner-Horev, Dan Hefetz, Yury Person +1

We prove a quantitative palette-transference principle for rainbow spanning configurations in uniformly edge-coloured pseudorandom graphs. The input to our transference principle i…

cs.LG2026

The Sample Complexity of Distributionally Robust PAC Learning under Cressie--Read Divergences

Elad Aigner-Horev, Daniel Rosenberg, Roi Weiss

We study distributionally robust PAC learning for the $0$ -- $1$ -loss, where adversarial perturbations of the data distribution are constrained by a Cressie--Read divergence of order…

math.PR2025

Smoothed analysis in compressed sensing

Elad Aigner-Horev, Dan Hefetz, Michael Trushkin

Arbitrary matrices $M \in R^{m \times n}$ , randomly perturbed in an additive manner using a random matrix $R \in R^{m \times n}$ , are shown to asymptotically almo…

math.PR2024

Resilience of Rademacher chaos of low degree

Elad Aigner-Horev, Daniel Rosenberg, Roi Weiss

The {\em resilience} of a Rademacher chaos is the maximum number of adversarial sign-flips that the chaos can sustain without having its largest atom probability significantly alte…