Moritz Von Looz
Abstract
Generative network models play an important role in algorithm development, scaling studies, network analysis, and realistic system benchmarks for graph data sets. A complex network model gaining considerable popularity builds random hyperbolic graphs, generated by distributing points within a disk in the hyperbolic plane and then adding edges between points with a probability depending on their hyperbolic distance.
We present a dynamic extension to model gradual network change, while preserving at each step the point position probabilities. To process the dynamic changes efficiently, we formalize the concept of a probabilistic neighborhood: Let P be a set of n points in Euclidean or hyperbolic space, q a query point, dist a distance metric, and f : R+ → [0, 1] a monotonically decreasing function. Then, the probabilistic neighborhood N(q, f) of q with respect to f is a random subset of P and each point p ∈ P belongs to N(q, f) with probability f(dist(p, q)). We present a fast, sublinear-time query algorithm to sample probabilistic neighborhoods from planar point sets. For certain distributions of planar P, we prove that our algorithm answers a query in O((|N(q, f)| + √n) log n) time with high probability. This enables us to process a node movement in random hyperbolic graphs in sublinear time, resulting in a speedup of about one order of magnitude in practice compared to the fastest previous approach. Apart from that, our query algorithm is also applicable to Euclidean geometry, making it of independent interest for other sampling or probabilistic spreading scenarios.
- Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Jeff M. Phillips, Ke Yi, and Wuzhou Zhang. 2013. Nearest neighbor searching under uncertainty II. In Proceedings of the 32nd Symposium on Principles of Database Systems (PODS’13). ACM, 115--126. Google Scholar
Digital Library
- Lars Arge and Kasper Green Larsen. 2012. I/O-efficient spatial data structures for range queries. In SIGSPATIAL Special. Vol. 4. ACM, New York, NY, 2--7. Google ScholarDigital Library
- R. Arratia and L. Gordon. 1989. Tutorial on large deviations for the binomial distribution. Bull. Math. Biol. 51, 1 (1989), 125--131.Google ScholarCross Ref
- Vladimir Batagelj and Ulrik Brandes. 2005. Efficient generation of large random networks. Phys. Rev. E 71, 3 (2005), 036113.Google ScholarCross Ref
- Elisabetta Bergamini and Henning Meyerhenke. 2016. Approximating betweenness centrality in fully dynamic networks. Internet Math. 12, 5 (2016), 281--314.Google ScholarCross Ref
- Thomas Bläsius, Tobias Friedrich, Anton Krohmer, and Sören Laue. 2016. Efficient embedding of scale-free graphs in the hyperbolic plane. In Proceedings of the 24th Annual European Symposium on Algorithms (ESA’16) (Leibniz International Proceedings in Informatics (LIPIcs’16)), Piotr Sankowski and Christos Zaroliagis (Eds.), Vol. 57. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 16:1--16:18.Google Scholar
- Michel Bode, Nikolaos Fountoulakis, and Tobias Müller. 2016. The probability of connectivity in a hyperbolic model of complex networks. Random Struct. Algor. 49, 1 (2016), 65--94.Google ScholarCross Ref
- Michel Bode, Nikolaos Fountoulakis, and Tobias Müller. 2013. On the giant component of random hyperbolic graphs. In Proceedings of the 7th European Conference on Combinatorics, Graph Theory and Applications. CRM Series, Vol. 16. Scuola Normale Superiore, 425--429.Google ScholarCross Ref
- Karl Bringmann, Ralph Keusch, and Johannes Lengler. 2017. Sampling geometric inhomogeneous random graphs in linear time. In Leibniz International Proceedings in Informatics (LIPIcs’17), Vol. 87. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.Google Scholar
- Deepayan Chakrabarti and Christos Faloutsos. 2006. Graph mining: Laws, generators, and algorithms. ACM Comput. Surveys 38, 1 (2006), 2. Google ScholarDigital Library
- Tobias Friedrich and Anton Krohmer. 2015. On the diameter of hyperbolic random graphs. Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming (ICALP’15). Springer, Berlin, 614--625. Google ScholarDigital Library
- Luca Gugelmann, Konstantinos Panagiotou, and Ueli Peter. 2012. Random hyperbolic graphs: Degree sequence and clustering. In Proceedings of the 39th International Colloquium on Automata, Languages, and Programming (ICALP’12). Google ScholarDigital Library
- W. Hoeffding. 1963. Probability inequalities for sums of bounded random variables. J. Amer. Stat. Assoc. 58, 301 (1963), 13--30.Google ScholarCross Ref
- Xiaocheng Hu, Miao Qiao, and Yufei Tao. 2014. Independent range sampling. In Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS’14). ACM, 246--255. Google ScholarDigital Library
- Ibrahim Kamel and Christos Faloutsos. 1994. Hilbert R-tree: An improved R-tree using fractals. In Proceedings of the 20th International Conference on Very Large Data Bases (VLDB’94). Morgan Kaufmann Publishers Inc., San Francisco, CA, 500--509. Retrieved from http://dl.acm.org/citation.cfm?id=645920.673001. Google ScholarDigital Library
- Marcos Kiwi and Dieter Mitsche. 2015. A bound for the diameter of random hyperbolic graphs. In Proceedings of the 12th Workshop on Analytic Algorithmics and Combinatorics (ANALCO’15). SIAM, 26--39. Google ScholarDigital Library
- Robert Kleinberg. 2007. Geographic routing using hyperbolic space. In Proceedings of the Annual IEEE International Conference on Computer Communications (INFOCOM’07). 1902--1909. Google ScholarDigital Library
- Tamara G. Kolda, Ali Pinar, Todd Plantenga, and C. Seshadhri. 2014. A scalable generative graph model with community structure. SIAM J. Sci. Comput. 36, 5 (Sep. 2014), C424--C452.Google ScholarCross Ref
- Hans-Peter Kriegel, Peter Kunath, and Matthias Renz. 2007. Probabilistic nearest-neighbor query on uncertain objects. In Advances in Databases: Concepts, Systems and Applications. Springer, 337--348. Google ScholarDigital Library
- Dmitri Krioukov, Fragkiskos Papadopoulos, Maksim Kitsak, Amin Vahdat, and Marián Boguñá. 2010. Hyperbolic geometry of complex networks. Phys. Rev. E 82, 3 (Sep 2010), 036106. Issue 3.Google ScholarCross Ref
- Michael Mitzenmacher and Eli Upfal. 2005. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press. Google ScholarDigital Library
- Mark Newman. 2010. Networks: An Introduction. Oxford University Press. Retrieved from http://books.google.de/books/about/Networks.html?id=q7HVtpYVfC0C&pgis=1. Google ScholarCross Ref
- Fragkiskos Papadopoulos, Maksim Kitsak, M. Ángeles Serrano, Marián Boguná, and Dmitri Krioukov. 2012. Popularity versus similarity in growing networks. Nature 489, 7417 (2012), 537--540.Google Scholar
- Fragkiskos Papadopoulos, Dmitri Krioukov, Marián Boguñá, and Amin Vahdat. 2010. Greedy forwarding in dynamic scale-free networks embedded in hyperbolic metric spaces. In Proceedings of the Annual IEEE International Conference on Computer Communications (INFOCOM’10). IEEE, 1--9. Google ScholarDigital Library
- Jian Pei, Ming Hua, Yufei Tao, and Xuemin Lin. 2008. Query answering techniques on uncertain and probabilistic data: Tutorial summary. In Proceedings of the ACM SIGMOD International Conference on Management of Data. ACM, 1357--1364. Google ScholarDigital Library
- Hanan Samet. 2005. Foundations of Multidimensional and Metric Data Structures. Morgan Kaufmann Publishers Inc., San Francisco, CA. Google ScholarDigital Library
- Christian L. Staudt, Michael Hamann, Ilya Safro, Alexander Gutfraind, and Henning Meyerhenke. 2017. Generating Scaled Replicas of Real-World Complex Networks. Springer International Publishing, Cham, 17--28.Google Scholar
- Christian L. Staudt, Aleksejs Sazonovs, and Henning Meyerhenke. 2016. NetworKit: A tool suite for large-scale complex network analysis. Netw. Sci. 4 (2016), 508–530.Google ScholarCross Ref
- Moritz von Looz and Henning Meyerhenke. 2016. Querying Probabilistic Neighborhoods in Spatial Data Sets Efficiently. Springer International Publishing, Cham, 449--460.Google Scholar
- Moritz von Looz, Henning Meyerhenke, and Roman Prutkin. 2015. Generating random hyperbolic graphs in subquadratic time. ArXiv Preprint arXiv:1501.03545 (Sept. 2015).Google Scholar
- Moritz von Looz, Mustafa Safa Özdayi, Sören Laue, and Henning Meyerhenke. 2016. Generating massive complex networks with hyperbolic geometry faster in practice. In Proceedings of the IEEE High Performance Extreme Computing Conference (HPEC’16). IEEE, 1--6.Google ScholarCross Ref
- Moritz von Looz, Roman Prutkin, and Henning Meyerhenke. 2015. Generating random hyperbolic graphs in subquadratic time. In Proceedings of the 26th International Symposium on Algorithms and Computation (ISAAC’15) (Lecture Notes in Computer Science), Khaled Elbassioni and Kazuhisa Makino (Eds.), Vol. 9472. Springer, Berlin, 467--478.Google ScholarCross Ref
Index Terms
- Updating Dynamic Random Hyperbolic Graphs in Sublinear Time
Recommendations
Cliques in Hyperbolic Random Graphs
Most complex real world networks display scale-free features. This characteristic motivated the study of numerous random graph models with a power-law degree distribution. There is, however, no established and simple model which also has a high ...
Equitable coloring of random graphs
An equitable coloring of a graph is a proper vertex coloring such that the sizes of any two color classes differ by at most one. The least positive integer k for which there exists an equitable coloring of a graph G with k colors is said to be the ...
Updating the complexity status of coloring graphs without a fixed induced linear forest
A graph is H-free if it does not contain an induced subgraph isomorphic to the graph H. The graph P"k denotes a path on k vertices. The @?-Coloring problem is the problem to decide whether a graph can be colored with at most @? colors such that adjacent ...
Comments