DIMACS
DIMACS REU 2012

General Information

me
Student: Frederic Anglade
Office: Core 434
School: New York City College of Technology
E-mail: fanglade@reu.dimacs.rutgers.edu
Project: Clustering and Applications to Biodiversity

Given the competition graph G= (V, E) based on the Hudson river data sets with the node set (species) V, edge set E, and the weight matrix W (Wij = number of shared preys between ith and jth predators), it is possible to partition the competition graph G into two sub graphs GA and GB using the combination of Fiedler order and linkage-based refinements to minimize cut (A, B) while maximizing WA and WB at the same time

Weekly Log

Week 1:
Before I come to Dimacs Reu 2012, I met with my Mentor, Dr. Urmi Ghosh-Dastigar in order to know about the project I’m going to work on. She gave me some paper that I had to read to have a better understanding of the project. I left Brooklyn on Saturday, June 3, 2012 and I took the subway to go to Penn Station, NY. From there, I took the NJ transit to go to Linden to see my family. I left Linden on Sunday afternoon to go to Rutgers University. I got lost a little in the Busch Campus before I could reach Nichols Apartments where Kellen and Yusra were waiting for my arrival. They introduced me to my Apartment and they told me about what they planned for the Reu Student for his evening. After I met Alassane my roommate and my co-worker in this project and also some of the Reu Students, then we went to the Core Building together at 6:10 pm. We ate pizza and we watched a movie “The Prestige” and then we went back to the Nichols Apartments around 9:45 pm. We left Nichols Apartment before 8:00 am on Monday morning to go to the Core Building to have breakfast together and to meet with Dr. Gene Fiorini the Dimacs Reu Director. Soon we went to the orientation to meet with the Dimacs Staff and to know each other also and the evening we had a social meeting. On Tuesday, we had two seminars: Random Geometric Graphs, with Milan Bradonjic, Bell labs, Alcatel-Lucent and later Minimum Spanning Tree and connectivity of large Graphs in MapReduce with Donatella Firmani, Sapienza university of Rome. Finally we passed the most of our time to prepare our first presentation which we did it on Friday, June 8, 2012.
Week 2:
After I assisted to the seminar on Random Geometric Graphs: A tutorial Milan Bradonjic, Bell labs, Alcatel-lucent on Monday, I met with my mentor, Dr. Urmi Ghosh-Dastidar in order to set up what we are going to do. She gave us some new papers and she asked us to write the problem we are solving through the Min-Max Cut, to read the Laplacian, Normalized Laplacians, Adjacency Matrix, the review of Symmetric Matrices and we worked on them. I attended, on Friday, a seminar on: What makes a Math Problem beautiful with Jaroslav Nesetril, Department of Applied Mathematics Charles University.
Week 3:
On Monday, June 18, we went to in interesting trip to Watson Research Center, IBM to listen some great researchers who talked about their works like on Applied Mathematics to solve problems in real life, on cryptography and cryptanalysis with the issue of security, and the Watson project and his importance in researches and decisions making. I worked on the papers that my Mentor, Dr. Urmi Ghosh-Dastigar gave me. Alassane and I met with her on Wednesday and Friday to present our explanation of the Min-Max Cut and to talk about the data of our project. On Thursday, June 21, I attended a seminar on: Numerical Computation, Experimental Data, and Algebraic Topology with Konstantin Mischaikow, Mathematics, Rutgers.

Presentations

Additional Information