A generating function approach to random subgraphs of the \(n\)-cycle (Q1357744): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q162506 |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Prodinger, Helmut / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5537802 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Periods in strings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The largest component in a random subgraph of the \(n\)-cycle / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4161406 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Random subgraphs of the n-cycle / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: AN EXAMPLE IN THE THEORY OF THE SPECTRUM OF A FUNCTION / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4385514 / rank | |||
Normal rank | |||
Latest revision as of 15:42, 27 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A generating function approach to random subgraphs of the \(n\)-cycle |
scientific article |
Statements
A generating function approach to random subgraphs of the \(n\)-cycle (English)
0 references
16 June 1997
0 references
cycle
0 references
random subgraph
0 references
generating functions
0 references
expectation
0 references
variance
0 references
