activity
20122026
most citedExtremal problems on shadows and hypercuts in simplicial complexes

9 citations · 16 across the 21 of their papers we have counts for

collaborators
Showing 2023Show all

2 papers · 1 filter

math.PR2023

Noise Sensitivity of the Minimum Spanning Tree of the Complete Graph

Omer Israeli, Yuval Peled

We study the noise sensitivity of the minimum spanning tree (MST) of the -vertex complete graph when edges are assigned independent random weights. It is known that when the gra…

math.CO2023

Rigidity expander graphs

Alan Lew, Eran Nevo, Yuval Peled +1

Jordán and Tanigawa recently introduced the -dimensional algebraic connectivity of a graph . This is a quantitative measure of the -dimensional rigidity of wh…