- Year: 2020
- Language(s): Java, TeX
- Discipline(s): Algorithm Design and Analysis, Graph Theory, Network Theory
- Keywords:
Degree-Distribution
,Dynamic-Random-Graphs
,Dynamic-Random-Networks
,Graphs
,Graph-Algorithms
,Graph-Generation
,Graph-Theory
,Networks
,Network-Theory
,Preferential-Deletion
,Preferential-Node-Deletion
,Social-Circles
,Social-Media
,Social-Networks
,Social-Network-Analysis
,Web-Like-Networks
The Preferential Deletion Model (PDModel) is an implementation of the original discrete-time random graph generation process described by Narsingh Deo and Aurel Cami in their 2005 paper Preferential Deletion in Dynamic Models of Web-Like Networks.
This implementation was then used to replicate the findings of Deo and Cami's study. This project resulted in the following:
- An Implementation of Preferential Deletion in Dynamic Models of Web-Like Networks, a research-style paper in which the findings from Deo and Cami's original study are replicated. Please note that this is not a published paper.
- The source code for the implementation of the PDModel, developed in Java.
This project is the first of a two-part research study conducted in the COT 5405: Design and Analysis of Algorithms graduate course at the University of Central Florida. This part presents an implementation of Deo and Cami's original model and replicates their findings, while the second part extends the implementation to account for changes in existing connections throughout the random graph generation process.
- Download the
PDModel
repository. - Open
Run.java
in thecode
directory. Use this file to modify the values ofTIME
,TRIALS
, andP
. These values are defined as follows:
TIME
: the discrete value of time the model will run for.TRIALS
: the number of trials to run.P
: the value of p for the model. (There may be various values for p to be used for comparisons. For a detailed explanation of p, see the paper.)
- Compile
Run.java
using the following command:javac Run.java
- Run the file using the following command:
java Run