| Subject: | |
| From: | |
| Reply To: | |
| Date: | Tue, 27 Mar 2018 00:04:48 +0000 |
| Content-Type: | multipart/alternative |
| Parts/Attachments: |
|
|
12pm is the time that this happens. BTW.
pp
http://uvm.edu/~scraps
On Mar 26, 2018, at 8:01 PM, Student Complexity Research <[log in to unmask]<mailto:[log in to unmask]>> wrote:
WHICH MEANS ITβS TIME FOR FREE FOOD
And science. That too. Super educational.
We got Jack on the mic. Hereβs his quick 16:
Modular systems are becoming more and more popular for optimization, as subsystems can be improved with a lower risk for inhibiting the overall system performance. In the simplest definition, modularity is sparsely connected dense regions. Described by Mark Newman and Michelle Girvan in their 2006 paper, we can measure this with the Q-metric. Using the Newman-Girvan algorithm, Q can be computed (albeit expensively,) for a given graph and the number of modules. The Q returned can be promising to find strong modules within the graph, but it can also be misleading. Often, other modularity scoring algorithms are used in conjunction to provide further evidence of a modular structure. The focus of this talk will be on the Q-metric, but other metrics will also be discussed and how they differ. The talk will also include developing modular graphs through evolutionary methods, applications of modular networks, and where this research is going.
π₯π₯π₯π₯π₯π₯π₯π₯π₯π₯π₯π₯π₯π₯π₯π₯π₯π₯π₯π₯π₯π₯π₯π₯π₯π₯π₯π₯π₯π₯π₯π₯π₯π₯π₯π₯π₯π₯π₯π₯π₯π₯π₯π₯
Get after it.
Farrell Hall, Decision TheatrΓ©
pizza provider
http://uvm.edu/~scraps
|
|
|