High-Speed and Noise-Robust Embedding of Hypergraphs Based on Double-Centered Incidence Matrix

DOI10.1007/978-3-030-93413-2_45MaRDI QIDQ5050372zbMATH OpenOpenAlexFDO

Authors Shuta Ito, Takayasu Fushimi

Publication date 15 November 2022

Published in Complex Networks & Their Applications X (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-93413-2_45

zbMATH Keywords

embedding methodvery noisy hypergraphs

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Hypergraphs (05C65)

Recommendations

• Efficient embedding of scale-free graphs in the hyperbolic plane
• Fast approximation of centrality and distances in hyperbolic graphs
• On the complexity of the embedding problem for hypercube related graphs
• On scale embeddings of graphs into hypercubes
• Hypergraph Packing and Graph Embedding
• Efficient algorithms for dualizing large-scale hypergraphs
• Efficient algorithms for dualizing large-scale hypergraphs
• On the complexity of graph embeddings
• scientific article; zbMATH DE number 867699

Cites work

• Complex networks \& their applications IX. Proceedings of the ninth international conference, COMPLEX NETWORKS 2020, virtual, December 1--3, 2020. Volume 1
• Deep Community Detection
• Multidimensional scaling. I: Theory and method

Cited in

(5)

• Robust \(\ell_2\)-hypergraph and its applications
• Hyperbolic superluminal scator algebra
• On the geometry of the hyperbolic scator space in \(1+2\) dimensions
• ALGEBRAIC MODELS FOR MERGING SYSTEMS
• Multiplicative representation of a hyperbolic non distributive algebra

Describes a project that uses

Uses Software

• node2vec

This page was built for publication: High-Speed and Noise-Robust Embedding of Hypergraphs Based on Double-Centered Incidence Matrix

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5050372)