The number of connected sparsely edged uniform hypergraphs
Discrete Mathematics
Counting connected graphs inside-out
Journal of Combinatorial Theory Series B
The phase transition in the cluster-scaled model of a random graph
Random Structures & Algorithms
Resolution complexity of random constraint satisfaction problems: another half of the story
Discrete Applied Mathematics - Special issue: Typical case complexity and phase transitions
The VC dimension of k-uniform random hypergraphs
Random Structures & Algorithms
Counting connected graphs and hypergraphs via the probabilistic method
Random Structures & Algorithms
Pairs of SAT-assignments in random Boolean formulæ
Theoretical Computer Science
Local Limit Theorems for the Giant Component of Random Hypergraphs
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Resolution complexity of random constraint satisfaction problems: Another half of the story
Discrete Applied Mathematics
The order of the giant component of random hypergraphs
Random Structures & Algorithms
Birth and growth of multicyclic components in random hypergraphs
Theoretical Computer Science
Phase transition of tractability in constraint satisfaction and bayesian network inference
UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
Creation and growth of components in a random hypergraph process
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Efficient sketches for the set query problem
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Asymptotic normality of the size of the giant component in a random hypergraph
Random Structures & Algorithms
| Hi-index | 0.00 |
We show that in the evolution of the random d-uniform hypergraph Gd(n,M) the phase transition occurs when M = n/d(d - 1) + O(n2/3). We also prove local limit theorems for the distribution of the size of the largest component of Gd(n,M) in the subcritical and in the early supercritical phase.