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

24 papers

math.CO2026

On the maximal dimension of an irreducible representation of the symmetric group

Amol Aggarwal, Dor Elboim

We prove that the maximal dimension of an irreducible representation of the symmetric group satisfies $$d_N=\sqrt{N!} \, e^{-(\mathfrak{d}+o(1))\sqrt{N} }, \quad N\to \…

math.PR2026

Once-reinforced random walk in high dimensions

Dor Elboim, Gady Kozma

We study the once-reinforced random walk on , which is a self-interacting walk that has a higher probability to cross edges that were already visited. We prove that th…

math.PR2025

Diffusivity of the Lorentz mirror walk in high dimensions

Dor Elboim, Antoine Gloria, Felipe Hernández

In the Lorentz mirror walk in dimension , mirrors are randomly placed on the vertices of at density . A light ray is then shot from the origin an…

math.PR2025

Optimal matchings of randomly perturbed lattices

Dor Elboim, Yinon Spinka, Oren Yakir

Consider a point process in Euclidean space obtained by perturbing the integer lattice with independent and identically distributed random vectors. Under mild assumptions on the la…

math.PR2025

Noise sensitivity and variance lower bound for minimal left-right crossing of a square in first-passage percolation

Barbara Dembin, Dor Elboim

We study first-passage percolation on with independent and identically distributed weights, whose common distribution is uniform on with . F…

math.PR2025

The edge-averaging process on graphs with random initial opinions

Dor Elboim, Yuval Peres, Ron Peretz

In several settings (e.g., sensor networks and social networks), nodes of a graph are equipped with initial opinions, and the goal is to estimate the average of these opinions usin…

math.PR2025

Minimal surfaces in strongly correlated random environments

Barbara Dembin, Dor Elboim, Ron Peled

A minimal surface in a random environment (MSRE) is a -dimensional surface in -dimensional space which minimizes the sum of its elastic energy and its environment potenti…

math.PR2024

Small ball probabilities for the passage time in planar first-passage percolation

Dor Elboim

We study planar first-passage percolation with independent weights whose common distribution is supported in and is absolutely continuous with respect to Lebesgue meas…

math-ph2024

Minimal surfaces in random environment

Barbara Dembin, Dor Elboim, Daniel Hadas +1

A minimal surface in a random environment (MSRE) is a surface which minimizes the sum of its elastic energy and its environment potential energy, subject to prescribed boundary con…

math.CO2023

Climbing up a random subgraph of the hypercube

Michael Anastos, Sahar Diskin, Dor Elboim +1

Let be the -dimensional binary hypercube. We say that is an increasing path of length in , if for every 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

Barbara Dembin, Dor Elboim, Ron Peled

We study first-passage percolation on , , with independent weights whose common distribution is compactly supported in with a uniformly-positive d…

math.PR2022

Infinite cycles in the interchange process in five dimensions

Dor Elboim, Allan Sly

In the interchange process on a graph , distinguished particles are placed on the vertices of with independent Poisson clocks on the edges. When the clock of an edge r…

math.CO2022

Heavy and Light Paths and Hamilton Cycles

Sahar Diskin, Dor Elboim

Given a graph , we denote by the number of paths of length in starting from . In graphs of maximum degree 3, with edge weights with ,…

math.PR2022

The Asynchronous DeGroot Dynamics

Dor Elboim, Yuval Peres, Ron Peretz

We analyze the asynchronous version of the DeGroot dynamics: In a connected graph with nodes, each node has an initial opinion in and an independent Poisson clock.…

math.PR2022★ 3 cited

Mixing times and cutoff for the TASEP in the high and low density phase

Dor Elboim, Dominik Schmid

We study the totally asymmetric simple exclusion process with open boundaries in the high density and the low density phase. In the bulk of the two phases, we show that the process…

math.PR2022

Coalescence of geodesics and the BKS midpoint problem in planar first-passage percolation

Barbara Dembin, Dor Elboim, Ron Peled

We consider first-passage percolation on with independent and identically distributed weights whose common distribution is absolutely continuous with a finite exponen…

math.PR2022

On a random model of forgetting

Noga Alon, Dor Elboim, Allan Sly

Georgiou, Katkov and Tsodyks considered the following random process. Let be an infinite sequence of independent, identically distributed, uniform random points i…

math.PR2022

Long lines in subsets of large measure in high dimension

Dor Elboim, Bo'az Klartag

We show that for any set with there exists a line such that the one-dimensional Lebesgue measure of is at least $Ω…

math.CO2021

Random necklaces require fewer cuts

Noga Alon, Dor Elboim, János Pach +1

It is known that any open necklace with beads of types in which the number of beads of each type is divisible by , can be partitioned by at most cuts into intervals…

math.PR2020★ 2 cited

The critical one-dimensional multi-particle DLA

Dor Elboim, Danny Nam, Allan Sly

We study one-dimensional multi-particle Diffusion Limited Aggregation (MDLA) at its critical density . Previous works have verified that the size of the aggregate at tim…

math.NT2020★ 1 cited

Uniform estimates for almost primes over finite fields

Dor Elboim, Ofir Gorodetsky

We establish a new asymptotic formula for the number of polynomials of degree with prime factors over a finite field . The error term tends to uniformly i…

math.NT2019★ 2 cited

Multiplicative arithmetic functions and the generalized Ewens measure

Dor Elboim, Ofir Gorodetsky

Random integers, sampled uniformly from , share similarities with random permutations, sampled uniformly from . These similarities include the Erdős--Kac theorem on the…

math.PR2017

Limit distributions for Euclidean random permutations

Dor Elboim, Ron Peled

We study the length of cycles in the model of spatial random permutations in Euclidean space. In this model, for given length , density , dimension and jump density ,…