Y. Peled

activity

20182020

collaborators

5 papers

math.PR2020

Noise sensitivity of critical random graphs

Eyal Lubetzky, Yuval Peled

We study noise sensitivity of properties of the largest components $(C_{j})_{j \geq 1}$ of the random graph $G (n, p)$ in its critical window $p = (1 + λ n^{- 1/3}) / n$ . For inst…

math.PR2019

Minimum weight disk triangulations and fillings

Itai Benjamini, Eyal Lubetzky, Yuval Peled

We study the minimum total weight of a disk triangulation using vertices out of ${1, \dots, n}$ , where the boundary is the triangle $(123)$ and the $(3 n)$ triangles have ind…

math.CO2018

Expander Graphs -- Both Local and Global

Michael Chapman, Nati Linial, Yuval Peled

Let $G = (V, E)$ be a finite graph. For $v \in V$ we denote by $G_{v}$ the subgraph of $G$ that is induced by $v$ 's neighbor set. We say that $G$ is $(a, b)$ -regular for $a > b > 0$ integers,…

math.CO2018

On simple connectivity of random 2-complexes

Zur Luria, Yuval Peled

The fundamental group of the $2$ -dimensional Linial-Meshulam random simplicial complex $Y_{2} (n, p)$ was first studied by Babson, Hoffman and Kahle. They proved that the threshold pro…

math.CO2018

Enumeration and randomized constructions of hypertrees

Nati Linial, Yuval Peled

Over thirty years ago, Kalai proved a beautiful $d$ -dimensional analog of Cayley's formula for the number of $n$ -vertex trees. He enumerated $d$ -dimensional hypertrees weighted by…