Degrees in random -ary hooking networks
KR Bhutani, R Kalpathy… - …, 2023 - compositionality.episciences.org
The theme in this paper is a composition of random graphs and Pólya urns. The random
graphs are generated through a small structure called the seed. Via Pólya urns, we study the …
graphs are generated through a small structure called the seed. Via Pólya urns, we study the …
Degree distributions of generalized hooking networks
C Desmarais, C Holmgren - 2019 Proceedings of the sixteenth workshop on …, 2019 - SIAM
A hooking network is grown from a set of graphs called blocks, each block with a labelled
vertex called a hook. At each step in the growth of the network, a vertex called a latch is …
vertex called a hook. At each step in the growth of the network, a vertex called a latch is …
Random multi-hooking networks
KR Bhutani, R Kalpathy, H Mahmoud - Probability in the Engineering …, 2024 - cambridge.org
We introduce a broad class of multi-hooking networks, wherein multiple copies of a seed are
hooked at each step at random locations, and the number of copies follows a predetermined …
hooked at each step at random locations, and the number of copies follows a predetermined …
Enumerations, forbidden subgraph characterizations, and the split-decomposition
M Bahrani, J Lumbroso - arXiv preprint arXiv:1608.01465, 2016 - arxiv.org
Forbidden characterizations may sometimes be the most natural way to describe families of
graphs, and yet these characterizations are usually very hard to exploit for enumerative …
graphs, and yet these characterizations are usually very hard to exploit for enumerative …
Exact-Size Sampling of Enriched Trees in Linear Time
We create a novel connection between Boltzmann sampling methods and Devroye's
algorithm to develop highly efficient sampling procedures that generate objects from …
algorithm to develop highly efficient sampling procedures that generate objects from …