A uniform random graph model for directed acyclic networks and its effect on motif-finding

DOI10.1093/comnet/cnu028zbMath1397.05163OpenAlexW2104131585MaRDI QIDQ4689348

C. J. Carstens

Publication date: 16 October 2018

Published in: Journal of Complex Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/comnet/cnu028

zbMATH Keywords

complex networksdirected acyclic graphsrandom network modelscitation networksmotifs

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80)

Related Items (2)

What is the dimension of citation space? ⋮ TOPOLOGY OF COMPLEX NETWORKS: MODELS AND ANALYSIS

This page was built for publication: A uniform random graph model for directed acyclic networks and its effect on motif-finding