Embedded Files
I am a Maryam Mirzakhani postdoctoral fellow at Stanford. Before that I spent one year as a member at the IAS.
I completed my PhD in 2023 at Princeton University under the supervision of Allan Sly. Before that I was a master's student of Ron Peled at Tel Aviv University.
I'm interested in probability theory and applications of probability in mathematical physics and combinatorics.
Contact
dorelboim@gmail.com
Me doing a one-handstand in Times square
Selected papers
Infinite cycles in the interchange process in five dimensions. Submitted.
Joint work with Allan Sly.
Coalescence of geodesics and the BKS midpoint problem in planar first-passage percolation. Geometric and Functional Analysis (GAFA).
Joint work with Barbara Dembin and Ron Peled.
Minimal surfaces in random environment. Submitted.
Joint work with Barbara Dembin, Daniel Hadas and Ron Peled.
The critical one-dimensional multi-particle DLA. Under revision for Forum of Mathematics, Pi.
Joint work with Allan Sly and Danny Nam.
Diffusivity of the Lorentz mirror walk in high dimensions. Submitted.
Joint work with Antoine Gloria and Felipe Hernandez.
All Papers
Optimal matchings of randomly perturbed lattices. Submitted.
Joint work with Yinon Spinka and Oren Yakir.
Diffusivity of the Lorentz mirror walk in high dimensions. Submitted.
Joint work with Antoine Gloria and Felipe Hernandez.
Joint work with Barbara Dembin.
The edge-averaging process on graphs with random initial opinions. Proceedings of the National Academy of Sciences.
Joint work with Yuval Peres and Ron Peretz.
Minimal surfaces in strongly correlated random environments. Submitted.
Joint work with Barbara Dembin and Ron Peled.
Small ball probabilities for the passage time in planar first-passage percolation. Electronic Communications in Probability.
Minimal surfaces in random environment. Submitted. [A talk by Ron]
Joint work with Barbara Dembin, Daniel Hadas and Ron Peled.
Optimal sample complexity of contrastive learning. ICLR 2024 (spotlight paper).
Joint work with Noga Alon, Dmitrii Avdiukhin, Orr Fischer and Grigory Yaroslavtsev.
Climbing up a random subgraph of the hypercube. Electronic Communications in Probability.
Joint work with Michael Anastos, Sahar Diskin and Michael Krivelevich.
On the influence of edges in first-passage percolation. Annals of Probability.
Joint work with Barbara Dembin and Ron Peled.
Infinite cycles in the interchange process in five dimensions. Submitted.
Joint work with Allan Sly. [A talk by Allan]
Heavy and light paths and Hamilton cycles. Information Processing Letters.
Joint work with Sahar Diskin.
Mixing times and cutoff for the TASEP in the high and low density phase. Probability and Mathematical Physics.
Joint work with Dominik Schmid.
The Asynchronous DeGroot Dynamics. Random Structures and Algorithms (RSA).
Joint work with Yuval Peres and Ron Peretz.
Coalescence of geodesics and the BKS midpoint problem in planar first-passage percolation. Geometric and Functional Analysis (GAFA).
Joint work with Barbara Dembin and Ron Peled. [Talks by Ron, Barbara and me]
On a random model of forgetting. Annals of Applied Probability.
Joint work with Noga Alon and Allan Sly. [A talk by Noga]
Long lines in subsets of large measure in high dimension. Probability Theory and Related Fields (PTRF).
Joint work with Bo'az Klartag. [A talk by Bo'az]
Random necklaces require fewer cuts. SIAM Journal on Discrete Mathematics.
Joint work with Noga Alon, Gabor Tardos and Janos Pach. [A talk by Noga]
The critical one-dimensional multi-particle DLA. Submitted.
Joint work with Allan Sly and Danny Nam.
Uniform estimates for almost primes over finite fields. Proceedings of the AMS.
Joint work with Ofir Gorodetsky.
Multiplicative arithmetic functions and the Ewens measure. Israel Journal of Mathematics.
Joint work with Ofir Gorodetsky.
Limit distributions for Euclidean random permutations. Communications in Mathematical Physics (CMP).
Joint work with Ron Peled.
Recorded talks and videos
Recorded talks and videos
Poisson-Dirichlet distribution for the Interchange process on the torus.
The Interchange process and First Passage Percolation (the IAS short talk).
On the influence of edges in First Passage Percolation.
Infinite cycles in the Interchange process in five dimensions.
Coalescence of geodesics and the BKS midpoint problem in first-passage percolation.
The critical one dimensional multi-particle DLA.
A popular video of me not related to math.
A Mathematical Gallery
A Mathematical Gallery
Computer simulation of the memory process
The process
Let X(1),X(2),... be a sequence of i.i.d. uniform random variables in [0,1].
In the memory process, the random variables X(1),X(2),... arrive one after the other. The memory list at time n is a subset S of the variables X(1),...,X(n) defined recursively according to the following rule. When a new variable X(i) arrives, if it is larger than the current minimal element of the list, min(S), then this minimum is deleted from S and X(i) is added. Otherwise, we just add X(i) to S.
The pictures show the content of the list in four independent samples of the process. In the first two samples we run the process for time n=200 and in the last two we run it for time n=1000.
Together with Noga and Allan, we show that the content of the memory list is essentially the set of uniform variables that are larger than 1-1/e. In fact we show that the size of the symmetric difference between these two sets is typically of order n^(1/2) and scales to a 3 dimensional Bessel process.
The first picture shows the normalized size of the list over time (up to time n=1,000,000). We show that it converges to a Brownian motion.
The second picture shows the evolution over time of the number of elements in the list that are smaller than 1-1/e (in blue) and the number of variables that are larger than 1-1/e and were removed from the list (in red). The third picture shows the number of elements in the list smaller than a+2n^(-1/2), a+n^(-1/2), a, a-n^(-1/2), a-2n^(-1/2) for a=1-1/e and n=10^6. We identify the scaling limits of these processes.
A simulation of the edge-averaging process
In this process the vertices of a graph have opinions in [0,1]. The edges are selected at random according to independent Poisson clocks and the opinions of the vertices of each selected edge are replaced by their average.
The pictures show the averaging process on the torus of side length 100 with random (top) and deterministic (bottom) initial opinions. Snapshots taken at times (left to tight) 0, 7, 20, 60, 600.
When the initial opinions are deterministic, it may take polynomial amount of time for the process to reach approximate consensus. Together with Yuval and Ron, we show that when the initial opinions are random (i.i.d.), the convergence is much faster and takes at most (log n)^2 time for any connected graph.
A computer simulation of the one dimensional Multi-particle Diffusion Limited Aggregation (MDLA)
The pictures show the size of the aggregate as a function of time in the subcritical and supercritical cases respectively. The process is run up to time t=300,000 and the different colored graphs are independent samples.
The first picture shows 6 independent samples of the aggregate in the critical case. In this case we show that the aggregate grows at rate t^(2/3).
The second picture shows the speed process corresponding to the blue aggregate (that is, the derivative of the blue curve in the first picture). Together with Allan and Danny, we prove that it converges to a negative power of an (8/3)-dimensional Bessel process.
A computer simulation of the geodesics (shortest paths) in first-passage pecolation.
In this simulation, the edge distribution is uniform in [0,1].
The pictures show two geodesics of length 2000 whose endpoints are at distance of 30. The purple part is the intersection of the two geodesics.
Together with Ron and Barbara, we show that, under mild assumptions on the edge distribution, geodesics of length n whose endpoints are at distance h<<n^(1/8) will coalesce with high probability.
Minimal surfaces in random environment.
This is a generalization of first passage percolation.
In first passage percolation we study the geodesics in a random environment (random weights). A geodesic is a path such that the sum of weights along the path is minimal. In this work we study the surface (say with zero boundary condition) such that the sum of weights on the surface is minimal.
For a d dimensional minimal surface in a (d+n) dimensional random environment, we study the fluctuations of the surface and how far it is from being flat. In particular, we want to understand whether the surface is localized (the fluctuations are bounded as the side length of the box tends to infinity) or delocalized (the fluctuations tend to infinity).
Together with Barbara, Daniel and Ron, we prove that (for all n) the surfaces are delocalized in dimensions d=1,2,3,4 and localized in dimensions d=5 or higher!
A simulation of a minimal surface with d=1 and n=1.
A simulation of a minimal surface with d=1 and n=2.
A simulation of a minimal surface with d=2 and n=1.
More precisely, for n=1 we obtain the following upper and lower bounds on the fluctuations of the surface as a function of the side length of the box (L).
The cycle structure of random Euclidean permutations
This is a simulation of a random Euclidean permutation on the 2 dimensional torus. The permutation is of size N=50 and the side length L of the torus changes in each picture. Each cycle of the permutation has a different color. Together with Ron, we prove that there is a phase transition in the cycle lengths when the density of points becomes logarithmic. We show that when N/L^2<c log(N), the cycles are finite and when N/L^2>clog(N), the cycles are macroscopic (of order N) and have the Poisson-Dirichlet distribution (for some explicit constant c).
Google Sites
Report abuse