DROPS

Document

DOI: 10.4230/LIPIcs.FUN.2022.21

Fun with FUN

Authors: Fabien Mathieu and Sébastien Tixeuil

Published in: LIPIcs, Volume 226, 11th International Conference on Fun with Algorithms (FUN 2022)

Abstract

The notions of scientific community and research field are central elements for researchers and the articles they publish. We propose to explore the evolution of the FUN conference community since its creation from the articles listed in DBLP, authors, program committees, and advertised themes, by means of a novel symmetric embedding, and carefully crafted software tools. Our results make it possible on the one hand to better understand the evolution of the community, and on the other hand to easily integrate new themes or researchers during future editions.

Cite as

Fabien Mathieu and Sébastien Tixeuil. Fun with FUN. In 11th International Conference on Fun with Algorithms (FUN 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 226, pp. 21:1-21:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)

Copy BibTex To Clipboard

@InProceedings{mathieu_et_al:LIPIcs.FUN.2022.21,
  author =	{Mathieu, Fabien and Tixeuil, S\'{e}bastien},
  title =	{{Fun with FUN}},
  booktitle =	{11th International Conference on Fun with Algorithms (FUN 2022)},
  pages =	{21:1--21:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-232-7},
  ISSN =	{1868-8969},
  year =	{2022},
  volume =	{226},
  editor =	{Fraigniaud, Pierre and Uno, Yushi},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2022.21},
  URN =		{urn:nbn:de:0030-drops-159913},
  doi =		{10.4230/LIPIcs.FUN.2022.21},
  annote =	{Keywords: Natural Language Processing, Relevance Propagation, Bibliometry, Community, Scientific Fields}
}

Document

DOI: 10.4230/LIPIcs.OPODIS.2016.21

Kleinberg’s Grid Reloaded

Authors: Fabien Mathieu

Published in: LIPIcs, Volume 70, 20th International Conference on Principles of Distributed Systems (OPODIS 2016)

Abstract

One of the key features of small-worlds is the ability to route messages with few hops only using local knowledge of the topology. In 2000, Kleinberg proposed a model based on an augmented grid that asymptotically exhibits such property. In this paper, we propose to revisit the original model from a simulation-based perspective. Our approach is fueled by a new algorithm that uses dynamic rejection sampling to draw augmenting links. The speed gain offered by the algorithm enables a detailed numerical evaluation. We show for example that in practice, the augmented scheme proposed by Kleinberg is more robust than predicted by the asymptotic behavior, even for very large finite grids. We also propose tighter bounds on the performance of Kleinberg's routing algorithm. At last, we show that fed with realistic parameters, the model gives results in line with real-life experiments.

Cite as

Fabien Mathieu. Kleinberg’s Grid Reloaded. In 20th International Conference on Principles of Distributed Systems (OPODIS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 70, pp. 21:1-21:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)

Copy BibTex To Clipboard

@InProceedings{mathieu:LIPIcs.OPODIS.2016.21,
  author =	{Mathieu, Fabien},
  title =	{{Kleinberg’s Grid Reloaded}},
  booktitle =	{20th International Conference on Principles of Distributed Systems (OPODIS 2016)},
  pages =	{21:1--21:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-031-6},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{70},
  editor =	{Fatourou, Panagiota and Jim\'{e}nez, Ernesto and Pedone, Fernando},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2016.21},
  URN =		{urn:nbn:de:0030-drops-70908},
  doi =		{10.4230/LIPIcs.OPODIS.2016.21},
  annote =	{Keywords: Small-World Routing,Kleinberg’s Grid, Simulation, Rejection Sampling}
}

Search Results

Documents authored by Mathieu, Fabien

Fun with FUN

Abstract

Cite as

Kleinberg’s Grid Reloaded

Abstract

Cite as

Thanks for your feedback!

Could not send message