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 *

132 related articles for article (PubMed ID: 30930480)

  • 1. On Edge Exchangeable Random Graphs.
    Janson S
    J Stat Phys; 2018; 173(3):448-484. PubMed ID: 30930480
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Sparse graphs using exchangeable random measures.
    Caron F; Fox EB
    J R Stat Soc Series B Stat Methodol; 2017 Nov; 79(5):1295-1366. PubMed ID: 29200934
    [TBL] [Abstract][Full Text] [Related]  

  • 3. EDGE EXCHANGEABLE MODELS FOR INTERACTION NETWORKS.
    Crane H; Dempsey W
    J Am Stat Assoc; 2018; 113(523):1311-1326. PubMed ID: 30467447
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Cluster Tails for Critical Power-Law Inhomogeneous Random Graphs.
    van der Hofstad R; Kliem S; van Leeuwaarden JSH
    J Stat Phys; 2018; 171(1):38-95. PubMed ID: 31258182
    [TBL] [Abstract][Full Text] [Related]  

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

  • 6. Interval Graph Limits.
    Diaconis P; Holmes S; Janson S
    Ann Comb; 2013 Mar; 17(1):27-52. PubMed ID: 26405368
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Properties of dense partially random graphs.
    Risau-Gusman S
    Phys Rev E Stat Nonlin Soft Matter Phys; 2004 Nov; 70(5 Pt 2):056127. PubMed ID: 15600712
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Transduction on Directed Graphs via Absorbing Random Walks.
    De J; Zhang X; Lin F; Cheng L; De J; Xiaowei Zhang ; Feng Lin ; Li Cheng ; De J; Cheng L; Zhang X; Lin F
    IEEE Trans Pattern Anal Mach Intell; 2018 Jul; 40(7):1770-1784. PubMed ID: 28809671
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Fast Generation of Sparse Random Kernel Graphs.
    Hagberg A; Lemons N
    PLoS One; 2015; 10(9):e0135177. PubMed ID: 26356296
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Characterization of 2-Path Product Signed Graphs with Its Properties.
    Sinha D; Sharma D
    Comput Intell Neurosci; 2017; 2017():1235715. PubMed ID: 28761437
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Visual exploration of complex time-varying graphs.
    Kumar G; Garland M
    IEEE Trans Vis Comput Graph; 2006; 12(5):805-12. PubMed ID: 17080803
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Network histograms and universality of blockmodel approximation.
    Olhede SC; Wolfe PJ
    Proc Natl Acad Sci U S A; 2014 Oct; 111(41):14722-7. PubMed ID: 25275010
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Spectra of sparse non-hermitian random matrices: an analytical solution.
    Neri I; Metz FL
    Phys Rev Lett; 2012 Jul; 109(3):030602. PubMed ID: 22861834
    [TBL] [Abstract][Full Text] [Related]  

  • 14. A linear programming approach for estimating the structure of a sparse linear genetic network from transcript profiling data.
    Bhadra S; Bhattacharyya C; Chandra NR; Mian IS
    Algorithms Mol Biol; 2009 Feb; 4():5. PubMed ID: 19239685
    [TBL] [Abstract][Full Text] [Related]  

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

  • 16. Dynamic Graph Stream Algorithms in
    Huang Z; Peng P
    Algorithmica; 2019; 81(5):1965-1987. PubMed ID: 31057194
    [TBL] [Abstract][Full Text] [Related]  

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

  • 18. Random graphs with hidden color.
    Söderberg B
    Phys Rev E Stat Nonlin Soft Matter Phys; 2003 Jul; 68(1 Pt 2):015102. PubMed ID: 12935185
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Entropy and distance of random graphs with application to structural pattern recognition.
    Wong AK; You M
    IEEE Trans Pattern Anal Mach Intell; 1985 May; 7(5):599-609. PubMed ID: 21869297
    [TBL] [Abstract][Full Text] [Related]  

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

    [Next]    [New Search]
    of 7.