Author:
Behrisch Michael,Coja-Oghlan Amin,Kang Mihyun
Publisher
Springer Berlin Heidelberg
Reference27 articles.
1. Andriamampianina, T., Ravelomanana, V.: Enumeration of connected uniform hypergraphs. In: Proceedings of FPSAC (2005)
2. Barraez, D., Boucheron, S., Fernandez de la Vega, W.: On the fluctuations of the giant component. Combinatorics, Probability and Computing 9, 287–304 (2000)
3. Barbour, A.D., Karonski, M., Rucinski, A.: A central limit theorem for decomposable random variables with applications to random graphs. J. Combin. Theory Ser. B 47, 125–145 (1989)
4. Behrisch, M., Coja-Oghlan, A., Kang, M.: The order of the giant component of random hypergraphs (preprint, 2007), available at http://arxiv.org/abs/0706.0496
5. Behrisch, M., Coja-Oghlan, A., Kang, M.: Local limit theorems and the number of connected hypergraphs (preprint, 2007), available at http://arxiv.org/abs/0706.0497
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Birth and growth of multicyclic components in random hypergraphs;Theoretical Computer Science;2010-10
2. Propagation Connectivity of Random Hypergraphs;Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques;2010
3. A new approach to the giant component problem;Random Structures and Algorithms;2009-03
4. Random Graphs and Branching Processes;Bolyai Society Mathematical Studies;2008
5. Local Limit Theorems for the Giant Component of Random Hypergraphs;Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques;2007