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 *

209 related articles for article (PubMed ID: 31212417)

  • 1. Fault tolerance of random graphs with respect to connectivity: Mean-field approximation for semidense random graphs.
    Takabe S; Nakano T; Wadayama T
    Phys Rev E; 2019 May; 99(5-1):050304. PubMed ID: 31212417
    [TBL] [Abstract][Full Text] [Related]  

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

  • 3. Discontinuous phase transitions in the q-voter model with generalized anticonformity on random graphs.
    Abramiuk-Szurlej A; Lipiecki A; Pawłowski J; Sznajd-Weron K
    Sci Rep; 2021 Sep; 11(1):17719. PubMed ID: 34489517
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Bifurcations in the Kuramoto model on graphs.
    Chiba H; Medvedev GS; Mizuhara MS
    Chaos; 2018 Jul; 28(7):073109. PubMed ID: 30070519
    [TBL] [Abstract][Full Text] [Related]  

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

  • 6. Robustness of random graphs based on graph spectra.
    Wu J; Barahona M; Tan YJ; Deng HZ
    Chaos; 2012 Dec; 22(4):043101. PubMed ID: 23278036
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Measuring edge importance: a quantitative analysis of the stochastic shielding approximation for random processes on graphs.
    Schmidt DR; Thomas PJ
    J Math Neurosci; 2014 Apr; 4(1):6. PubMed ID: 24742077
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Distance distribution in random graphs and application to network exploration.
    Blondel VD; Guillaume JL; Hendrickx JM; Jungers RM
    Phys Rev E Stat Nonlin Soft Matter Phys; 2007 Dec; 76(6 Pt 2):066101. PubMed ID: 18233892
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Solvable model for distribution networks on random graphs.
    Nasiev D; van Mourik J; Kühn R
    Phys Rev E Stat Nonlin Soft Matter Phys; 2007 Oct; 76(4 Pt 1):041120. PubMed ID: 17994949
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Polynomial iterative algorithms for coloring and analyzing random graphs.
    Braunstein A; Mulet R; Pagnani A; Weigt M; Zecchina R
    Phys Rev E Stat Nonlin Soft Matter Phys; 2003 Sep; 68(3 Pt 2):036702. PubMed ID: 14524921
    [TBL] [Abstract][Full Text] [Related]  

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

  • 12. Isolation and Connectivity in Random Geometric Graphs with Self-similar Intensity Measures.
    Dettmann CP
    J Stat Phys; 2018; 172(3):679-700. PubMed ID: 30996473
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Distribution of diameters for Erdős-Rényi random graphs.
    Hartmann AK; Mézard M
    Phys Rev E; 2018 Mar; 97(3-1):032128. PubMed ID: 29776040
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Fragmentation properties of two-dimensional proximity graphs considering random failures and targeted attacks.
    Norrenbrock C; Melchert O; Hartmann AK
    Phys Rev E; 2016 Dec; 94(6-1):062125. PubMed ID: 28085361
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Pair approximation for the q-voter model with independence on multiplex networks.
    Gradowski T; Krawiecki A
    Phys Rev E; 2020 Aug; 102(2-1):022314. PubMed ID: 32942358
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Random spread on the family of small-world networks.
    Pandit SA; Amritkar RE
    Phys Rev E Stat Nonlin Soft Matter Phys; 2001 Apr; 63(4 Pt 1):041104. PubMed ID: 11308816
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Dynamical random graphs with memory.
    Turova TS
    Phys Rev E Stat Nonlin Soft Matter Phys; 2002 Jun; 65(6 Pt 2):066102. PubMed ID: 12188778
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Robustness of onionlike correlated networks against targeted attacks.
    Tanizawa T; Havlin S; Stanley HE
    Phys Rev E Stat Nonlin Soft Matter Phys; 2012 Apr; 85(4 Pt 2):046109. PubMed ID: 22680540
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Spread of information and infection on finite random networks.
    Isham V; Kaczmarska J; Nekovee M
    Phys Rev E Stat Nonlin Soft Matter Phys; 2011 Apr; 83(4 Pt 2):046128. PubMed ID: 21599261
    [TBL] [Abstract][Full Text] [Related]  

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

    [Next]    [New Search]
    of 11.