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 *

147 related articles for article (PubMed ID: 31265385)

  • 1. Community Detection Using Restrained Random-Walk Similarity.
    Okuda M; Satoh S; Sato Y; Kidawara Y
    IEEE Trans Pattern Anal Mach Intell; 2021 Jan; 43(1):89-103. PubMed ID: 31265385
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Quantum walks with tuneable self-avoidance in one dimension.
    Camilleri E; Rohde PP; Twamley J
    Sci Rep; 2014 Apr; 4():4791. PubMed ID: 24762398
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Implementing graph-theoretic quantum algorithms on a silicon photonic quantum walk processor.
    Qiang X; Wang Y; Xue S; Ge R; Chen L; Liu Y; Huang A; Fu X; Xu P; Yi T; Xu F; Deng M; Wang JB; Meinecke JDA; Matthews JCF; Cai X; Yang X; Wu J
    Sci Adv; 2021 Feb; 7(9):. PubMed ID: 33637521
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Steady state and mean recurrence time for random walks on stochastic temporal networks.
    Speidel L; Lambiotte R; Aihara K; Masuda N
    Phys Rev E Stat Nonlin Soft Matter Phys; 2015 Jan; 91(1):012806. PubMed ID: 25679656
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Quantum random walks on congested lattices and the effect of dephasing.
    Motes KR; Gilchrist A; Rohde PP
    Sci Rep; 2016 Jan; 6():19864. PubMed ID: 26812924
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Detection of local community structures in complex dynamic networks with random walks.
    Thakur GS; Tiwari R; Thai MT; Chen SS; Dress AW
    IET Syst Biol; 2009 Jul; 3(4):266-78. PubMed ID: 19640165
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Return times of random walk on generalized random graphs.
    Masuda N; Konno N
    Phys Rev E Stat Nonlin Soft Matter Phys; 2004 Jun; 69(6 Pt 2):066113. PubMed ID: 15244673
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Random walks on hypergraphs.
    Carletti T; Battiston F; Cencetti G; Fanelli D
    Phys Rev E; 2020 Feb; 101(2-1):022308. PubMed ID: 32168622
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Characteristic times of biased random walks on complex networks.
    Bonaventura M; Nicosia V; Latora V
    Phys Rev E Stat Nonlin Soft Matter Phys; 2014 Jan; 89(1):012803. PubMed ID: 24580277
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Random walks in time-varying networks with memory.
    Wang B; Zeng H; Han Y
    Phys Rev E; 2020 Dec; 102(6-1):062309. PubMed ID: 33466012
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Continuous-time random walks on networks with vertex- and time-dependent forcing.
    Angstmann CN; Donnelly IC; Henry BI; Langlands TA
    Phys Rev E Stat Nonlin Soft Matter Phys; 2013 Aug; 88(2):022811. PubMed ID: 24032887
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Evolving network representation learning based on random walks.
    Heidari F; Papagelis M
    Appl Netw Sci; 2020; 5(1):18. PubMed ID: 32215318
    [TBL] [Abstract][Full Text] [Related]  

  • 13. A Markovian random walk model of epidemic spreading.
    Bestehorn M; Riascos AP; Michelitsch TM; Collet BA
    Contin Mech Thermodyn; 2021; 33(4):1207-1221. PubMed ID: 34776647
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Analysis of node2vec random walks on networks.
    Meng L; Masuda N
    Proc Math Phys Eng Sci; 2020 Nov; 476(2243):20200447. PubMed ID: 33362414
    [TBL] [Abstract][Full Text] [Related]  

  • 15. 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]  

  • 16. Maximal-entropy random walk unifies centrality measures.
    Ochab JK
    Phys Rev E Stat Nonlin Soft Matter Phys; 2012 Dec; 86(6 Pt 2):066109. PubMed ID: 23368006
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Improving Network Representation Learning via Dynamic Random Walk, Self-Attention and Vertex Attributes-Driven Laplacian Space Optimization.
    Hu S; Zhang B; Lv H; Chang F; Zhou C; Wu L; Zou G
    Entropy (Basel); 2022 Aug; 24(9):. PubMed ID: 36141099
    [TBL] [Abstract][Full Text] [Related]  

  • 18. A random walk approach to quantum algorithms.
    Kendon VM
    Philos Trans A Math Phys Eng Sci; 2006 Dec; 364(1849):3407-22. PubMed ID: 17090467
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Random graphs with arbitrary degree distributions and their applications.
    Newman ME; Strogatz SH; Watts DJ
    Phys Rev E Stat Nonlin Soft Matter Phys; 2001 Aug; 64(2 Pt 2):026118. PubMed ID: 11497662
    [TBL] [Abstract][Full Text] [Related]  

  • 20. On the centrality of vertices of molecular graphs.
    Randić M; Novič M; Vračko M; Plavšić D
    J Comput Chem; 2013 Nov; 34(29):2514-23. PubMed ID: 23955387
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 8.