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 *

944 related articles for article (PubMed ID: 11497662)

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

  • 2. Network robustness and fragility: percolation on random graphs.
    Callaway DS; Newman ME; Strogatz SH; Watts DJ
    Phys Rev Lett; 2000 Dec; 85(25):5468-71. PubMed ID: 11136023
    [TBL] [Abstract][Full Text] [Related]  

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

  • 4. Emergence of the giant weak component in directed random graphs with arbitrary degree distributions.
    Kryven I
    Phys Rev E; 2016 Jul; 94(1-1):012315. PubMed ID: 27575156
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 7. Atomic subgraphs and the statistical mechanics of networks.
    Wegner AE; Olhede S
    Phys Rev E; 2021 Apr; 103(4-1):042311. PubMed ID: 34005963
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Random graph models of social networks.
    Newman ME; Watts DJ; Strogatz SH
    Proc Natl Acad Sci U S A; 2002 Feb; 99 Suppl 1(Suppl 1):2566-72. PubMed ID: 11875211
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Spin-glass phase transitions and minimum energy of the random feedback vertex set problem.
    Qin SM; Zeng Y; Zhou HJ
    Phys Rev E; 2016 Aug; 94(2-1):022146. PubMed ID: 27627285
    [TBL] [Abstract][Full Text] [Related]  

  • 10. The average distances in random graphs with given expected degrees.
    Chung F; Lu L
    Proc Natl Acad Sci U S A; 2002 Dec; 99(25):15879-82. PubMed ID: 12466502
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Spectra of random graphs with arbitrary expected degrees.
    Nadakuditi RR; Newman ME
    Phys Rev E Stat Nonlin Soft Matter Phys; 2013 Jan; 87(1):012803. PubMed ID: 23410384
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Component sizes in networks with arbitrary degree distributions.
    Newman ME
    Phys Rev E Stat Nonlin Soft Matter Phys; 2007 Oct; 76(4 Pt 2):045101. PubMed ID: 17995046
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Random graphs containing arbitrary distributions of subgraphs.
    Karrer B; Newman ME
    Phys Rev E Stat Nonlin Soft Matter Phys; 2010 Dec; 82(6 Pt 2):066118. PubMed ID: 21230716
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Giant strongly connected component of directed networks.
    Dorogovtsev SN; Mendes JF; Samukhin AN
    Phys Rev E Stat Nonlin Soft Matter Phys; 2001 Aug; 64(2 Pt 2):025101. PubMed ID: 11497638
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Equitable random graphs.
    Newman ME; Martin T
    Phys Rev E Stat Nonlin Soft Matter Phys; 2014 Nov; 90(5-1):052824. PubMed ID: 25493850
    [TBL] [Abstract][Full Text] [Related]  

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

  • 17. Graph Matching between Bipartite and Unipartite Networks: to Collapse, or not to Collapse, that is the Question.
    Arroyo J; Priebe CE; Lyzinski V
    IEEE Trans Netw Sci Eng; 2021; 8(4):3019-3033. PubMed ID: 35224127
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Exactly solvable model of a coalescing random graph.
    Lushnikov AA
    Phys Rev E Stat Nonlin Soft Matter Phys; 2015 Feb; 91(2):022119. PubMed ID: 25768470
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Approximate von Neumann entropy for directed graphs.
    Ye C; Wilson RC; Comin CH; Costa Lda F; Hancock ER
    Phys Rev E Stat Nonlin Soft Matter Phys; 2014 May; 89(5):052804. PubMed ID: 25353841
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Random graph models for directed acyclic networks.
    Karrer B; Newman ME
    Phys Rev E Stat Nonlin Soft Matter Phys; 2009 Oct; 80(4 Pt 2):046110. PubMed ID: 19905393
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 48.