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 *

145 related articles for article (PubMed ID: 33567624)

  • 41. Long paths and connectivity in 1-independent random graphs.
    Day AN; Falgas-Ravry V; Hancock R
    Random Struct Algorithms; 2020 Dec; 57(4):1007-1049. PubMed ID: 33328712
    [TBL] [Abstract][Full Text] [Related]  

  • 42. Maximal-entropy random walk unifies centrality measures.
    Ochab JK
    Phys Rev E Stat Nonlin Soft Matter Phys; 2012 Dec; 86(6 Pt 2):066109. PubMed ID: 23368006
    [TBL] [Abstract][Full Text] [Related]  

  • 43. Grand Canonical Ensembles of Sparse Networks and Bayesian Inference.
    Bianconi G
    Entropy (Basel); 2022 Apr; 24(5):. PubMed ID: 35626517
    [TBL] [Abstract][Full Text] [Related]  

  • 44. Navigability of interconnected networks under random failures.
    De Domenico M; Solé-Ribalta A; Gómez S; Arenas A
    Proc Natl Acad Sci U S A; 2014 Jun; 111(23):8351-6. PubMed ID: 24912174
    [TBL] [Abstract][Full Text] [Related]  

  • 45. Fluctuations of random walks in critical random environments.
    Mardoukhi Y; Jeon JH; Chechkin AV; Metzler R
    Phys Chem Chem Phys; 2018 Aug; 20(31):20427-20438. PubMed ID: 30043029
    [TBL] [Abstract][Full Text] [Related]  

  • 46. Navigability of Random Geometric Graphs in the Universe and Other Spacetimes.
    Cunningham W; Zuev K; Krioukov D
    Sci Rep; 2017 Aug; 7(1):8699. PubMed ID: 28821852
    [TBL] [Abstract][Full Text] [Related]  

  • 47. Spatial Search by Quantum Walk is Optimal for Almost all Graphs.
    Chakraborty S; Novo L; Ambainis A; Omar Y
    Phys Rev Lett; 2016 Mar; 116(10):100501. PubMed ID: 27015464
    [TBL] [Abstract][Full Text] [Related]  

  • 48. Self-avoiding walks on scale-free networks.
    Herrero CP
    Phys Rev E Stat Nonlin Soft Matter Phys; 2005 Jan; 71(1 Pt 2):016103. PubMed ID: 15697654
    [TBL] [Abstract][Full Text] [Related]  

  • 49. MINDWALC: mining interpretable, discriminative walks for classification of nodes in a knowledge graph.
    Vandewiele G; Steenwinckel B; Turck F; Ongenae F
    BMC Med Inform Decis Mak; 2020 Dec; 20(Suppl 4):191. PubMed ID: 33317504
    [TBL] [Abstract][Full Text] [Related]  

  • 50. Random walks along the streets and canals in compact cities: spectral analysis, dynamical modularity, information, and statistical mechanics.
    Volchenkov D; Blanchard P
    Phys Rev E Stat Nonlin Soft Matter Phys; 2007 Feb; 75(2 Pt 2):026104. PubMed ID: 17358391
    [TBL] [Abstract][Full Text] [Related]  

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

  • 52. Persistent homology of complex networks for dynamic state detection.
    Myers A; Munch E; Khasawneh FA
    Phys Rev E; 2019 Aug; 100(2-1):022314. PubMed ID: 31574743
    [TBL] [Abstract][Full Text] [Related]  

  • 53. A Quantum-Inspired Similarity Measure for the Analysis of Complete Weighted Graphs.
    Bai L; Rossi L; Cui L; Cheng J; Hancock ER
    IEEE Trans Cybern; 2020 Mar; 50(3):1264-1277. PubMed ID: 31295131
    [TBL] [Abstract][Full Text] [Related]  

  • 54. Finding structural anomalies in star graphs using quantum walks.
    Cottrell S; Hillery M
    Phys Rev Lett; 2014 Jan; 112(3):030501. PubMed ID: 24484125
    [TBL] [Abstract][Full Text] [Related]  

  • 55. The Complexity of Optimal Design of Temporally Connected Graphs.
    Akrida EC; Gąsieniec L; Mertzios GB; Spirakis PG
    Theory Comput Syst; 2017; 61(3):907-944. PubMed ID: 32025196
    [TBL] [Abstract][Full Text] [Related]  

  • 56. Solving the accuracy-diversity dilemma via directed random walks.
    Liu JG; Shi K; Guo Q
    Phys Rev E Stat Nonlin Soft Matter Phys; 2012 Jan; 85(1 Pt 2):016118. PubMed ID: 22400636
    [TBL] [Abstract][Full Text] [Related]  

  • 57. A survey on exponential random graph models: an application perspective.
    Ghafouri S; Khasteh SH
    PeerJ Comput Sci; 2020; 6():e269. PubMed ID: 33816920
    [TBL] [Abstract][Full Text] [Related]  

  • 58. Random walk to a nonergodic equilibrium concept.
    Bel G; Barkai E
    Phys Rev E Stat Nonlin Soft Matter Phys; 2006 Jan; 73(1 Pt 2):016125. PubMed ID: 16486234
    [TBL] [Abstract][Full Text] [Related]  

  • 59. Experimental Parity-Time Symmetric Quantum Walks for Centrality Ranking on Directed Graphs.
    Wu T; Izaac JA; Li ZX; Wang K; Chen ZZ; Zhu S; Wang JB; Ma XS
    Phys Rev Lett; 2020 Dec; 125(24):240501. PubMed ID: 33412067
    [TBL] [Abstract][Full Text] [Related]  

  • 60. Measuring graph similarity through continuous-time quantum walks and the quantum Jensen-Shannon divergence.
    Rossi L; Torsello A; Hancock ER
    Phys Rev E Stat Nonlin Soft Matter Phys; 2015 Feb; 91(2):022815. PubMed ID: 25768560
    [TBL] [Abstract][Full Text] [Related]  

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