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.
147 related articles for article (PubMed ID: 28709206)
21. Graph partitioning using annealed neural networks. Van den Bout DE; Miller TK IEEE Trans Neural Netw; 1990; 1(2):192-203. PubMed ID: 18282836 [TBL] [Abstract][Full Text] [Related]
22. Network comparison and the within-ensemble graph distance. Hartle H; Klein B; McCabe S; Daniels A; St-Onge G; Murphy C; Hébert-Dufresne L Proc Math Phys Eng Sci; 2020 Nov; 476(2243):20190744. PubMed ID: 33363435 [TBL] [Abstract][Full Text] [Related]
23. Spectral properties of disordered fully connected graphs. Taraskin SN Phys Rev E Stat Nonlin Soft Matter Phys; 2005 Nov; 72(5 Pt 2):056126. PubMed ID: 16383707 [TBL] [Abstract][Full Text] [Related]
24. Spectra and spectral correlations of microwave graphs with symplectic symmetry. Rehemanjiang A; Richter M; Kuhl U; Stöckmann HJ Phys Rev E; 2018 Feb; 97(2-1):022204. PubMed ID: 29548070 [TBL] [Abstract][Full Text] [Related]
25. 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]
27. Groupies in multitype random graphs. Shang Y Springerplus; 2016; 5(1):989. PubMed ID: 27441125 [TBL] [Abstract][Full Text] [Related]
28. Detectability thresholds of general modular graphs. Kawamoto T; Kabashima Y Phys Rev E; 2017 Jan; 95(1-1):012304. PubMed ID: 28208358 [TBL] [Abstract][Full Text] [Related]
29. 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]
30. Analytical calculation of average fixation time in evolutionary graphs. Askari M; Samani KA Phys Rev E Stat Nonlin Soft Matter Phys; 2015 Oct; 92(4):042707. PubMed ID: 26565272 [TBL] [Abstract][Full Text] [Related]
31. 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]
32. Graph characterization via Ihara coefficients. Ren P; Wilson RC; Hancock ER IEEE Trans Neural Netw; 2011 Feb; 22(2):233-45. PubMed ID: 21118772 [TBL] [Abstract][Full Text] [Related]
33. An ensemble of random graphs with identical degree distribution. Ma F; Wang X; Wang P Chaos; 2020 Jan; 30(1):013136. PubMed ID: 32013490 [TBL] [Abstract][Full Text] [Related]
34. Cyclization in bipartite random graphs. Lushnikov AA Phys Rev E; 2020 Mar; 101(3-1):032306. PubMed ID: 32289946 [TBL] [Abstract][Full Text] [Related]
35. Martingales and the characteristic functions of absorption time on bipartite graphs. Monk T; van Schaik A R Soc Open Sci; 2021 Oct; 8(10):210657. PubMed ID: 34703620 [TBL] [Abstract][Full Text] [Related]