MTH 221 Week 4 DQ 3 (UOP Course)

MTH 221 Week 4 DQ 3 (UOP Course)

Asked by 2 years ago
0 points

Week 4 DQ3

Random graphs are a fascinating subject of applied and theoretical research. These can be generated with a fixed vertex set V and edges added to the edge set E based on some probability model, such as a coin flip. Speculate on how many connected components a random graph might have if the likelihood of an edge (v1,v2) being in the set E is 50%. Do you think the number of components would depend on the size of the vertex set V? Explain why or why not.

I'm going to start with a few preliminaries:

The total number of possible edges between vertices is C(n,2). So for 4 vertices, it's 6 possible edges. For 100 vertices, it's 4950 possible edges.

Per definition 11.5 on page 517 of the text, a component of a graph is a subgraph.

This problem presents a type of random graph described...

MTH 221

1 Answer

Answered by 2 years ago
0 points

Oh Snap! This Answer is Locked

MTH 221 Week 4 DQ 3 (UOP Course)

Thumbnail of first page

Excerpt from file: Week4DQ3 Randomgraphsareafascinatingsubjectofappliedandtheoreticalresearch.Thesecanbe generatedwithafixedvertexsetVandedgesaddedtotheedgesetEbasedonsome probabilitymodel,suchasacoinflip.Speculateonhowmanyconnectedcomponentsa randomgraphmighthaveifthelikelihoodofanedge(v1,v2)beinginthesetEis50%.Do...

Filename: mth-221-week-4-dq-3-uop-course-24.doc

Filesize: < 2 MB

Downloads: 0

Print Length: 2 Pages/Slides

Words: NA

Your Answer

Surround your text in *italics* or **bold**, to write a math equation use, for example, $x^2+2x+1=0$ or $$\beta^2-1=0$$

Use LaTeX to type formulas and markdown to format text. See example.

Sign up or Log in

  • Answer the question above my logging into the following networks
Sign in
Sign in
Sign in

Post as a guest

  • Your email will not be shared or posted anywhere on our site

Views: 9
Asked: 2 years ago