These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.


BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

118 related articles for article (PubMed ID: 33327202)

  • 1. Frustrated random walks: A faster algorithm to evaluate node distances on connected and undirected graphs.
    Li E; Le Z
    Phys Rev E; 2020 Nov; 102(5-1):052135. PubMed ID: 33327202
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Random walks in weighted networks with a perfect trap: an application of Laplacian spectra.
    Lin Y; Zhang Z
    Phys Rev E Stat Nonlin Soft Matter Phys; 2013 Jun; 87(6):062140. PubMed ID: 23848660
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Block models and personalized PageRank.
    Kloumann IM; Ugander J; Kleinberg J
    Proc Natl Acad Sci U S A; 2017 Jan; 114(1):33-38. PubMed ID: 27999183
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Infinite Ergodic Walks in Finite Connected Undirected Graphs.
    Volchenkov D
    Entropy (Basel); 2021 Feb; 23(2):. PubMed ID: 33567624
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Random walks on graphs for salient object detection in images.
    Gopalakrishnan V; Hu Y; Rajan D
    IEEE Trans Image Process; 2010 Dec; 19(12):3232-42. PubMed ID: 21078566
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Return probabilities and hitting times of random walks on sparse Erdös-Rényi graphs.
    Martin OC; Sulc P
    Phys Rev E Stat Nonlin Soft Matter Phys; 2010 Mar; 81(3 Pt 1):031111. PubMed ID: 20365701
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Quadratic Speedup for Spatial Search by Continuous-Time Quantum Walk.
    Apers S; Chakraborty S; Novo L; Roland J
    Phys Rev Lett; 2022 Oct; 129(16):160502. PubMed ID: 36306753
    [TBL] [Abstract][Full Text] [Related]  

  • 8. An Algorithm for Identifying Optimal Spreaders in a Random Walk Model of Network Communication.
    Hunt FY
    J Res Natl Inst Stand Technol; 2016; 121():180-195. PubMed ID: 34434619
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Transduction on Directed Graphs via Absorbing Random Walks.
    De J; Zhang X; Lin F; Cheng L; De J; Xiaowei Zhang ; Feng Lin ; Li Cheng ; De J; Cheng L; Zhang X; Lin F
    IEEE Trans Pattern Anal Mach Intell; 2018 Jul; 40(7):1770-1784. PubMed ID: 28809671
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Spatial Search by Quantum Walk is Optimal for Almost all Graphs.
    Chakraborty S; Novo L; Ambainis A; Omar Y
    Phys Rev Lett; 2016 Mar; 116(10):100501. PubMed ID: 27015464
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Backtrackless walks on a graph.
    Aziz F; Wilson RC; Hancock ER
    IEEE Trans Neural Netw Learn Syst; 2013 Jun; 24(6):977-89. PubMed ID: 24808478
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Delocalization-localization dynamical phase transition of random walks on graphs.
    Carugno G; Vivo P; Coghi F
    Phys Rev E; 2023 Feb; 107(2-1):024126. PubMed ID: 36932599
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Mean first-passage time for random walks in general graphs with a deep trap.
    Lin Y; Julaiti A; Zhang Z
    J Chem Phys; 2012 Sep; 137(12):124104. PubMed ID: 23020321
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Supervised and extended restart in random walks for ranking and link prediction in networks.
    Jin W; Jung J; Kang U
    PLoS One; 2019; 14(3):e0213857. PubMed ID: 30893375
    [TBL] [Abstract][Full Text] [Related]  

  • 15. A random walk model for infection on graphs: spread of epidemics & rumours with mobile agents.
    Draief M; Ganesh A
    Discret Event Dyn Syst; 2011; 21(1):41-61. PubMed ID: 32214674
    [TBL] [Abstract][Full Text] [Related]  

  • 16. A linear delay algorithm for enumerating all connected induced subgraphs.
    Alokshiya M; Salem S; Abed F
    BMC Bioinformatics; 2019 Jun; 20(Suppl 12):319. PubMed ID: 31216984
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Exact and approximate graph matching using random walks.
    Gori M; Maggini M; Sarti L
    IEEE Trans Pattern Anal Mach Intell; 2005 Jul; 27(7):1100-11. PubMed ID: 16013757
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Random walks on weighted networks.
    Zhang Z; Shan T; Chen G
    Phys Rev E Stat Nonlin Soft Matter Phys; 2013 Jan; 87(1):012112. PubMed ID: 23410288
    [TBL] [Abstract][Full Text] [Related]  

  • 19. TensorFlow solver for quantum PageRank in large-scale networks.
    Tang H; Shi R; He TS; Zhu YY; Wang TY; Lee M; Jin XM
    Sci Bull (Beijing); 2021 Jan; 66(2):120-126. PubMed ID: 36654218
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Average trapping time on weighted directed Koch network.
    Wu Z; Gao Y
    Sci Rep; 2019 Oct; 9(1):14609. PubMed ID: 31601956
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.