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

DOI10.1093/COMNET/CNU028zbMATH Open1397.05163OpenAlexW2104131585MaRDI QIDQ4689348FDOQ4689348

Authors: 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

Recommendations

• An efficient algorithm for discovering probability motifs in biological networks
• Motif discovery in networks: a survey
• A motif building process for simulating random networks
• Approximating the number of network motifs
• Approximating the Number of Network Motifs
• Research and design of a statistical way for Motif in networks
• An analytical approach to network motif detection in samples of networks with pairwise different vertex labels
• An Efficient Sampling Algorithm for Network Motif Detection
• Finding approximate and constrained motifs in graphs

zbMATH Keywords

complex networksdirected acyclic graphsrandom network modelscitation networksmotifs

Mathematics Subject Classification ID

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

Cited In (5)

• What is the dimension of citation space?
• TOPOLOGY OF COMPLEX NETWORKS: MODELS AND ANALYSIS
• Motifs, coherent configurations and second order network generation
• MCMC sampling of directed flag complexes with fixed undirected graphs
• Switching edges to randomize networks : What goes wrong and how to fix it

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4689348)