Zobrazeno 1 - 10
of 169
pro vyhledávání: '"Young, Stephen J."'
In data science, hypergraphs are natural models for data exhibiting multi-way relations, whereas graphs only capture pairwise. Nonetheless, many proposed hypergraph neural networks effectively reduce hypergraphs to undirected graphs via symmetrized m
Externí odkaz:
http://arxiv.org/abs/2402.09676
Autor:
Shivakumar, Shruti, Amburg, Ilya, Aksoy, Sinan G., Li, Jiajia, Young, Stephen J., Aluru, Srinivas
Hypergraphs are a popular paradigm to represent complex real-world networks exhibiting multi-way relationships of varying sizes. Mining centrality in hypergraphs via symmetric adjacency tensors has only recently become computationally feasible for la
Externí odkaz:
http://arxiv.org/abs/2311.08595
Autor:
Kay, Bill, Aksoy, Sinan G., Baird, Molly, Best, Daniel M., Jenne, Helen, Joslyn, Cliff, Potvin, Christopher, Henselman-Petrusek, Gregory, Seppala, Garret, Young, Stephen J., Purvine, Emilie
In this position paper, we argue that when hypergraphs are used to capture multi-way local relations of data, their resulting topological features describe global behaviour. Consequently, these features capture complex correlations that can then serv
Externí odkaz:
http://arxiv.org/abs/2312.00023
Autor:
Myers, Audun, Bittner, Alyson, Aksoy, Sinan, Best, Daniel M., Henselman-Petrusek, Gregory, Jenne, Helen, Joslyn, Cliff, Kay, Bill, Seppala, Garret, Young, Stephen J., Purvine, Emilie
In this study we synthesize zigzag persistence from topological data analysis with autoencoder-based approaches to detect malicious cyber activity and derive analytic insights. Cybersecurity aims to safeguard computers, networks, and servers from var
Externí odkaz:
http://arxiv.org/abs/2309.08010
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. A recently proposed adjacency tensor is applicabl
Externí odkaz:
http://arxiv.org/abs/2306.17825
Autor:
Aksoy, Sinan G., Bennink, Ryan, Chen, Yuzhou, Frías, José, Gel, Yulia R., Kay, Bill, Naumann, Uwe, Marrero, Carlos Ortiz, Petyuk, Anthony V., Roy, Sandip, Segovia-Dominguez, Ignacio, Veldt, Nate, Young, Stephen J.
We present and discuss seven different open problems in applied combinatorics. The application areas relevant to this compilation include quantum computing, algorithmic differentiation, topological data analysis, iterative methods, hypergraph cut alg
Externí odkaz:
http://arxiv.org/abs/2303.11464
Autor:
Young, Stephen J.
Over the last twenty years, as biological, technological, and social net- works have risen in prominence and importance, the study of complex networks has attracted researchers from a wide range of fields. As a result, there is a large and diverse b
Externí odkaz:
http://hdl.handle.net/1853/26548
Cyber operations is drowning in diverse, high-volume, multi-source data. In order to get a full picture of current operations and identify malicious events and actors analysts must see through data generated by a mix of human activity and benign auto
Externí odkaz:
http://arxiv.org/abs/2008.04357
Rabinovitch showed in 1978 that the interval orders having a representation consisting of only closed unit intervals have order dimension at most 3. This article shows that the same dimension bound applies to two other classes of posets: those having
Externí odkaz:
http://arxiv.org/abs/2004.08294
The cyclic edge-connectivity of a graph $G$ is the least $k$ such that there exists a set of $k$ edges whose removal disconnects $G$ into components where every component contains a cycle. We show that for graphs of minimum degree at least 3 and girt
Externí odkaz:
http://arxiv.org/abs/2003.02393