Vedat Levi Alev

collaborators

3 papers

math.CO2026

Faster Mixing for Triangulations via Transport Flows

Vedat Levi Alev, Daniel Frishberg, Michail Sarantis +1

We prove an $O (n^{2})$ bound for the relaxation time and the log-Sobolev time (inverse log-Sobolev constant) of the classical triangulation flip chain on a convex $(n + 2)$ -…

cs.DM2026

Sequential Sweeps and High Dimensional Expansion

Vedat Levi Alev, Ori Parzanchevski

It is well known that the spectral gap of the down-up walk over an $n$ -partite simplicial complex (also known as Glauber dynamics) cannot be better than $O (1/ n)$ due to natural obs…

cs.DS2026

Hypergraph Samplers: Typical and Worst Case Behavior

Vedat Levi Alev, Uriya A. First

We study the utility and limitations of using $k$ -uniform hypergraphs $H = ([n], E)$ ( $n \geq poly (k)$ ) in the context of error reduction for randomized algorithms for deci…