This article looks at method-of-moments estimators that are computationally much simpler than maximum likelihood.

Jun 8, 2011 · This article looks at method of moments estimators that are computationally much simpler than maximum likelihood. The estimators are fast and in ...

Aug 20, 2012 · This article looks at method-of-moments estimators that are computationally much simpler than maximum likelihood. The estimators are fast, and ...

Aug 20, 2012 · Gleich and Owen: Moment-Based Estimation of Stochastic Kronecker Graph Parameters. 233 allow one to judge which features of a real graph are ...

Abstract. Stochastic Kronecker graphs supply a parsimonious model for large sparse real world graphs. They can specify the distribution of a large.

This article looks at method of moments estimators that are computationally much simpler than maximum likelihood. The estimators are fast and in our examples, ...

This article looks at method-of-moments estimators that are computationally much simpler than maximum likelihood, and typically yield Kronecker parameters ...

Moment based estimation of stochastic Kronecker graph parameters. David F. Gleich, Purdue University. Art B. Owen, Stanford University.

Jun 8, 2011 · Abstract. Stochastic Kronecker graphs supply a parsimonious model for large sparse real world graphs. They can specify the distribution of a ...

By Art B. Owen, David F. Gleich. Stochastic Kronecker graphs supply a parsimonious model for large sparse real-world graphs. They can specify...