https://reu.cs.mu.edu/index.php?title=User:Lschumac&feed=atom&action=historyUser:Lschumac - Revision history2020-07-08T05:38:51ZRevision history for this page on the wikiMediaWiki 1.23.13https://reu.cs.mu.edu/index.php?title=User:Lschumac&diff=497&oldid=prevBrylow: 1 revision2015-06-12T06:25:31Z<p>1 revision</p>
<table class='diff diff-contentalign-left'>
<tr style='vertical-align: top;'>
<td colspan='1' style="background-color: white; color:black; text-align: center;">← Older revision</td>
<td colspan='1' style="background-color: white; color:black; text-align: center;">Revision as of 06:25, 12 June 2015</td>
</tr><tr><td colspan='2' style='text-align: center;'><div class="mw-diff-empty">(No difference)</div>
</td></tr></table>Brylowhttps://reu.cs.mu.edu/index.php?title=User:Lschumac&diff=496&oldid=prevLschumac: /* Minimum i, k Values for Complete (i,k)-Step Competition Graphs Research */2014-06-09T22:03:15Z<p><span dir="auto"><span class="autocomment">Minimum i, k Values for Complete (i,k)-Step Competition Graphs Research</span></span></p>
<p><b>New page</b></p><div><br />
<br />
== Minimum i, k Values for Complete (i,k)-Step Competition Graphs Research ==<br />
<br />
'''Week 1'''<br />
<br />
''Monday May 26''<br />
<br />
- Memorial Day<br />
<br />
''Tuesday May 27''<br />
<br />
-Orientation<br />
<br />
-Researched background in Food Webs and Competition Graphs <br />
<br />
''Wednesday May 28''<br />
<br />
-Met with Dr. Factor<br />
<br />
-Created (1,k)-step competition graphs for food webs in BioMath <br />
<br />
-Identified similarities between webs with and without complete competition graphs (# of vertices vs. # of arcs, # of chains in the web, in and out degree of vertices, etc.)<br />
<br />
''Thursday May 29''<br />
<br />
- Determined why complete competition graphs cannot be created for specific food webs<br />
<br />
- Created and analyzed the minimum k value required to find a complete (1, k) step competition graph for acyclic digraphs (with 8 vertices) in which all vertices share the same sum of indegree and outdegree<br />
<br />
''Friday May 30''<br />
<br />
- Determined why complete competition graphs cannot be created for specific food webs<br />
<br />
- Created and analyzed the minimum k value required to find a complete (1, k) step competition graph for acyclic digraphs (with 10 and 12 vertices) in which all vertices share the same sum of indegree and outdegree<br />
<br />
<br />
'''Week 2'''<br />
<br />
''Monday June 2''<br />
<br />
- Looked at the relationship between the minimum i,k values needed for a complete competition graph to the length of the shortest chains from each vertex to the primary producer (once again with graph in which each vertex has the same sum of indegree and outdegree)<br />
<br />
''Tuesday June 3''<br />
<br />
- Found examples of graphs to back up the patterns I have been seeing in digraphs in which the sum of the in and out degree is the same for all vertices <br />
<br />
''Wednesday June 4''<br />
<br />
- Finalized patterns I have found and gathered examples to be able to explain findings to Zornica<br />
<br />
- Collaborated with Zornica to discuss progress and findings<br />
<br />
- Reported our progress to Dr. Factor<br />
<br />
''Thursday June 5''<br />
<br />
- Found a few digraphs which do not seem to fit with my theory<br />
<br />
- Tried to find differences between digraphs in which the patterns do occur versus the digraphs in which the patterns do not occur<br />
<br />
''Friday June 6''<br />
<br />
- Began researching the history of competition graphs in food webs for the background of my final paper<br />
<br />
<br />
'''Week 3'''<br />
<br />
''Monday June 9''<br />
<br />
- Continued to look for a pattern between minimum i, k values and the longest and shortest paths of each vertex to a primary producer of an acyclic digraph in which the sum of the in and out degrees are the same for each vertex.<br />
<br />
- Found patterns between the average shortest path with the minimum i value and the average longest path with the minimum k value.</div>Lschumac