Density Optimization
Implementation of the density optimization algorithm as a post processing algorithm.
postProcessDensOpt(dyncomm,Parameters)
dyncomm |
a DynCom post processing algorithm. See |
Parameters |
A two column matrix defining the parameters for this algorithm. See the PARAMETERS section on this page |
Is an algorithm that provides a community structure, not explicitly based on modularity, but based on the increase of the average community density. Contrary to modularity-based algorithms, it tends to disband large communities into smaller ones. It is an algorithm currently developed for directed networks only.
postProcessDensOpt object
Uses a matrix with three columns and a maximum of verticelAll()^2 rows with the edges between vertices and their weight (vertex<->vertex<->weight) of the original graph. Temporarily stores a copy of the graph to calculate a new community mapping.
Uses a matrix with two columns and verticesAll() rows with the new community mapping (vertex<->community). Uses a matrix with three columns and a maximum of communityCount()^2+communityCount() rows with the edges between communities and their weight (community<->community<->weight).
Get additional results of the algorithm or the currently selected post processing steps. See results
Get the quality measurement of the graph after the last iteration. See quality
Get the number of communities after the last iteration. See communityCount
Get all communities after the last iteration. See communities
Get the number of community to community edges in the graph. See communitiesEdgeCount
Get the neighbours of the given community after the last iteration. See communityNeighbours
Get the sum of weights of the inner edges of the given community after the last iteration. See communityInnerEdgesWeight
Get the sum of weights of all edges of the given community after the last iteration. See communityTotalWeight
Get the weight of the edge that goes from source to destination after the last iteration. See communityEdgeWeight
Get the amount of vertices in the given community after the last iteration. See communityVertexCount
Get the community of the given vertex after the last iteration. See community
Get the total number of vertices after the last iteration. See vertexCount
Get all vertices in the graph after the last iteration. See verticesAll
Get the neighbours of the given vertex after the last iteration. See neighbours
Get the weight of the edge that goes from source vertex to destination vertex after the last iteration. See edgeWeight
Get all vertices belonging to the given community after the last iteration. See vertices
Get the community mapping for all communities after the last iteration.See communityMapping
Get the community mapping for all communities after the last iteration.See communityMapping
poltergeist0
## Not run:
Parameters<-matrix(c("-e","0.1"),1,2,TRUE)
dc<-DynCommMain(ALGORITHM$LOUVAIN,CRITERION$MODULARITY,Parameters)
dc$addRemoveEdgesFile("initial_graph.txt")
dc$communityCount()
dc$communities()
dc$communityNodeCount(1)
dc$vertices(1)
dc$communityMapping(TRUE)
dc$time()
dc$addRemoveEdgesFile("s0000000000.txt")
## End(Not run)Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.