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 *

138 related articles for article (PubMed ID: 35052059)

  • 1. Mean Hitting Time for Random Walks on a Class of Sparse Networks.
    Su J; Wang X; Yao B
    Entropy (Basel); 2021 Dec; 24(1):. PubMed ID: 35052059
    [TBL] [Abstract][Full Text] [Related]  

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

  • 3. Standard random walks and trapping on the Koch network with scale-free behavior and small-world effect.
    Zhang Z; Zhou S; Xie W; Chen L; Lin Y; Guan J
    Phys Rev E Stat Nonlin Soft Matter Phys; 2009 Jun; 79(6 Pt 1):061113. PubMed ID: 19658479
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Lévy random walks on multiplex networks.
    Guo Q; Cozzo E; Zheng Z; Moreno Y
    Sci Rep; 2016 Nov; 6():37641. PubMed ID: 27892508
    [TBL] [Abstract][Full Text] [Related]  

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

  • 6. Exact solution for mean first-passage time on a pseudofractal scale-free web.
    Zhang Z; Qi Y; Zhou S; Xie W; Guan J
    Phys Rev E Stat Nonlin Soft Matter Phys; 2009 Feb; 79(2 Pt 1):021127. PubMed ID: 19391726
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Two types of weight-dependent walks with a trap in weighted scale-free treelike networks.
    Dai M; Zong Y; He J; Wang X; Sun Y; Su W
    Sci Rep; 2018 Jan; 8(1):1544. PubMed ID: 29367681
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Topological Properties, Spectra Analysis, and Consensus Problems for a Class of Network Models Based on m-Fission Operation.
    Zhang Z; Wu B
    IEEE Trans Cybern; 2022 Sep; 52(9):9905-9921. PubMed ID: 34910646
    [TBL] [Abstract][Full Text] [Related]  

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

  • 10. Random walks on deterministic scale-free networks: exact results.
    Agliari E; Burioni R
    Phys Rev E Stat Nonlin Soft Matter Phys; 2009 Sep; 80(3 Pt 1):031125. PubMed ID: 19905080
    [TBL] [Abstract][Full Text] [Related]  

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

  • 12. Determining global mean-first-passage time of random walks on Vicsek fractals using eigenvalues of Laplacian matrices.
    Zhang Z; Wu B; Zhang H; Zhou S; Guan J; Wang Z
    Phys Rev E Stat Nonlin Soft Matter Phys; 2010 Mar; 81(3 Pt 1):031118. PubMed ID: 20365708
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Stochastic growth tree networks with an identical fractal dimension: Construction and mean hitting time for random walks.
    Ma F; Luo X; Wang P
    Chaos; 2022 Jun; 32(6):063123. PubMed ID: 35778122
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Exploring complex networks through random walks.
    Costa Lda F; Travieso G
    Phys Rev E Stat Nonlin Soft Matter Phys; 2007 Jan; 75(1 Pt 2):016102. PubMed ID: 17358219
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Mean first-passage time for random walks on random growth tree networks.
    Ma F; Wang P
    Phys Rev E; 2022 Jan; 105(1-1):014307. PubMed ID: 35193265
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Localization transition of biased random walks on random networks.
    Sood V; Grassberger P
    Phys Rev Lett; 2007 Aug; 99(9):098701. PubMed ID: 17931043
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Optimal scale-free network with a minimum scaling of transport efficiency for random walks with a perfect trap.
    Yang Y; Zhang Z
    J Chem Phys; 2013 Jan; 138(3):034101. PubMed ID: 23343262
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Random walks and chemical graph theory.
    Klein DJ; Palacios JL; Randić M; Trinajstić N
    J Chem Inf Comput Sci; 2004; 44(5):1521-5. PubMed ID: 15446809
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Long-range navigation on complex networks using Lévy random walks.
    Riascos AP; Mateos JL
    Phys Rev E Stat Nonlin Soft Matter Phys; 2012 Nov; 86(5 Pt 2):056110. PubMed ID: 23214846
    [TBL] [Abstract][Full Text] [Related]  

  • 20. From unbiased to maximal-entropy random walks on hypergraphs.
    Traversa P; de Arruda GF; Moreno Y
    Phys Rev E; 2024 May; 109(5-1):054309. PubMed ID: 38907415
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.