Quantum Motif Clustering

Chris Cade, Farrokh Labib, Ido Niesen

Type: Preprint

Publication Date: 2021-01-01

Citations: 0

DOI: https://doi.org/10.48550/arxiv.2111.13222

View Publication

Locations

arXiv (Cornell University) - View - PDF
DataCite API - View

Similar Works

Action	Title	Year	Authors
+ PDF Chat	Quantum Motif Clustering	2023	Chris Cade Farrokh Labib Ido Niesen
+	Quantum density peak clustering	2022	Duarte Magano Lorenzo Buffoni Yasser Omar
+ PDF Chat	Quantum density peak clustering	2023	Duarte Magano Lorenzo Buffoni Yasser Omar
+ PDF Chat	Quantum spectral clustering	2021	Iordanis Kerenidis Jonas Landman
+	QOMIC: Quantum optimization for motif identification	2024	Hoang M. Ngo Tamim Khatib My T. Thai Tamer Kahveci
+	QOMIC: Quantum optimization for motif identification	2023	Hoang M. Ngo Tamim Khatib My T. Thai Tamer Kahveci
+ PDF Chat	Local Motif Clustering via (Hyper)Graph Partitioning	2022	Adil Chhabra Marcelo Fonseca Faraj Christof Schulz
+ PDF Chat	Local Motif Clustering via (Hyper)Graph Partitioning	2023	Adil Chhabra Marcelo Fonseca Faraj Christof Schulz
+	Local Motif Clustering via (Hyper)Graph Partitioning	2022	Adil Chhabra Marcelo Fonseca Faraj Christof Schulz
+ PDF Chat	A classical approach to the graph isomorphism problem using quantum walks	2008	B. L. Douglas Jingbo Wang
+	Classically efficient graph isomorphism algorithm using quantum walks	2007	B. L. Douglas J. B. Wang
+ PDF Chat	Quantum algorithms for community detection and their empirical run-times	2024	Chris Cade Marten Folkertsma Ido Niesen Jordi Weggemans
+	Graph analysis using a GPU-based parallel algorithm: quantum clustering	2024	Zhe Wang Zhijie He Ding Liu
+	Quantum Google Algorithm: Construction and Application to Complex Networks	2014	Giuseppe Davide Paparo Markus Müller Francesc Comellas M. A. Martín-Delgado
+	Quantum Algorithms for Community Detection and their Empirical Run-times	2022	Chris Cade Marten Folkertsma Ido Niesen Jordi Weggemans
+ PDF Chat	Motif-based spectral clustering of weighted directed networks	2020	William G. Underwood Andrew Elliott Mihai Cucuringu
+ PDF Chat	Motif Counting Beyond Five Nodes	2021	Marco Bressan Flavio Chierichetti Ravi Kumar Stefano Leucci Alessandro Panconesi
+ PDF Chat	Quantum walks as a probe of structural anomalies in graphs	2012	Mark Hillery Hongjun Zheng Edgar Feldman Daniel Reitzner Vladimír Bužek
+	From Quantum Graph Computing to Quantum Graph Learning: A Survey	2022	Yehui Tang Junchi Yan Edwin R. Hancock
+	Hypergraph Motifs and Their Extensions Beyond Binary	2023	Geon Lee Seokbum Yoon Jihoon Ko Hyun‐Ju Kim Kijung Shin

Works That Cite This (0)

Action	Title	Year	Authors

Works Cited by This (22)

Action	Title	Year	Authors
+ PDF Chat	Nearly Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems	2014	Daniel A. Spielman Shang‐Hua Teng
+ PDF Chat	Scale-free networks in cell biology	2005	Réka Albert
+ PDF Chat	Benchmark graphs for testing community detection algorithms	2008	Andrea Lancichinetti Santo Fortunato Filippo Radicchi
+	The average distances in random graphs with given expected degrees	2002	Fan Chung Linyuan Lü
+ PDF Chat	Generating Simple Random Graphs with Prescribed Degree Distribution	2006	Tom Britton Maria Deijfen Anders Martin‐Löf
+ PDF Chat	Biological network comparison using graphlet degree distribution	2007	Nataša Pržulj
+ PDF Chat	Partitioning Well-Clustered Graphs: Spectral Clustering Works!	2017	Richard Peng He Sun Luca Zanetti
+ PDF Chat	A tutorial on spectral clustering	2007	Ulrike von Luxburg
+ PDF Chat	Faster Spectral Sparsification and Numerical Algorithms for SDD Matrices	2015	Ioannis Koutis A. Levin Richard Peng
+	None	2007	Béla Bollobás Svante Janson Oliver Riordan