Network analysis using transitive closure: New methods for exploring networks

DOI10.1080/10629360500107857zbMath1156.68305OpenAlexW2130265542MaRDI QIDQ5290918

Daniel P. Dougherty, Wolfgang Sadee, Eric A. Stahlberg

Publication date: 3 May 2006

Published in: Journal of Statistical Computation and Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10629360500107857

zbMATH Keywords

transitivitytransitive closurepath analysisgene networkscale-freeFloyd-Warshall

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of statistics in engineering and industry; control charts (62P30) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)

Cites Work

• Unnamed Item
• Simulation of random dendrograms and comparison tests: Some comments
• Stochastic independence in a coherent setting
• Emergence of Scaling in Random Networks

This page was built for publication: Network analysis using transitive closure: New methods for exploring networks