There's a little news burp about hypergraphs in this month's CACM, mostly about how hard they are, except when they reduce to graphs, and that the NSF is funding some research efforts.
CACM, MARCH 2022, VOL . 65, NO. 3, DOI:10.1145/3510550 Chris Edwards, A Group Effort, Researchers look for new insights in the world of hypergraphs Further Reading Agarwal, S., Branson, K., and Belongie, S. Higher-Order Learning with Graphs, Proceedings of the 23rd International Conference on Machine Learning (ICML 2006), pages 17–24 Jost, J. and Mulas, R., Normalized Laplace Operators for Hypergraphs with Real Coefficients, Journal of Complex Networks, Volume 9, Issue 1, February 2021, cnab009 Hillar, C.J., and Lim, L.-H., Most Tensor Problems are NP-Hard, Journal of the ACM, 60, 6, Article 45, November 2013 Veldt, N., Benson, A.R., and Kleinberg, J. Higher-order Homophily is Combinatorially Impossible, arXiv: 2103.11818 (2021), https://arxiv.org/ abs/2103.1181 -- rec -- Further ReadingAgarwal, S., Branson, K., and Belongie, S.Higher-Order Learning with GraphsProceedings of the 23rd International Conference on Machine Learning (ICML 2006), pages 17–24Jost, J. and Mulas, R.Normalized Laplace Operators for Hypergraphs with Real CoefficientsJournal of Complex Networks, Volume 9, Issue 1, February 2021, cnab009Hillar, C.J., and Lim, L.-H.Most Tensor Problems are NP-HardJournal of the ACM, 60, 6, Article 45, November 2013Veldt, N., Benson, A.R., and Kleinberg, J.Higher-order Homophilyis Combinatorially ImpossiblearXiv: 2103.11818 (2021), https://arxiv.org/ abs/2103.11818
.-- .- -. - / .- -.-. - .. --- -. ..--.. / -.-. --- -. .--- ..- --. .- - . FRIAM Applied Complexity Group listserv Zoom Fridays 9:30a-12p Mtn UTC-6 bit.ly/virtualfriam un/subscribe http://redfish.com/mailman/listinfo/friam_redfish.com FRIAM-COMIC http://friam-comic.blogspot.com/ archives: 5/2017 thru present https://redfish.com/pipermail/friam_redfish.com/ 1/2003 thru 6/2021 http://friam.383.s1.nabble.com/
