Attribute network models, stochastic approximation, and network sampling and ranking algorithms
We analyze dynamic random network models where younger vertices connect to older ones
with probabilities proportional to their degrees as well as a propensity kernel governed by …
with probabilities proportional to their degrees as well as a propensity kernel governed by …
Random networks grown by fusing edges via urns
KR Bhutani, R Kalpathy, H Mahmoud - Network Science, 2022 - cambridge.org
Many classic networks grow by hooking small components via vertices. We introduce a class
of networks that grows by fusing the edges of a small graph to an edge chosen uniformly at …
of networks that grows by fusing the edges of a small graph to an edge chosen uniformly at …
Inference in balanced community modulated recursive trees
A Ben-Hamou, V Velona - arXiv preprint arXiv:2305.15206, 2023 - arxiv.org
We introduce a random recursive tree model with two communities, called balanced
community modulated random recursive tree, or BCMRT in short. In this setting, pairs of …
community modulated random recursive tree, or BCMRT in short. In this setting, pairs of …