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 *

230 related articles for article (PubMed ID: 20365439)

  • 21. Random walks in modular scale-free networks with multiple traps.
    Zhang Z; Yang Y; Lin Y
    Phys Rev E Stat Nonlin Soft Matter Phys; 2012 Jan; 85(1 Pt 1):011106. PubMed ID: 22400511
    [TBL] [Abstract][Full Text] [Related]  

  • 22. Random walks in unweighted and weighted modular scale-free networks with a perfect trap.
    Yang Y; Zhang Z
    J Chem Phys; 2013 Dec; 139(23):234106. PubMed ID: 24359351
    [TBL] [Abstract][Full Text] [Related]  

  • 23. Mean first-passage time for maximal-entropy random walks in complex networks.
    Lin Y; Zhang Z
    Sci Rep; 2014 Jun; 4():5365. PubMed ID: 24947015
    [TBL] [Abstract][Full Text] [Related]  

  • 24. The trapping problem of the weighted scale-free treelike networks for two kinds of biased walks.
    Dai M; Zong Y; He J; Sun Y; Shen C; Su W
    Chaos; 2018 Nov; 28(11):113115. PubMed ID: 30501217
    [TBL] [Abstract][Full Text] [Related]  

  • 25. Anomalous behavior of trapping in extended dendrimers with a perfect trap.
    Zhang Z; Li H; Yi Y
    J Chem Phys; 2015 Aug; 143(6):064901. PubMed ID: 26277160
    [TBL] [Abstract][Full Text] [Related]  

  • 26. Exact calculations of first-passage properties on the pseudofractal scale-free web.
    Peng J; Agliari E; Zhang Z
    Chaos; 2015 Jul; 25(7):073118. PubMed ID: 26232969
    [TBL] [Abstract][Full Text] [Related]  

  • 27. Anomalous biased diffusion in networks.
    Skarpalezos L; Kittas A; Argyrakis P; Cohen R; Havlin S
    Phys Rev E Stat Nonlin Soft Matter Phys; 2013 Jul; 88(1):012817. PubMed ID: 23944528
    [TBL] [Abstract][Full Text] [Related]  

  • 28. Efficiency analysis of diffusion on T-fractals in the sense of random walks.
    Peng J; Xu G
    J Chem Phys; 2014 Apr; 140(13):134102. PubMed ID: 24712775
    [TBL] [Abstract][Full Text] [Related]  

  • 29. Effects of reciprocity on random walks in weighted networks.
    Zhang Z; Li H; Sheng Y
    Sci Rep; 2014 Dec; 4():7460. PubMed ID: 25500907
    [TBL] [Abstract][Full Text] [Related]  

  • 30. Coherence in a family of tree networks with an application of Laplacian spectrum.
    Sun W; Ding Q; Zhang J; Chen F
    Chaos; 2014 Dec; 24(4):043112. PubMed ID: 25554032
    [TBL] [Abstract][Full Text] [Related]  

  • 31. Zero constant formula for first-passage observables in bounded domains.
    Bénichou O; Meyer B; Tejedor V; Voituriez R
    Phys Rev Lett; 2008 Sep; 101(13):130601. PubMed ID: 18851430
    [TBL] [Abstract][Full Text] [Related]  

  • 32. First passage time for random walks in heterogeneous networks.
    Hwang S; Lee DS; Kahng B
    Phys Rev Lett; 2012 Aug; 109(8):088701. PubMed ID: 23002779
    [TBL] [Abstract][Full Text] [Related]  

  • 33. Random walks on complex trees.
    Baronchelli A; Catanzaro M; Pastor-Satorras R
    Phys Rev E Stat Nonlin Soft Matter Phys; 2008 Jul; 78(1 Pt 1):011114. PubMed ID: 18763926
    [TBL] [Abstract][Full Text] [Related]  

  • 34. Trapping in dendrimers and regular hyperbranched polymers.
    Wu B; Lin Y; Zhang Z; Chen G
    J Chem Phys; 2012 Jul; 137(4):044903. PubMed ID: 22852651
    [TBL] [Abstract][Full Text] [Related]  

  • 35. Scaling of average receiving time on weighted polymer networks with some topological properties.
    Ye D; Liu S; Li J; Zhang F; Han C; Chen W; Zhang Y
    Sci Rep; 2017 May; 7(1):2128. PubMed ID: 28522831
    [TBL] [Abstract][Full Text] [Related]  

  • 36. Influences of degree inhomogeneity on average path length and random walks in disassortative scale-free networks.
    Zhang Z; Zhang Y; Zhou S; Yin M; Guan J
    J Math Phys; 2009 Mar; 50(3):033514. PubMed ID: 32255840
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Random walks on complex networks.
    Noh JD; Rieger H
    Phys Rev Lett; 2004 Mar; 92(11):118701. PubMed ID: 15089179
    [TBL] [Abstract][Full Text] [Related]  

  • 38. Estimating mean first passage time of biased random walks with short relaxation time on complex networks.
    Lee ZQ; Hsu WJ; Lin M
    PLoS One; 2014; 9(4):e93348. PubMed ID: 24699325
    [TBL] [Abstract][Full Text] [Related]  

  • 39. Efficiency of message transmission using biased random walks in complex networks in the presence of traps.
    Skarpalezos L; Kittas A; Argyrakis P; Cohen R; Havlin S
    Phys Rev E Stat Nonlin Soft Matter Phys; 2015 Jan; 91(1):012817. PubMed ID: 25679667
    [TBL] [Abstract][Full Text] [Related]  

  • 40. Optimal and suboptimal networks for efficient navigation measured by mean-first passage time of random walks.
    Zhang Z; Sheng Y; Hu Z; Chen G
    Chaos; 2012 Dec; 22(4):043129. PubMed ID: 23278064
    [TBL] [Abstract][Full Text] [Related]  

    [Previous]   [Next]    [New Search]
    of 12.