Imagen de Portada

Hypergraphs as Weighted Directed Self-Looped Graphs: Spectral Properties, Clustering, Cheeger Inequality

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Li, Zihao, Fu, Dongqi, Liu, Hengyu, He, Jingrui
Formato:	Preprint
Publicado:	2024
Materias:	Social and Information Networks Discrete Mathematics Data Structures and Algorithms Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Provably Extending PageRank-based Local Clustering Algorithm to Weighted Directed Graphs with Self-Loops and to Hypergraphs
por: Li, Zihao, et al.
Publicado: (2024)

Spectral Triadic Decompositions of Real-World Networks
por: Basu, Sabyasachi, et al.
Publicado: (2022)

Tight Paths and Tight Pairs in Weighted Directed Graphs
por: Balcázar, José Luis
Publicado: (2025)

Splitting-off in Hypergraphs
por: Bérczi, Kristóf, et al.
Publicado: (2023)

Staying Fresh: Efficient Algorithms for Timely Social Information Distribution
por: Li, Songhua, et al.
Publicado: (2023)

Computing Approximate Pareto Frontiers for Submodular Utility and Cost Tradeoffs
por: Vombatkere, Karan, et al.
Publicado: (2026)

Aggregating maximal cliques in real-world graphs
por: Alon, Noga, et al.
Publicado: (2025)

Temporal Triadic Closure: Finding Dense Structures in Social Networks That Evolve
por: Davot, Tom, et al.
Publicado: (2024)

A Sublinear Algorithm for Approximate Shortest Paths in Large Networks
por: Basu, Sabyasachi, et al.
Publicado: (2024)

Densest Subhypergraph: Negative Supermodular Functions and Strongly Localized Methods
por: Huang, Yufan, et al.
Publicado: (2023)

A Tale of Santa Claus, Hypergraphs and Matroids
por: Davies, Sami, et al.
Publicado: (2018)

Hypergraph Connectivity Augmentation in Strongly Polynomial Time
por: Bérczi, Kristóf, et al.
Publicado: (2024)

Optimal Enumeration of Eulerian Trails in Directed Graphs
por: Bals, Ben, et al.
Publicado: (2026)

Hypergraph Splitting-Off via Element-Connectivity Preserving Reductions
por: Chandrasekaran, Karthekeyan, et al.
Publicado: (2025)

Non-adaptive Learning of Random Hypergraphs with Queries
por: Austhof, Bethany, et al.
Publicado: (2025)

Edge-Colored Clustering in Hypergraphs: Beyond Minimizing Unsatisfied Edges
por: Crane, Alex, et al.
Publicado: (2025)

Sandwich Monotonicity and the Recognition of Weighted Graph Classes
por: Beisegel, Jesse, et al.
Publicado: (2025)

Optimal and Efficient Partite Decompositions of Hypergraphs
por: Krapivin, Andrew, et al.
Publicado: (2025)

Node-Weighted Triangles: Faster and Simpler
por: Akmal, Shyan, et al.
Publicado: (2026)

Weighted Clique and Independent Set in Edge-Distant Hereditary Graphs
por: Srinivasan, Eshwar, et al.
Publicado: (2026)

Hypergraph dualization with FPT-delay parameterized by the degeneracy and dimension
por: Bartier, Valentin, et al.
Publicado: (2023)

Exact and Heuristic Computation of the Scanwidth of Directed Acyclic Graphs
por: Holtgrefe, Niels, et al.
Publicado: (2024)

Max Weight Independent Set in sparse graphs with no long claws
por: Abrishami, Tara, et al.
Publicado: (2023)

Minsum Problem for Discrete and Weighted Set Flow on Dynamic Path Network
por: Manna, Bubai, et al.
Publicado: (2024)

Online Graph Coloring for $k$-Colorable Graphs
por: Kawarabayashi, Ken-ichi, et al.
Publicado: (2025)

A Fast Algorithm for Finding Minimum Weight Cycles in Mining Cyclic Graph Topologies
por: Shakeri, Heman, et al.
Publicado: (2025)

Improved Streaming Algorithm for Fair $k$-Center Clustering
por: Guo, Longkun, et al.
Publicado: (2025)

Parameterized Algorithms for Balanced Cluster Edge Modification Problems
por: Madathil, Jayakrishnan, et al.
Publicado: (2024)

A Constant-Factor Approximation for Directed Latency
por: Blauth, Jannis, et al.
Publicado: (2025)

Simultaneously Approximating All $\ell_p$-norms in Correlation Clustering
por: Davies, Sami, et al.
Publicado: (2023)

Total Domination, Separated Clusters, CD-Coloring: Algorithms and Hardness
por: Antony, Dhanyamol, et al.
Publicado: (2023)

A Simple and Fast $(3+\varepsilon)$-approximation for Constrained Correlation Clustering
por: Veldt, Nate
Publicado: (2025)

Nearly Tight Bounds on Testing of Metric Properties
por: Bao, Yiqiao, et al.
Publicado: (2024)

Parameterized Complexity of s-Club Cluster Edge Deletion: When Is the Diameter Bound Necessary?
por: Gaikwad, Ajinkya
Publicado: (2025)

Stability in Graphs with Matroid Constraints
por: Fomin, Fedor V., et al.
Publicado: (2024)

Graph Visualization for Blockchain Data
por: Dietl, Marcell, et al.
Publicado: (2024)

Near-Optimal Constructive Bounds for $\ell_2$ Prefix Discrepancy and Steinitz Problems via Affine Spectral Independence
por: Dutta, Kunal, et al.
Publicado: (2026)

Noisy Nonadaptive Group Testing with Binary Splitting: New Test Design and Improvement on Price-Scarlett-Tan's Scheme
por: Li, Xiaxin, et al.
Publicado: (2024)

Deletion-correcting codes for an adversarial nanopore channel
por: Xie, Huiling, et al.
Publicado: (2026)

Double-Ended Palindromic Trees in Linear Time
por: Wang, Qisheng, et al.
Publicado: (2022)