Kiril Bangachev

most citedRandom Algebraic Graphs and Their Convergence to Erdos-Renyi

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

collaborators

4 papers

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.ST2024

On The Fourier Coefficients of High-Dimensional Random Geometric Graphs

Kiril Bangachev, Guy Bresler

The random geometric graph $RGG (n, S^{d - 1}, p)$ is formed by sampling $n$ i.i.d. vectors ${V_{i}}_{i = 1}^{n}$ uniformly on $S^{d - 1}$ and placing an edge be…

math.ST2023

Detection of $L_{\infty}$ Geometry in Random Geometric Graphs: Suboptimality of Triangles and Cluster Expansion

Kiril Bangachev, Guy Bresler

In this paper we study the random geometric graph $RGG (n, T^{d}, Unif, σ_{p}^{q}, p)$ with $L_{q}$ distance where each vertex is sampled uniformly from the $d$ -dimen…

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}) .$ …

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

On The Fourier Coefficients of High-Dimensional Random Geometric Graphs

Detection of L∞​ Geometry in Random Geometric Graphs: Suboptimality of Triangles and Cluster Expansion

Random Algebraic Graphs and Their Convergence to Erdos-Renyi

Detection of $L_{\infty}$ Geometry in Random Geometric Graphs: Suboptimality of Triangles and Cluster Expansion