activity
20202026
most citedOn the modularity of 3-regular random graphs and random graphs with given degree sequences

4 citations · 21 across the 45 of their papers we have counts for

collaborators
Showing 2023Show all

6 papers · 1 filter

math.PR2023

Brownian snails with removal die out in one dimension

Ivailo Hartarsky, Lyuben Lichev

Brownian snails with removal is a spatial epidemic model defined as follows. Initially, a homogeneous Poisson process of susceptible particles on with intensity …

math.CO2023★ 2 cited

Local dimer dynamics in higher dimensions

Ivailo Hartarsky, Lyuben Lichev, Fabio Toninelli

We consider local dynamics of the dimer model (perfect matchings) on hypercubic boxes . These consist of successively switching the dimers along alternating cycles of prescr…

math.CO2023

Sharp threshold for embedding balanced spanning trees in random geometric graphs

Alberto Espuny Díaz, Lyuben Lichev, Dieter Mitsche +1

A rooted tree is balanced if the degree of a vertex depends only on its distance to the root. In this paper we determine the sharp threshold for the appearance of a large family of…

math.CO2023

Large monochromatic components in colorings of complete hypergraphs

Lyuben Lichev, Sammy Luo

Gyárfás famously showed that in every -coloring of the edges of the complete graph , there is a monochromatic connected component with at least vertices. A…

math.PR2023

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 . Initially, given a network, each vertex starts with a random label…

math.PR2023

Color-avoiding percolation of random graphs: between the subcritical and the intermediate regime

Lyuben Lichev

Fix a graph in which every edge is colored in some of colors. Two vertices and are CA-connected if and may be connected using any subset of col…