activity
20092026
most citedA scaling analysis of a cat and mouse Markov chain

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

collaborators
Showing 2025Show all

2 papers · 1 filter

math.PR2025

Planted clique recovery in random geometric graphs

Konstantin Avrachenkov, Andrei Bobu, Nelly Litvak +1

We investigate the problem of identifying planted cliques in random geometric graphs, focusing on two distinct algorithmic approaches: the first based on vertex degrees (VD) and th…

math.PR2025

The friendship paradox for trees

Rajat Subhra Hazra, Frank den Hollander, Nelly Litvak +1

We analyse the friendship paradox on finite and infinite trees. In particular, we monitor the vertices for which the friendship-bias is positive, neutral and negative, respectively…