Y. Peled

activity

20242026

collaborators

8 papers

math.CO2026

On the $d$ -rigidity phase transition in random graphs

Yuval Peled

We study generic $d$ -dimensional rigidity in sparse random graphs. Our main result is that for every $d \geq 2$ , the Erdős--Rényi random graph $G \sim G (n, c / n)$ undergoes a $d$ -rigidi…

math.PR2026

Local limits of determinantal processes

Asaf Nachmias, Yuval Peled

Let $H_{n}$ be the row space of a signed adjacency matrix of a $C_{4}$ -free bipartite bi-regular graph in which one part has degree $d (n) \to \infty$ and the other part has degree $k + 1$ …

math.PR2025

Sharp Fuss-Catalan thresholds in graph bootstrap percolation

Zsolt Bartha, Brett Kolesnik, Gal Kronenberg +1

We study graph bootstrap percolation on the ErdÅs-RÃ©nyi random graph $G_{n, p}$ . For all $r \geq 5$ , we locate the sharp $K_{r}$ -percolation threshold $p_c \sim (Î³n)^{-1/…

math.GR2025

Cocycle stability in permutations of random simplicial complexes

Michael Chapman, Yuval Peled

Finding a non-sofic hyperbolic group will resolve two major problems in geometric group theory: Are there non sofic groups? Are there non residually finite hyperbolic groups? In th…

math.CO2025

The typical algebraic shifting of a surface

Denys Bulavka, Eran Nevo, Yuval Peled

We initiate a statistical study of Kalai's exterior algebraic shifting, focusing on concentration phenomena for random triangulations of a fixed space. First, for a uniform $n$ -ver…

math.CO2025

When does a tree activate the random graph?

Asaf Cohen Antonir, Yuval Peled, Asaf Shapira +2

Let $F$ and $G$ be two graphs. A spanning subgraph $H$ of $G$ is called weakly $F$ -saturated if one can add to $H$ the edges of $G ∖ H$ in some order, so that whenever a ne…