Kiril Bangachev

most citedRandom Algebraic Graphs and Their Convergence to Erdos-Renyi

2 citations · 4 across the 5 of their papers we have counts for

collaborators

Showing math.PRShow all

2 papers · 1 filter

math.PR2024★ 1 cited

Sandwiching Random Geometric Graphs and Erdos-Renyi with Applications: Sharp Thresholds, Robust Testing, and Enumeration

Kiril Bangachev, Guy Bresler

The distribution $RGG (n, S^{d - 1}, p)$ is formed by sampling independent vectors ${V_{i}}_{i = 1}^{n}$ uniformly on $S^{d - 1}$ and placing an edge between pair…

math.PR2023★ 2 cited

Random Algebraic Graphs and Their Convergence to Erdos-Renyi

Kiril Bangachev, Guy Bresler

A random algebraic graph is defined by a group $G$ with a uniform distribution over it and a connection $σ : G ⟶ [0, 1]$ with expectation $p,$ satisfying $σ (g) = σ (g^{- 1}) .$ …