View Proposal #213
If this proposal belongs to you, you are authorized to update it. Use the menu on the right.
| ID | 213 |
|---|---|
| First Name | Krishna B. |
| Last Name | Athreya |
| Institution | Iowa State University |
| Speaker Category | faculty |
| Title of Talk | Preferential Attachment Random Graphs with General Weight Function |
| Abstract | Start with a graph G_0 = {V_1 , V_2} with one edge connecting the two vertices V_1, V_2. Now create a new vertex V_3 and attach it (i.e. add an edge) to V_1 or V_2 with equal probability. Set G_3={V_1 , V_2, V_3}. Let G_n={V_1, |
| Subject area(s) | |
| Suitable for undergraduates? | Yes |
| Day Preference | |
| Computer Needed? | |
| Bringing a laptop? | |
| Overhead Needed? | |
| Software requests | |
| Special Needs | |
| Date Submitted | 4/5/2007 |
| Year | 2007 |