6 citations · 12 across the 17 of their papers we have counts for
20 papers
About a ball removal process on bins
José Correa, Marcos Kiwi, Vasilis Livanos +2
We consider a basic balls-and-bins question in which you have to distribute balls into bins. Then, round by round, a ball is removed from a non-empty bin chosen uniformly a…
Naively Sorting Evolving Data is Optimal and Robust
George Giakkoupis, Marcos Kiwi, Dimitrios Los
We study sorting in the evolving data model, introduced by [AKMU11], where the true total order changes while the sorting algorithm is processing the input. More precisely, each co…
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…
Cover and Hitting Times of Hyperbolic Random Graphs
Marcos Kiwi, Markus Schepers, John Sylvester
We study random walks on the giant component of Hyperbolic Random Graphs (HRGs), in the regime when the degree distribution obeys a power law with exponent in the range . In…
Tail bounds for detection times in mobile hyperbolic graphs
Marcos Kiwi, Amitai Linker, Dieter Mitsche
Motivated by Krioukov et al.'s model of random hyperbolic graphs for real-world networks, and inspired by the analysis of a dynamic model of graphs in Euclidean space by Peres et a…
Quasi-random words and limits of word sequences
Hiêp Hàn, Marcos Kiwi, Matías Pavez-Signé
Words are sequences of letters over a finite alphabet. We study two intimately related topics for this object: quasi-randomness and limit theory. With respect to the first topic we…