Simi Haber

activity

20052026

most citedOptimal shattering of complex networks

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

collaborators

Showing 2026Show all

2 papers · 1 filter

math.PR2026

First-Order Laws for Random Geometric Graphs on the Torus

Simi Haber, Mostafa Mirabi, Saharon Shelah

Let $G_{D} (n; r)$ be the random geometric graph generated by $n$ independent uniform points on the $D$ -dimensional torus, with adjacency defined by torus $L^{\infty}$ -distance at most $…

math.CO2026

On the most reliable graphs with fixed redundancy

Rotem Brand, Reuven Cohen, Simi Haber +1

The all-terminal reliability of a graph $G$ is the probability that $G$ remains connected when each edge fails independently with probability $p$ . For fixed $n$ and $m$ , the unifor…