Abstract
Hypergraphs are natural generalization of graphs in which a single (hyper)edge can connect any number of vertices. As a result, hypergraphs are suitable and useful to model many important networks and processes. Typical applications are related to social data analysis and include situations such as exchanging emails with several recipients, reviewing products on social platforms, or analyzing security vulnerabilities of information networks. In many situations, using hypergraphs instead of classical graphs allows us to better capture and analyze dependencies within the network. In this paper, we propose a new library, named SimpleHypergraphs.jl, designed for efficient hypegraph analysis. The library exploits the Julia language flexibility and direct support for distributed computing in order to bring a new quality for simulating and analyzing processes represented as hypergraphs. In order to show how the library can be used we study two case studies based on the Yelp dataset. Results are promising and confirm the ability of hypergraphs to provide more insight than standard graph-based approaches.
The research is financed by NAWA—The Polish National Agency for Academic Exchange.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
GSPBox, MATLAB (2019). https://github.com/epfl-lts2/gspbox
HALP, Python (2019). https://github.com/Murali-group/halp
HyperGaph, Chapel (2019). https://github.com/pnnl/chgl (2019)
HyperGraphLib, C++ (2019). https://github.com/alex-87/HyperGraphLib
HyperNetX, Python (2019). https://github.com/pnnl/HyperNetX
HyperX, Scala (2019). https://github.com/jinhuang/hyperx
IPER, JavaScript (2019). https://github.com/fibo/iper
LightGraphs.jl, Julia (2019). https://github.com/JuliaGraphs/LightGraphs.jl
Multihypergraph, Python (2019). https://github.com/vaibhavkarve/multihypergraph
networkR, R (2019). https://github.com/O1sims/networkR
PyGraph, Python (2019). https://github.com/jciskey/pygraph
Yelp (2019). https://www.reuters.com/finance/stocks/company-profile/YELP.N
Yelp-dataset (2019). https://www.yelp.com/dataset/challenge
Yelp-dataset-docs (2019). https://www.yelp.com/dataset/documentation/main
Antelmi, A., Cordasco, G., Spagnuolo, C., Vicidomini, L.: On evaluating graph partitioning algorithms for distributed agent based models on networks. In: Hunold, S., et al. (eds.) Euro-Par 2015. LNCS, vol. 9523, pp. 367–378. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-27308-2_30
Bezanson, J., Edelman, A., Karpinski, S., Shah, V.B.: Julia: a fresh approach to numerical computing. SIAM Rev. 59(1), 65–98 (2017)
Bretto, A.: Hypergraph Theory: An Introduction. Springer, Cham (2013). https://doi.org/10.1007/978-3-319-00080-0
Cordasco, G., Spagnuolo, C., Scarano, V.: Toward the new version of D-MASON: efficiency, effectiveness and correctness in parallel and distributed agent-based simulations. In: 2016 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), pp. 1803–1812 (2016)
Cordasco, G., De Chiara, R., Raia, F., Scarano, V., Spagnuolo, C., Vicidomini, L.: Designing computational steering facilities for distributed agent based simulations. In: Proceedings of the 1st ACM SIGSIM Conference on Principles of Advanced Discrete Simulation, pp. 385–390 (2013)
Danon, L., Díaz-guilera, A., Duch, J.: Comparing community structure identification. J. Stat. Mech. Theory Exp. (2005)
Edelman, A.: Julia: a fresh approach to technical computing and data processing. Technical report, Massachusetts Institute of Technology, Cambridge (2019)
Gulati, A., Eirinaki, M.: Influence propagation for social graph-based recommendations. In: 2018 IEEE International Conference on Big Data (Big Data), pp. 2180–2189 (2018)
Ji, Z., Pi, H., Wei, W., Xiong, B., Woźniak, M., Damasevicius, R.: Recommendation based on review texts and social communities: a hybrid model. IEEE Access 7, 40416–40427 (2019)
Kaminski, B., Poulin, V., Pralat, P., Szufel, P., Theberge, F.: Clustering via hypergraph modularity. arXiv preprint arXiv:1810.04816 (2018)
Li, R., Jiang, J.Y., Ju, C.J.T., Wang, W.: CORALS: who are my potential new customers? Tapping into the wisdom of customers’ decisions. In: Proceedings of the Twelfth ACM International Conference on Web Search and Data Mining, WSDM 2019, pp. 69–77 (2019)
Lu, X., Qu, J., Jiang, Y., Zhao, Y.: Should i invest it?: predicting future success of yelp restaurants. In: Proceedings of the Practice and Experience on Advanced Research Computing, PEARC 2018, pp. 64:1–64:6 (2018)
Newman, M.E., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69(2), 026113 (2004)
Raghavan, U.N., Albert, R., Kumara, S.: Near linear time algorithm to detect community structures in large-scale networks. Phys. Rev. E Stat. Nonlinear Soft Matter Phys. 76 (2007)
Regier, J., et al.: Cataloging the visible universe through Bayesian inference in Julia at Petascale. J. Parallel Distrib. Comput. (2019)
Vinh, N.X., Epps, J., Bailey, J.: Information theoretic measures for clusterings comparison: variants, properties, normalization and correction for chance. J. Mach. Learn. Res. 11, 2837–2854 (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Antelmi, A. et al. (2019). SimpleHypergraphs.jl—Novel Software Framework for Modelling and Analysis of Hypergraphs. In: Avrachenkov, K., Prałat, P., Ye, N. (eds) Algorithms and Models for the Web Graph. WAW 2019. Lecture Notes in Computer Science(), vol 11631. Springer, Cham. https://doi.org/10.1007/978-3-030-25070-6_9
Download citation
DOI: https://doi.org/10.1007/978-3-030-25070-6_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-25069-0
Online ISBN: 978-3-030-25070-6
eBook Packages: Computer ScienceComputer Science (R0)