Edge sampling and graph parameter estimation via vertex neighborhood accesses.
Jakub TetekMikkel ThorupPublished in: STOC (2022)
Keyphrases
- parameter estimation
- undirected graph
- edge weights
- vertex set
- weighted graph
- markov chain monte carlo
- directed graph
- least squares
- maximum likelihood
- strongly connected
- model selection
- em algorithm
- markov random field
- parameter values
- random fields
- statistical models
- neighborhood graph
- directed acyclic graph
- spanning tree
- expectation maximization
- labeled graphs
- graph structure
- parameter estimation algorithm
- posterior distribution
- random sampling
- bipartite graph
- parameter space
- model fitting
- gibbs sampling
- sample size
- shortest path
- metropolis hastings algorithm
- edge information
- approximate inference
- estimation problems
- similarity measure
- parameter estimates
- parameters estimation
- higher order
- bayesian model selection