Zobrazeno 1 - 10
of 174
pro vyhledávání: '"Kiwi, Marcos"'
Publikováno v:
In Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science (FOCS 2024)
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 comparison operation of the algorithm is followed by a sequence of evolu
Externí odkaz:
http://arxiv.org/abs/2404.08162
We study the behavior of a label propagation algorithm (LPA) on the Erd\H{o}s-R\'enyi random graph $\mathcal{G}(n,p)$. Initially, given a network, each vertex starts with a random label in the interval $[0,1]$. Then, in each round of LPA, every verte
Externí odkaz:
http://arxiv.org/abs/2302.03569
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 $(2,3)$. In particular, we first focus on the expected time for a random walk to
Externí odkaz:
http://arxiv.org/abs/2207.06956
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 al., we introduce a dynamic model of hyperbolic graphs in which vertice
Externí odkaz:
http://arxiv.org/abs/2203.00209
Publikováno v:
European Journal of Combinatorics, Volume 98, 2021
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 investigate the notion of uniform distribution of letters over interv
Externí odkaz:
http://arxiv.org/abs/2003.03664
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Kiwi, Marcos, Mitsche, Dieter
We show that in the random hyperbolic graph model as formalized by Gugelmann et al. in the most interesting range of $\frac12 < \alpha < 1$ the size of the second largest component is $\Theta((\log n)^{1/(1-\alpha)})$, thus answering a question of Bo
Externí odkaz:
http://arxiv.org/abs/1712.02828
Publikováno v:
In European Journal of Combinatorics December 2021 98
Autor:
Kiwi, Marcos, Mitsche, Dieter
Random hyperbolic graphs have been suggested as a promising model of social networks. A few of their fundamental parameters have been studied. However, none of them concerns their spectra. We consider the random hyperbolic graph model as formalized b
Externí odkaz:
http://arxiv.org/abs/1606.02240
Autor:
Kiwi, Marcos, Mitsche, Dieter
Random hyperbolic graphs were recently introduced by Krioukov et. al. [KPKVB10] as a model for large networks. Gugelmann, Panagiotou, and Peter [GPP12] then initiated the rigorous study of random hyperbolic graphs using the following model: for $\alp
Externí odkaz:
http://arxiv.org/abs/1408.2947