Skip to content
#

dynamic-random-graphs

Star

Here are 2 public repositories matching this topic...

csbanon / pd-model

Star 1

The Preferential Deletion Model (PDModel) is an implementation of the original discrete-time random graph generation process described by Narsingh Deo and Aurel Cami. 2020.

social-media graph-algorithms social-networks graphs network-theory graph-theory networks social-network-analysis graph-generation degree-distribution dynamic-random-networks dynamic-random-graphs preferential-deletion preferential-node-deletion web-like-networks social-circles
  • Updated Jun 17, 2020
  • Java
pdc-model

csbanon / pdc-model

Star 1

The Preferential Deletion Model with Changing in Existing Connections (PDCModel) is an extension of the discrete-time random graph generation process described by Narsingh Deo and Aurel Cami in 2005. This new model accounts for changes in existing edges for every unit of time, representing the behavior of social circles more accurately. 2020.

social-media graph-algorithms social-networks graphs network-theory graph-theory networks social-network-analysis graph-generation degree-distribution dynamic-random-networks dynamic-random-graphs preferential-deletion preferential-node-deletion web-like-networks social-circles
  • Updated Oct 2, 2020
  • Java

Improve this page

Add a description, image, and links to the dynamic-random-graphs topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the dynamic-random-graphs topic, visit your repo's landing page and select "manage topics."

Learn more