Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Lucas J. Rusnak"'
Publikováno v:
SC
Computing consensus states via global sign balancing is a key step in social network analysis. This paper presents graphB+, a fast algorithm for balancing signed graphs based on a new vertex and edge labeling technique, and a parallel implementation
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c38b162bc76fbc16d110b222637ad907
https://doi.org/10.1145/3458817.3476153
https://doi.org/10.1145/3458817.3476153
Community detection is a common task in social network analysis (SNA) with applications in a variety of fields including medicine, criminology, and business. Despite the popularity of community detection, there is no clear consensus on the most effec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d2d346cb5eb770522ad0741baa54124f
http://arxiv.org/abs/2110.07514
http://arxiv.org/abs/2110.07514
Publikováno v:
Discrete Mathematics. 345:112832
An oriented hypergraph is an oriented incidence structure that extends the concepts of signed graphs, balanced hypergraphs, and balanced matrices. We introduce hypergraphic structures and techniques that generalize the circuit classification of the s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::26e689639421205618b491aa46808817
https://doi.org/10.1016/j.disc.2022.112832
https://doi.org/10.1016/j.disc.2022.112832
Publikováno v:
Linear Algebra and its Applications. 556:323-341
An oriented hypergraph is an oriented incidence structure that generalizes and unifies graph and hypergraph theoretic results by examining its locally signed graphic substructure. In this paper we obtain a combinatorial characterization of the coeffi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f6867d344f73ba45dbdfd152ad1e922f
https://doi.org/10.1016/j.laa.2018.07.012
https://doi.org/10.1016/j.laa.2018.07.012
Autor:
Lucas J. Rusnak, Jelena Tesic
Attitudinal network graphs are signed graphs where edges capture an expressed opinion; two vertices connected by an edge can be agreeable (positive) or antagonistic (negative). A signed graph is called balanced if each of its cycles includes an even
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c4a61c6f0eee1157515f3a5c1b39489f
An oriented hypergraph is an oriented incidence structure that allows for the generalization of graph theoretic concepts to integer matrices through its locally signed graphic substructure. The locally graphic behaviors are formalized in the subobjec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fd37b00328f925ae8a227689cab97ba8
Publikováno v:
Linear Algebra and its Applications. 485:442-453
An oriented hypergraph is a hypergraph where each vertex-edge incidence is given a label of +1 or −1, and each adjacency is signed the negative of the product of the incidences. An oriented hypergraph is balanced if the product of the adjacencies i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ccaa2aa1caa735b84fb3e35648f273bf
https://doi.org/10.1016/j.laa.2015.08.001
https://doi.org/10.1016/j.laa.2015.08.001
Restrictions of incidence-preserving path maps produce an oriented hypergraphic All Minors Matrix-tree Theorems for Laplacian and adjacency matrices. The images of these maps produce a locally signed graphic, incidence generalization, of cycle covers
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d0e6b315f0f11bd2f895aafc16071e0b
http://arxiv.org/abs/1709.04011
http://arxiv.org/abs/1709.04011
Autor:
Lucas J. Rusnak
Publikováno v:
The Electronic Journal of Combinatorics. 20
An oriented hypergraph is an oriented incidence structure that extends the concept of a signed graph. We introduce hypergraphic structures and techniques central to the extension of the circuit classication of signed graphs to oriented hypergraphs. O
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fc7e5632344749623ec5c87b789adf8a
https://doi.org/10.37236/2763
https://doi.org/10.37236/2763
Autor:
Lucas J. Rusnak, Nathan Reff
Publikováno v:
Linear Algebra and its Applications. (9):2262-2270
An oriented hypergraph is a hypergraph where each vertex-edge incidence is given a label of + 1 or - 1 . We define the adjacency, incidence and Laplacian matrices of an oriented hypergraph and study each of them. We extend several matrix results know
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0795f5877ba7c19c47f239d259d40d2a