12 problems
Motif-constraint testing conjecture. Formulating null hypotheses that constrain several motif counts simultaneously could yield tests for coefficient nullity in ERGMs.
Let be the observed adjacency matrix, with rank parameter , and suppose that Assumptions (deloc)–(moments) hold, except that the moment assump…
Consider the degree-corrected mixed membership model with probability matrix , membership-related matrix , and first singular vector…
In a degree-corrected mixed membership model, let denote the degree parameter of node , let denote the degree-parameter vector, let…
Graphon asymptotics conjecture. Studying this asymptotic problem will require approaching it using graphon theory and the limits of dense graph sequences.
Mixed-distribution conjecture. The proposed method should also be able to handle mixtures of discrete and continuous distributions, for example when some are Bernoulli, so…
Covariate-dependence conjecture. Edge probabilities should depend on such variables.
Let theorem1(i) and theorem2(i) denote the asymptotic results for the persistence time of SIS infections in the model with heterogeneous populations or networks, established under…
Asymptotic estimability conjecture. For a single observation, asymptotically at most half of the parameters are estimable. More specifically, the graph has non-ze…
The multi-graph stochastic block model consists of multiple network layers sharing node class assignments, with layer-specific connection probability matrices; variational approxim…
De-biasing conjecture. In this range, an appropriate de-biasing of may yield a -consistent estimate of the target moment.
Let and be a pair of vertices in the spatial preferred attachment model, and let be the parameter in the estimator based on the convex combination of…