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 *

139 related articles for article (PubMed ID: 28085361)

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

  • 2. Ising Ferromagnets on Proximity Graphs with Varying Disorder of the Node Placement.
    Schawe H; Norrenbrock C; Hartmann AK
    Sci Rep; 2017 Aug; 7(1):8040. PubMed ID: 28808263
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Site- and bond-percolation thresholds in K_{n,n}-based lattices: Vulnerability of quantum annealers to random qubit and coupler failures on chimera topologies.
    Melchert O; Katzgraber HG; Novotny MA
    Phys Rev E; 2016 Apr; 93():042128. PubMed ID: 27176275
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 6. Random geometric graphs in high dimension.
    Erba V; Ariosto S; Gherardi M; Rotondo P
    Phys Rev E; 2020 Jul; 102(1-1):012306. PubMed ID: 32794907
    [TBL] [Abstract][Full Text] [Related]  

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

  • 8. Graph partitioning induced phase transitions.
    Paul G; Cohen R; Sreenivasan S; Havlin S; Stanley HE
    Phys Rev Lett; 2007 Sep; 99(11):115701. PubMed ID: 17930449
    [TBL] [Abstract][Full Text] [Related]  

  • 9. The relation between structural and functional connectivity patterns in complex brain networks.
    Stam CJ; van Straaten EC; Van Dellen E; Tewarie P; Gong G; Hillebrand A; Meier J; Van Mieghem P
    Int J Psychophysiol; 2016 May; 103():149-60. PubMed ID: 25678023
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Connectivity in one-dimensional soft random geometric graphs.
    Wilsher M; Dettmann CP; Ganesh A
    Phys Rev E; 2020 Dec; 102(6-1):062312. PubMed ID: 33466106
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Feedback topology and XOR-dynamics in Boolean networks with varying input structure.
    Ciandrini L; Maffi C; Motta A; Bassetti B; Cosentino Lagomarsino M
    Phys Rev E Stat Nonlin Soft Matter Phys; 2009 Aug; 80(2 Pt 2):026122. PubMed ID: 19792215
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Network dismantling.
    Braunstein A; Dall'Asta L; Semerjian G; Zdeborová L
    Proc Natl Acad Sci U S A; 2016 Nov; 113(44):12368-12373. PubMed ID: 27791075
    [TBL] [Abstract][Full Text] [Related]  

  • 13. General and exact approach to percolation on random graphs.
    Allard A; Hébert-Dufresne L; Young JG; Dubé LJ
    Phys Rev E Stat Nonlin Soft Matter Phys; 2015 Dec; 92(6):062807. PubMed ID: 26764744
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Vertex-connectivity in periodic graphs and underlying nets of crystal structures.
    Eon JG
    Acta Crystallogr A Found Adv; 2016 May; 72(Pt 3):376-84. PubMed ID: 27126114
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Random sequential renormalization and agglomerative percolation in networks: application to Erdös-Rényi and scale-free graphs.
    Bizhani G; Grassberger P; Paczuski M
    Phys Rev E Stat Nonlin Soft Matter Phys; 2011 Dec; 84(6 Pt 2):066111. PubMed ID: 22304159
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Transfer-Efficient Face Routing Using the Planar Graphs of Neighbors in High Density WSNs.
    Cho ES; Yim Y; Kim SH
    Sensors (Basel); 2017 Oct; 17(10):. PubMed ID: 29053623
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 19. Bypass rewiring and robustness of complex networks.
    Park J; Hahn SG
    Phys Rev E; 2016 Aug; 94(2-1):022310. PubMed ID: 27627320
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Components in time-varying graphs.
    Nicosia V; Tang J; Musolesi M; Russo G; Mascolo C; Latora V
    Chaos; 2012 Jun; 22(2):023101. PubMed ID: 22757508
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.