<div dir="ltr">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.<div><br></div><div>CACM, MARCH 2022, VOL . 65, NO. 3, DOI:10.1145/3510550<br>Chris Edwards, A Group Effort, Researchers look for new insights in the world of hypergraphs<br><div><br></div><div>Further Reading<br>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</div><div><br></div><div>Jost, J. and Mulas, R., Normalized Laplace Operators for Hypergraphs with Real Coefficients, Journal of Complex Networks, Volume 9, Issue 1, February 2021, cnab009</div><div><br>Hillar, C.J., and Lim, L.-H., Most Tensor Problems are NP-Hard, Journal of the ACM, 60, 6, Article 45, November 2013</div><div><br>Veldt, N., Benson, A.R., and Kleinberg, J. Higher-order Homophily is Combinatorially Impossible, arXiv: 2103.11818 (2021), <a href="https://arxiv.org/">https://arxiv.org/</a><br>abs/2103.1181<br><div><br></div><div>-- rec --</div><div><span style="padding:0px;margin:0px;color:transparent;white-space:pre;font-size:13.3333px;font-family:sans-serif">Further Reading</span><span style="padding:0px;margin:0px;color:transparent;white-space:pre;font-size:13.3333px;font-family:serif">Agarwal, S., Branson, K., and Belongie, S.</span><span style="padding:0px;margin:0px;color:transparent;white-space:pre;font-size:13.3333px;font-family:sans-serif">Higher-Order Learning with Graphs</span><span style="padding:0px;margin:0px;color:transparent;white-space:pre;font-size:13.3333px;font-family:serif">Proceedings of the 23rd International </span><span style="padding:0px;margin:0px;color:transparent;white-space:pre;font-size:13.3333px;font-family:serif">Conference on Machine Learning (ICML </span><span style="padding:0px;margin:0px;color:transparent;white-space:pre;font-size:13.3333px;font-family:serif">2006)</span><span style="padding:0px;margin:0px;color:transparent;white-space:pre;font-size:13.3333px;font-family:sans-serif">, pages 17–24</span><span style="padding:0px;margin:0px;color:transparent;white-space:pre;font-size:13.3333px;font-family:serif">Jost, J. and Mulas, R.</span><span style="padding:0px;margin:0px;color:transparent;white-space:pre;font-size:13.3333px;font-family:sans-serif">Normalized Laplace Operators for </span><span style="padding:0px;margin:0px;color:transparent;white-space:pre;font-size:13.3333px;font-family:sans-serif">Hypergraphs with Real Coefficients</span><span style="padding:0px;margin:0px;color:transparent;white-space:pre;font-size:13.3333px;font-family:serif">Journal of Complex Networks</span><span style="padding:0px;margin:0px;color:transparent;white-space:pre;font-size:13.3333px;font-family:sans-serif">, Volume 9, </span><span style="padding:0px;margin:0px;color:transparent;white-space:pre;font-size:13.3333px;font-family:sans-serif">Issue 1, February 2021, cnab009</span><span style="padding:0px;margin:0px;color:transparent;white-space:pre;font-size:13.3333px;font-family:serif">Hillar, C.J., and Lim, L.-H.</span><span style="padding:0px;margin:0px;color:transparent;white-space:pre;font-size:13.3333px;font-family:sans-serif">Most Tensor Problems are NP-Hard</span><span style="padding:0px;margin:0px;color:transparent;white-space:pre;font-size:13.3333px;font-family:serif">Journal of the ACM</span><span style="padding:0px;margin:0px;color:transparent;white-space:pre;font-size:13.3333px;font-family:sans-serif">, 60, 6, Article 45, </span><span style="padding:0px;margin:0px;color:transparent;white-space:pre;font-size:13.3333px;font-family:sans-serif">November 2013</span><span style="padding:0px;margin:0px;color:transparent;white-space:pre;font-size:13.3333px;font-family:serif">Veldt, N., Benson, A.R., and Kleinberg, J.</span><span style="padding:0px;margin:0px;color:transparent;white-space:pre;font-size:13.3333px;font-family:sans-serif">Higher-order Homophily</span><span style="padding:0px;margin:0px;color:transparent;white-space:pre;font-size:13.3333px;font-family:sans-serif">is Combinatorially Impossible</span><span style="padding:0px;margin:0px;color:transparent;white-space:pre;font-size:13.3333px;font-family:serif">arXiv: 2103.11818 (2021)</span><span style="padding:0px;margin:0px;color:transparent;white-space:pre;font-size:13.3333px;font-family:sans-serif">, <a href="https://arxiv.org/">https://arxiv.org/</a></span><span style="padding:0px;margin:0px;color:transparent;white-space:pre;font-size:13.3333px;font-family:sans-serif">abs/2103.11818</span></div></div></div></div>