Pages that link to "Item:Q5901111"
From MaRDI portal
The following pages link to On the bias of traceroute sampling (Q5901111):
Displaying 14 items.
- Consistency under sampling of exponential random graph models (Q355086) (← links)
- Recovering the long-range links in augmented graphs (Q962166) (← links)
- A \(\Theta (\log n)\)-approximation for the set cover problem with set ownership (Q976067) (← links)
- Condition numbers and scale free graphs (Q978894) (← links)
- The degree distribution of random \(k\)-trees (Q1006039) (← links)
- A statistical framework for modern network science (Q2038285) (← links)
- Estimating network degree distributions under sampling: an inverse problem, with applications to monitoring social media networks (Q2349562) (← links)
- Adversarial topology discovery in network virtualization environments: a threat for ISPs? (Q2353249) (← links)
- Degree distribution of shortest path trees and bias of network sampling algorithms (Q2354885) (← links)
- Exploring networks with traceroute-like probes: Theory and simulations (Q2368960) (← links)
- Misleading stars: what cannot be measured in the internet? (Q2441536) (← links)
- Impact of spatially constrained sampling of temporal contact networks on the evaluation of the epidemic risk (Q4594623) (← links)
- Relational exchangeability (Q4968518) (← links)
- Using the bootstrap for statistical inference on random graphs (Q5507344) (← links)
