Výsledky vyhledávání - "Rodriguez, Oliver"

Report

Cover Edge-Based Novel Triangle Counting

Autor: Bader, David A., Li, Fuhuan, Du, Zhihui, Pauliuchenka, Palina, Rodriguez, Oliver Alvarado, Gupta, Anant, Minnal, Sai Sri Vastav, Nahata, Valmik, Ganeshan, Anya, Gundogdu, Ahmet, Lew, Jason

Listing and counting triangles in graphs is a key algorithmic kernel for network analyses, including community detection, clustering coefficients, k-trusses, and triangle centrality. In this paper, we propose the novel concept of a cover-edge set tha

Externí odkaz: http://arxiv.org/abs/2403.02997

Zobrazit plný text záznamu

Report

Contour Algorithm for Connectivity

Autor: Du, Zhihui, Rodriguez, Oliver Alvarado, Li, Fuhuan, Dindoost, Mohammad, Bader, David A.

Finding connected components in a graph is a fundamental problem in graph analysis. In this work, we present a novel minimum-mapping based Contour algorithm to efficiently solve the connectivity problem. We prove that the Contour algorithm with two o

Externí odkaz: http://arxiv.org/abs/2311.02811

Zobrazit plný text záznamu

Report

Property Graphs in Arachne

Autor: Rodriguez, Oliver Alvarado, Buschmann, Fernando Vera, Du, Zhihui, Bader, David A.

Analyzing large-scale graphs poses challenges due to their increasing size and the demand for interactive and user-friendly analytics tools. These graphs arise from various domains, including cybersecurity, social sciences, health sciences, and netwo

Externí odkaz: http://arxiv.org/abs/2309.09943

Zobrazit plný text záznamu

Report

Community Detection in Hypergraphs via Mutual Information Maximization

Autor: Kritschgau, Jurgen, Kaiser, Daniel, Rodriguez, Oliver Alvarado, Amburg, Ilya, Bolkema, Jessalyn, Grubb, Thomas, Lan, Fangfei, Maleki, Sepideh, Chodrow, Phil, Kay, Bill

The hypergraph community detection problem seeks to identify groups of related nodes in hypergraph data. We propose an information-theoretic hypergraph community detection algorithm which compresses the observed data in terms of community labels and

Externí odkaz: http://arxiv.org/abs/2308.04537

Zobrazit plný text záznamu

Report

Triangle Counting Through Cover-Edges

Autor: Bader, David A., Li, Fuhuan, Ganeshan, Anya, Gundogdu, Ahmet, Lew, Jason, Rodriguez, Oliver Alvarado, Du, Zhihui

Counting and finding triangles in graphs is often used in real-world analytics to characterize cohesiveness and identify communities in graphs. In this paper, we propose the novel concept of a cover-edge set that can be used to find triangles more ef

Externí odkaz: http://arxiv.org/abs/2210.00389

Zobrazit plný text záznamu