edgeCountDistributionInG(n,p)
P84388
predicate
Indicates how the number of edges is probabilistically distributed in a random graph with n nodes where each possible edge is included independently with probability p.
All labels observed (1)
| Label | Occurrences |
|---|---|
| edgeCountDistributionInG(n,p) canonical | 1 |
Description generation (PDg)
The one-sentence description above was generated by prompting gpt-5.1 with the predicate name and this instruction.
Instruction
Given a predicate that represents a relationship or action between entities, generate a one-sentence description explaining its meaning. # Instructions Focus on describing the relationship, not the entities themselves. # Response Format Begin the description with \' Indicates...\'
Input
Predicate: edgeCountDistributionInG(n,p)
Generated description
Indicates how the number of edges is probabilistically distributed in a random graph with n nodes where each possible edge is included independently with probability p.
Sample triples (1)
| Subject | Object |
|---|---|
| Erdős–Rényi model | binomial with parameters (n choose 2) and p ⓘ |