Graph model selection using maximum likelihood

@inproceedings{Bezkov2006GraphMS,
  title={Graph model selection using maximum likelihood},
  author={Ivona Bez{\'a}kov{\'a} and Adam Tauman Kalai and Rahul Santhanam},
  booktitle={ICML},
  year={2006}
}
In recent years, there has been a proliferation of theoretical graph models, e.g., preferential attachment and small-world models, motivated by real-world graphs such as the Internet topology. To address the natural question of which model is best for a particular data set, we propose a model selection criterion for graph models. Since each model is in fact a probability distribution over graphs, we suggest using Maximum Likelihood to compare graph models and select their parameters… CONTINUE READING
Highly Cited
This paper has 27 citations. REVIEW CITATIONS

References

Publications referenced by this paper.
Showing 1-5 of 5 references

University of Wisconsin at Madison

  • CONDOR
  • http://www.cs.wisc.edu/condor/.
  • 2005
Highly Influential
3 Excerpts

National Laboratory for Applied Network Research Routing data

  • NLANR
  • http://moat.nlanr.net/Routing/rawdata/.
  • 2001
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…