Lyuben Lichev

activity

20242026

collaborators

Showing math.PRShow all

5 papers · 1 filter

math.PR2026

Diameter and mixing time of the giant component in the percolated hypercube

Michael Anastos, Sahar Diskin, Lyuben Lichev +1

We consider bond percolation on the $d$ -dimensional binary hypercube with $p = c / d$ for fixed $c > 1$ . We prove that the typical diameter of the giant component $L_{1}$ is of order $Î(d…

math.PR2026

On the depth of depth-weighted trees

Lyuben Lichev, Amitai Linker, Bas Lodewijks +1

The depth-weighted tree DWT( $f$ ) with weight function $f : {0, 1, 2, \dots} \to (0, \infty)$ is a dynamic random tree grown from a root $r$ where vertices arrive consecutively and ever…

math.PR2025

On the first and second largest components in the percolated Random Geometric Graph

Lyuben Lichev, Bas Lodewijks, Dieter Mitsche +1

The percolated random geometric graph $G_{n} (I^», p)$ has vertex set given by a Poisson Point Process in the square $[0, n]^{2}$ , and every pair of vertices at distance at most 1…

math.PR2025

Label propagation on binomial random graphs

Marcos Kiwi, Lyuben Lichev, Dieter Mitsche +1

We study the behavior of a label propagation algorithm (LPA) on the ErdÅs-RÃ©nyi random graph $G (n, p)$ . Initially, given a network, each vertex starts with a random labe…

math.PR2024

Lyuben Lichev, Bruno Schapira

We consider a recently introduced model of color-avoiding percolation defined as follows. Every edge in a graph $G$ is colored in some of $k \geq 2$ colors. Two vertices $u$ and $v$ …

Diameter and mixing time of the giant component in the percolated hypercube

On the depth of depth-weighted trees

On the first and second largest components in the percolated Random Geometric Graph

Label propagation on binomial random graphs

Color-avoiding percolation on the ErdÅs-RÃ©nyi random graph

Color-avoiding percolation on the ErdÅs-RÃ©nyi random graph