A framework for imperfectly observed networks
DOI10.1007/S10955-017-1838-3zbMATH Open1403.60066OpenAlexW2724873080WikidataQ56967290 ScholiaQ56967290MaRDI QIDQ1756569FDOQ1756569
Authors: Xiang Li, David Aldous 
Publication date: 21 December 2018
Published in: Journal of Statistical Physics (Search for Journal in Brave)
Full work available at URL: https://escholarship.org/uc/item/966007k9
Recommendations
- A statistical framework for modern network science
- Predicting unobserved links in incompletely observed networks
- Dynamic network models and graphon estimation
- Network inference from grouped observations using Hub Models
- A survey of statistical network models
- Graphs, networks, and linear unbiased estimates
- Network inference from temporally dependent grouped observations
Interacting random processes; statistical mechanics type models; percolation theory (60K35) Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Continuous-time Markov processes on discrete state spaces (60J27)
Cites Work
- Recurrence of distributional limits of finite planar graphs
- Large networks and graph limits
- Extremes and related properties of random sequences and processes
- Estimating network degree distributions under sampling: an inverse problem, with applications to monitoring social media networks
- Title not available (Why is that?)
- Geometric bounds for eigenvalues of Markov chains
- Smoothed Analysis on Connected Graphs
- The incipient giant component in bond percolation on general finite weighted graphs
- Weak concentration for first passage percolation times on graphs and general increasing set-valued processes
Cited In (4)
This page was built for publication: A framework for imperfectly observed networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1756569)
