Maximum Likelihood Estimation and Graph Matching in Errorfully Observed Networks
From MaRDI portal
Publication:5066493
DOI10.1080/10618600.2021.1872582OpenAlexW3122882889MaRDI QIDQ5066493
Jesús Arroyo, Daniel L. Sussman, Carey E. Priebe, Vince Lyzinski
Publication date: 29 March 2022
Published in: Journal of Computational and Graphical Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.10519
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The epic story of maximum likelihood
- Spectral clustering and the high-dimensional stochastic blockmodel
- Renormalization group analysis of the small-world network model
- The incidental parameter problem since 1948
- Consistency of community detection in networks under degree-corrected stochastic block models
- Efficient random graph matching via degree profiles
- From the Cover: The structure of scientific collaboration networks
- A nonparametric view of network models and Newman–Girvan and other modularities
- Generalized Sphere-Packing Bounds on the Size of Codes for Combinatorial Channels
- Statistical mechanics of complex networks
- The Algorithmic Foundations of Differential Privacy
- Large deviations for sums of partly dependent random variables
- On the asymmetry of random regular graphs and random graphs
- Matchability of heterogeneous networks pairs
- Seeded graph matching via large neighborhood statistics
- Consistent Adjacency-Spectral Partitioning for the Stochastic Block Model When the Model Parameters Are Unknown
- Collective dynamics of ‘small-world’ networks
- Graph isomorphism in quasipolynomial time [extended abstract]
- Information Recovery in Shuffled Graphs via Graph Matching
- Asymmetric graphs
- Consistent Estimates Based on Partially Consistent Observations
- The diameter of sparse random graphs
This page was built for publication: Maximum Likelihood Estimation and Graph Matching in Errorfully Observed Networks
