Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Link prediction with continuous-time classical and quantum walks (2208.11030v1)

Published 23 Aug 2022 in quant-ph, cs.LG, cs.SI, and q-bio.MN

Abstract: Protein-protein interaction (PPI) networks consist of the physical and/or functional interactions between the proteins of an organism. Since the biophysical and high-throughput methods used to form PPI networks are expensive, time-consuming, and often contain inaccuracies, the resulting networks are usually incomplete. In order to infer missing interactions in these networks, we propose a novel class of link prediction methods based on continuous-time classical and quantum random walks. In the case of quantum walks, we examine the usage of both the network adjacency and Laplacian matrices for controlling the walk dynamics. We define a score function based on the corresponding transition probabilities and perform tests on four real-world PPI datasets. Our results show that continuous-time classical random walks and quantum walks using the network adjacency matrix can successfully predict missing protein-protein interactions, with performance rivalling the state of the art.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (6)
  1. Mark Goldsmith (7 papers)
  2. Guillermo García-Pérez (40 papers)
  3. Joonas Malmi (7 papers)
  4. Matteo A. C. Rossi (46 papers)
  5. Harto Saarinen (6 papers)
  6. Sabrina Maniscalco (104 papers)
Citations (12)

Summary

We haven't generated a summary for this paper yet.