Alphabeta Math
DefinitionDefinition: AI-adaptedProof: AI-generated
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Counts of vertices of each degree

PDF p. 35: Section 6.2 opening

Definition

Let n≥1 be an integer, p∈[0,1], and G(n,p) be the random simple graph on [n]={1,…,n} in which distinct possible edges occur independently with probability p. For a vertex v, its degree d(v) is the number of vertices adjacent to it. For each integer k, define Xk=∑v=1n1{d(v)=k}, X≤k=∑v=1n1{d(v)≤k}, and X≥k=∑v=1n1{d(v)≥k}. Here an indicator is one when its displayed event occurs and zero otherwise. Thus these variables count vertices of degree exactly k, at most k, and at least k, respectively.

Put fk=P(Bin⁡(n−1,p)=k), where Bin⁡(n−1,p) denotes the law of the sum of n−1 independent Bernoulli(p) variables; each such variable is one with probability p and zero with probability 1−p. When n=1, the sum is zero.

Facts & Assumptions

Given: An integer n≥1, p∈[0,1], and the random graph and integer threshold k in the definition.

Goal: Verify that the counts and fk are well defined.

[F1]

The law of G(n,p) is a probability law on the finite set of simple graphs on [n] (Erdős–Rényi random graph and high probability). The degree of a vertex is the finite row sum of its adjacency matrix (Adjacency, degrees, graph Laplacian, and spectral notation).

[F2]

An event indicator is one on its event and zero otherwise (The indicator random variable of an event).

[F3]

The binomial(n−1,p) law is the law of a sum of n−1 independent Bernoulli(p) variables, with the empty sum equal to zero (Bernoulli random variables and binomial random variables as sums of independent Bernoulli trials).

Justification

Given: The data in Facts & Assumptions.

Goal: Establish that the displayed notation has the stated meaning.

1.1 By [F1], every graph outcome has a definite degree at each of its finitely many vertices. Each degree comparison therefore determines an event. By [F2], its indicator is defined and contributes one exactly for a vertex satisfying the comparison. The three finite sums consequently give the three stated counts on every outcome. [F1, F2]

2.1 Since n−1 is a nonnegative integer, [F3] defines the binomial law, including the empty-sum case. Its probability of the event that the sum equals k is therefore a well-defined number fk. Together with step 1.1 this establishes the notation. [given, F3, step 1.1] ∎

Source notes

The degree-count and fk notation is attributed to the article, Section 6.2 opening. The justification above uses the stated mathematical suppliers.

Depends on

Used by · 6

Dependency tree · 2 levels

Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.

Sources