Inference for growing trees
arXiv:1910.04788 · doi:10.1103/PhysRevLett.126.038301
Abstract
One can often make inferences about a growing network from its current state alone. For example, it is generally possible to determine how a network changed over time or pick among plausible mechanisms explaining its growth. In practice, however, the extent to which such problems can be solved is limited by existing techniques, which are often inexact, inefficient, or both. In this article we derive exact and efficient inference methods for growing trees and demonstrate them in a series of applications: network interpolation, history reconstruction, model fitting, and model selection.
References in corpus (13)
- Emergence of scaling in random networks
- Clustering and preferential attachment in growing networks
- Connectivity of Growing Random Networks
- Organization of Growing Random Networks
- Measuring preferential attachment for evolving networks
- Optimal Containment of Epidemics in Temporal and Adaptive Networks
- Detectability thresholds and optimal algorithms for community structure in dynamic networks
- Network Archaeology: Uncovering Ancient Networks from Present-day Interactions
- Multi-scale structure and topological anomaly detection via a new network statistic: The onion decomposition
- Phase transition in the recoverability of network history
- Efficient sampling of spreading processes on complex networks using a composition and rejection algorithm
- Random Walk Models of Network Formation and Sequential Monte Carlo Methods for Graphs
- Network interpolation