搜索结果: 1-15 共查到“the random graph”相关记录17条 . 查询时间(0.046 秒)
TRACTABLE AND CONSISTENT RANDOM GRAPH MODELS
Random Networks Random Graphs Exponential Random Graph Models
2015/7/15
addressing the problem that standard techniques of estimating ERGMs have
been shown to have exponentially slow mixing times for many specifications, we show
that by reformulating network forma...
This paper studies the formation of risk-sharing networks through costly social
investments, identifying endogenous inequality and a misallocation of resources as possible
downsides to such agreemen...
ESTIMATING AND UNDERSTANDING EXPONENTIAL RANDOM GRAPH MODELS
Assessment understanding index random graph model
2015/7/7
ESTIMATING AND UNDERSTANDING EXPONENTIAL RANDOM GRAPH MODELS。
Weights and degrees in a random graph model based on 3-interactions
Martingale random graph preferential attachment scale-free property
2012/6/19
In a random graph model based on 3-interactions we give the joint asymptotic distribution of weights and degrees and prove scale-free property for the model. Moreover, we determine the asymptotics of ...
On a sparse random graph with minimum degree {three}: Likely Posa's sets are large
random sparse graphs degrees longest path Posa sets
2011/9/20
Abstract: We consider the likely size of the endpoint sets produced by Posa rotations, when applied to a longest path in a random graph with $cn,\,c\geq 2.7$ edges that is conditioned to have minimum ...
Antiferromagnetic Potts model on the Erdos-Renyi random graph
Mean field dilute antiferromagnet q-state Potts model interpolation extended variational principle
2011/7/28
Abstract: We study the antiferromagnetic Potts model on the Erdos-Renyi random graph. By identifying a suitable interpolation structure and proving an extended variational principle we show that the r...
Estimating and Understanding Exponential Random Graph Models
Random graph Erd-os-Renyi graph limit Exponential Random Graphs param-eter estimation
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...
The component sizes of a critical random graph with pre-described degree sequence
Critical random graph random multigraph with given vertex degrees
2011/1/20
Consider a critical random multigraph Gn constructed by the con guration model such that its vertex degrees are independent random variables with the same distribution (criticality means that the se...
Bootstrap percolation on the random graph G_{n,p}
Bootstrap percolation random graph G_{n,p}
2011/2/21
Bootstrap percolation on the random graph Gn,p is a process of spread of “activation” on a
given realization of the graph with a given number of initially active nodes. At each step those vertices wh...
On the Existence of the MLE for a Directed Random Graph Network Model with Reciprocation
Algebraic statistics Dyadic independence Exponential random graph model
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。
On the geometry of discrete exponential families with application to exponential random graph models
Exponential families normal cone maximum likelihood estimates exponential random graphs
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
2009/6/12
Component sizes of the random graph outside the scaling window.
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
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...