Dor Elboim

activity

20172026

most citedMixing times and cutoff for the TASEP in the high and low density phase

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

collaborators

Showing 2023Show all

3 papers · 1 filter

math.CO2023

Climbing up a random subgraph of the hypercube

Michael Anastos, Sahar Diskin, Dor Elboim +1

Let $Q^{d}$ be the $d$ -dimensional binary hypercube. We say that $P = {v_{1}, \dots, v_{k}}$ is an increasing path of length $k - 1$ in $Q^{d}$ , if for every $i \in [k - 1]$ the edge $v_iv_{i+1…

cs.LG2023

Optimal Sample Complexity of Contrastive Learning

Noga Alon, Dmitrii Avdiukhin, Dor Elboim +2

Contrastive learning is a highly successful technique for learning representations of data from labeled tuples, specifying the distance relations within the tuple. We study the sam…

math.PR2023

On the influence of edges in first-passage percolation on $Z^{d}$

Barbara Dembin, Dor Elboim, Ron Peled

We study first-passage percolation on $Z^{d}$ , $d \geq 2$ , with independent weights whose common distribution is compactly supported in $(0, \infty)$ with a uniformly-positive d…

Climbing up a random subgraph of the hypercube

Optimal Sample Complexity of Contrastive Learning

On the influence of edges in first-passage percolation on Zd

On the influence of edges in first-passage percolation on $Z^{d}$