no code implementations • 15 Feb 2024 • Tatyana Benko, Martin Buck, Ilya Amburg, Stephen J. Young, Sinan G. Aksoy
In data science, hypergraphs are natural models for data exhibiting multi-way relations, whereas graphs only capture pairwise.
no code implementations • 16 Oct 2023 • Matthew R. Oster, Ilya Amburg, Samrat Chatterjee, Daniel A. Eisenberg, Dennis G. Thomas, Feng Pan, Auroop R. Ganguly
Here, our notional operator may choose proxy actions to operate an interdependent system comprised of fuel terminals and gas stations (functioning as supplies) and a transportation network with traffic flow (functioning as demand) to minimize unmet demand at gas stations.
1 code implementation • 30 Jun 2023 • Sinan G. Aksoy, Ilya Amburg, Stephen J. Young
While multilinear algebra appears natural for studying the multiway interactions modeled by hypergraphs, tensor methods for general hypergraphs have been stymied by theoretical and practical barriers.
1 code implementation • 10 Jun 2020 • Ilya Amburg, Nate Veldt, Austin R. Benson
In contrast to related problems on fair or balanced clustering, we model diversity in terms of variety of past experience (instead of, e. g., protected attributes), with a goal of forming groups that have both experience and diversity with respect to participation in edge types.
1 code implementation • 22 Oct 2019 • Ilya Amburg, Nate Veldt, Austin R. Benson
Here, we develop a computational framework for the problem of clustering hypergraphs with categorical edge labels --- or different interaction types --- where clusters corresponds to groups of nodes that frequently participate in the same type of interaction.
1 code implementation • 14 May 2019 • Ilya Amburg, Jon Kleinberg, Austin R. Benson
In various application areas, networked data is collected by measuring interactions involving some specific set of core nodes.