There has been an increased interest in applying machine learning techniques on relational structured-data based observed graph. Often, this graph is not fully representative of the true relationship amongst nodes. In these settings, building a generative model conditioned allows to take uncertainty into account. Various existing either rely restrictive assumptions, fail preserve topological pr...

In this paper, we apply the Turan sieve and simple developed by R. Murty first author to study problems in random graph theory. particular, obtain upper lower bounds on probability of a n vertices having diameter 2 (or 3 case bipartite graphs) with edge p(n) where edges are chosen independently . An interesting feature revealed these results is that `almost completely' complement each other. As...