graphonmix

graphonmix-package

<img src="figures/logo.png?package=graphonmix&version=0.0.1.0" style="float: right" alt="logo" width="120">
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) tools:::Rd_expr_doi("10.48550/arXiv.2505.13864").

internal

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

Generates Mixture Graphs from Dense and Sparse Graphons

graphonmix-package function

Maintainer: Sevvandi Kandanaarachchi <a href="/link/sevvandik%40gmail.com?package=graphonmix&version=0.0.1.0" data-mini-rdoc="graphonmix::sevvandik@gmail.com">sevvandik@gmail.com</a> (<a href="https://orcid.org/0000-0002-0337-0395">ORCID</a>)

Author

<img src='figures/logo.png' style='float: right' alt='logo' width='120' />
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) tools:::Rd_expr_doi("10.48550/arXiv.2505.13864").

graphonmix: Generates Mixture Graphs from Dense and Sparse Graphons — graphonmix-package

Maintainer: Sevvandi Kandanaarachchi <a href='mailto:sevvandik@gmail.com'>sevvandik@gmail.com</a> (<a href='https://orcid.org/0000-0002-0337-0395'>ORCID</a>)

graphonmix-package: graphonmix: Generates Mixture Graphs from Dense and Sparse Graphons

Description

Arguments

Author

See Also