Answers are grounded in this paper and cite their sources.
Observational analysis reveals precise estimates of triangles in sparse graphs, suggesting a new modeling approach.
In this paper we obtain a precise estimate of the probability that the sparse binomial random graph contains a large number of vertices in a triangle. We compute the logarithm of this probability up to second order, which enables us to propose an exponential random graph model based on the number of vertices in a triangle. Specifically, by tuning a single parameter, we can with high probability induce any given fraction of vertices in a triangle. Moreover, in the proposed exponential random graph model we derive a large deviation principle for the number of edges. As a byproduct, we propose a consistent estimator of the tuning parameter.
No takes yet. Share an insight, caveat, or question.
Zhang et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: