predict_hubs

Predicts the degree of hubs of an unseen graph given a graph generated
from the same process.

Generates (U,W) mixture graphs where U is a line graph graphon and W is a dense graphon. Graphons are graph limits and graphon U can be written as sequence of positive numbers adding to 1. Graphs are sampled from U and W and joined randomly to obtain the mixture graph. Given a mixture graph, U can be inferred. Kandanaarachchi and Ong (2025) <doi:10.48550/arXiv.2505.13864>.

Sevvandi Kandanaarachchi

graphonmix

Generates Mixture Graphs from Dense and Sparse Graphons

predict_hubs function

<dl><dt>gr</dt>
<dd>The input graph</dd>
<dt>n</dt>
<dd>The number of nodes in the new graph</dd>
<dt>k</dt>
<dd>The number of hubs. Default is <code>NULL</code></dd></dl>

Arguments

Predicts the degree of hubs of an new graph — predict_hubs

<dl>

<dt>gr</dt>
<dd>The input graph</dd>


<dt>n</dt>
<dd>The number of nodes in the new graph</dd>


<dt>k</dt>
<dd>The number of hubs. Default is <code>NULL</code></dd>

</dl>

predict_hubs: Predicts the degree of hubs of an new graph

Description

Usage

Value

Arguments

Examples