搜索结果: 1-8 共查到“管理学 a random graph”相关记录8条 . 查询时间(0.093 秒)
Estimating and Understanding Exponential Random Graph Models
Random graph Erd-os-Renyi graph limit Exponential Random Graphs param-eter estimation
font style='font-size:12px;'>
2011/3/25
We introduce a new method for estimating the parameters of exponential random graph models. The method is based on a large-deviations approximation to the normalizing constant shown to be consistent u...
On the Existence of the MLE for a Directed Random Graph Network Model with Reciprocation
Algebraic statistics Dyadic independence Exponential random graph model
font style='font-size:12px;'>
2010/10/14
Holland and Leinhardt (1981) proposed a directed random graph model, the p1 model, to describe dyadic interactions in a social network. In previous work (Petrovic et al., 2010), we studied the algebra...
Vertices of given degree in a random graph
Vertices of given degree a random graph
font style='font-size:12px;'>
2009/9/23
Vertices of given degree in a random graph。
On the geometry of discrete exponential families with application to exponential random graph models
Exponential families normal cone maximum likelihood estimates exponential random graphs
font style='font-size:12px;'>
2009/9/16
There has been an explosion of interest in statistical models for analyzing network data, and considerable interest in the class of exponential random graph (ERG) models, especially in connection with...
Component sizes of the random graph outside the scaling window
random graphs percolation martingales
font style='font-size:12px;'>
2009/6/12
Component sizes of the random graph outside the scaling window.
A local limit theorem for the critical random graph
random graphs joint distribution
font style='font-size:12px;'>
2009/4/29
We consider the limit distribution of the orders of the k largest components in the Erdös-Rényi random graph inside the ``critical window'' for arbitrary k. We prove a local limit theorem for thi...
A local limit theorem for the critical random graph
critical random graph critical random graph
font style='font-size:12px;'>
2009/4/22
We consider the limit distribution of the orders of the k largest components in the Erdös-Rényi random graph inside the ``critical window'' for arbitrary k. We prove a local limit theorem for thi...
On the Geometry of Discrete Exponential Families with Application to Exponential Random Graph Models
Geometry Discrete Exponential Families Exponential Random Graph Models
font style='font-size:12px;'>
2010/3/17
There has been an explosion of interest in statistical models for analyzing network data, and considerable interest in the class of exponential random graph (ERG) models, especially in connection with...