Modeling Of Complex Networks Project
Description
We have done an investigation on the connections in our class, and three corresponding social networks under different conditions (i.e., knowing someone’s name, knowing someone’s hometown,
and knowing someone’s dialect) are formulated. Please download the data from our assigned FTP.
(1) Perform some computer simulations (by using whatever computer software or programming language) on the three graphs to analyze the network properties (such as node-degree distribution, average shortest path-length, clustering coefficient, etc.) and dynamical behaviors (such as robustness against intentional attack and random attack, etc.).
(2) Calculate the node coreness in the three graphs;
(3) Draw necessary figures and/or tables to demonstrate your simulation results and to support your observations;
(4) To have extra bonus, you can develop a small system (including friendly interfaces, or graphic demonstrations) to show the layout of the networks of our class.
To see full project requirement : Project Requirment[pdf]
Run
-
install JDK and add it's path to environment
-
cd /bin
-
run command:
java -jar caiconghuai-networks.jar
Features
- A Concise UI Interface.
- Rich in Function.
- Simple Code, Use Java's Drawing Pack.
Preparation
In this project, you need to known the basic knowledge about complex networks, such as Erdos-Renyi random graph model, Watts-Strogatz small-world network network model, Newman-Watts small-world model and so on.
Property
| Attribute | finished |
|---|---|
| clustering coefficient | yes |
| coreness | yes |
| degree | yes |
| shortest path | yes |
| attention attack test | yes |
| random attack test | yes |
| node number/edge number statistics | yes |
| size of the largest subgraph | yes |
| average path length | yes |
Display
Contact
Any questions please contact me.
Email : [email protected]