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 *

157 related articles for article (PubMed ID: 33567624)

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

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

  • 3. Network constraints on learnability of probabilistic motor sequences.
    Kahn AE; Karuza EA; Vettel JM; Bassett DS
    Nat Hum Behav; 2018 Dec; 2(12):936-947. PubMed ID: 30988437
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Levy geometric graphs.
    Plaszczynski S; Nakamura G; Deroulers C; Grammaticos B; Badoual M
    Phys Rev E; 2022 May; 105(5-1):054151. PubMed ID: 35706320
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Nonbacktracking expansion of finite graphs.
    Timár G; da Costa RA; Dorogovtsev SN; Mendes JFF
    Phys Rev E; 2017 Apr; 95(4-1):042322. PubMed ID: 28505741
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Quantum Interference, Graphs, Walks, and Polynomials.
    Tsuji Y; Estrada E; Movassagh R; Hoffmann R
    Chem Rev; 2018 May; 118(10):4887-4911. PubMed ID: 29630345
    [TBL] [Abstract][Full Text] [Related]  

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

  • 8. On the Solvability of the Discrete
    Pietrusiak F; Wieteska R; Gordinowicz P
    Entropy (Basel); 2022 Sep; 24(10):. PubMed ID: 37420372
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Path Counting on Tree-like Graphs with a Single Entropic Trap: Critical Behavior and Finite Size Effects.
    Gulyaev AV; Tamm MV
    Entropy (Basel); 2023 Sep; 25(9):. PubMed ID: 37761617
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Tight lower bound for percolation threshold on an infinite graph.
    Hamilton KE; Pryadko LP
    Phys Rev Lett; 2014 Nov; 113(20):208701. PubMed ID: 25432058
    [TBL] [Abstract][Full Text] [Related]  

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

  • 12. Are randomly grown graphs really random?
    Callaway DS; Hopcroft JE; Kleinberg JM; Newman ME; Strogatz SH
    Phys Rev E Stat Nonlin Soft Matter Phys; 2001 Oct; 64(4 Pt 1):041902. PubMed ID: 11690047
    [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. 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]  

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

  • 16. Fluctuations around equilibrium laws in ergodic continuous-time random walks.
    Schulz JH; Barkai E
    Phys Rev E Stat Nonlin Soft Matter Phys; 2015 Jun; 91(6):062129. PubMed ID: 26172683
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Infinite geodesic paths and fibers, new topological invariants in periodic graphs.
    Eon JG
    Acta Crystallogr A; 2007 Jan; 63(Pt 1):53-65. PubMed ID: 17179607
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Can a Quantum Walk Tell Which Is Which?A Study of Quantum Walk-Based Graph Similarity.
    Minello G; Rossi L; Torsello A
    Entropy (Basel); 2019 Mar; 21(3):. PubMed ID: 33267042
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Visual Tracking via Random Walks on Graph Model.
    Li X; Han Z; Wang L; Lu H
    IEEE Trans Cybern; 2016 Sep; 46(9):2144-55. PubMed ID: 26292358
    [TBL] [Abstract][Full Text] [Related]  

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

    [Next]    [New Search]
    of 8.