Pages that link to "Item:Q2977563"
From MaRDI portal
The following pages link to Finding Adam in random growing trees (Q2977563):
Displayed 17 items.
- Change point detection in network models: preferential attachment and long range dependence (Q1751962) (← links)
- Metric dimension of critical Galton-Watson trees and linear preferential attachment trees (Q2033923) (← links)
- Persistence of hubs in growing random networks (Q2041655) (← links)
- Broadcasting on random recursive trees (Q2117452) (← links)
- The power of adaptivity in source identification with time queries on the path (Q2118878) (← links)
- Correlated randomly growing graphs (Q2135266) (← links)
- Root finding algorithms and persistence of Jordan centrality in growing random trees (Q2170374) (← links)
- On a tail bound for analyzing random trees (Q2173353) (← links)
- Influence of the seed in affine preferential attachment trees (Q2174976) (← links)
- Finding the seed of uniform attachment trees (Q2631843) (← links)
- Permutation Tests for Infection Graphs (Q4999155) (← links)
- Epicenter of random epidemic spanning trees on finite graphs (Q5885742) (← links)
- Root estimation in Galton–Watson trees (Q6052483) (← links)
- Community modulated recursive trees and population dependent branching processes (Q6074682) (← links)
- Degree centrality and root finding in growing random networks (Q6164921) (← links)
- Fluctuation bounds for continuous time branching processes and evolution of growing trees with a change point (Q6165244) (← links)
- Contagion Source Detection in Epidemic and Infodemic Outbreaks: Mathematical Analysis and Network Algorithms (Q6180230) (← links)