Pages that link to "Item:Q3391081"
From MaRDI portal
The following pages link to An Efficient Sampling Algorithm for Network Motif Detection (Q3391081):
Displaying 8 items.
- An analytical approach to network motif detection in samples of networks with pairwise different vertex labels (Q428318) (← links)
- Motif discovery in networks: a survey (Q2026297) (← links)
- Sequential importance sampling for multiresolution Kingman-Tajima coalescent counting (Q2194460) (← links)
- A motif building process for simulating random networks (Q2242037) (← links)
- Fast methods for finding significant motifs on labelled multi-relational networks (Q3388961) (← links)
- A uniform random graph model for directed acyclic networks and its effect on motif-finding (Q4689348) (← links)
- Shortest path tree sampling for landmark selection in large networks (Q4985070) (← links)
- On the efficacy of higher-order spectral clustering under weighted stochastic block models (Q6071724) (← links)