IRPact_modellierung.network

Class GilbertCommunicationGraph

java.lang.Object

IRPact_modellierung.SimulationEntity

IRPact_modellierung.network.SocialGraph

IRPact_modellierung.network.CommunicationGraph

IRPact_modellierung.network.GilbertCommunicationGraph

public class GilbertCommunicationGraph
extends CommunicationGraph

The GilbertCommunicationGraph is a graph whose edges are all communicative edges and whose topology is initialized after the Gilbert random model, i.e. a random graph with a fixed probability for every potential edge. The probability for a communication edge is given by p.

Nested Class Summary

Nested classes/interfaces inherited from class IRPact_modellierung.network.SocialGraph

SocialGraph.EDGEMEDIUM

Field Summary

Fields inherited from class IRPact_modellierung.network.SocialGraph

edges, neighbours, nodes, outgoingEdges, outgoingEdgesMedium

Fields inherited from class IRPact_modellierung.SimulationEntity

associatedSimulationContainer

Constructor Summary

Constructors

Constructor and Description
GilbertCommunicationGraph(SimulationContainer associatedSimulationContainer, SNConfiguration sNConfiguration, int numberOfNodes) Constructor for the GilbertCommunicationGraph giving the number of nodes in the social graph explicitly
GilbertCommunicationGraph(SimulationContainer associatedSimulationContainer, SNConfiguration sNConfiguration, java.util.Set<SNNode> nodes) Constructor for the GilbertCommunicationGraph giving the nodes in the social graph explicitly
GilbertCommunicationGraph(SimulationContainer associatedSimulationContainer, SNConfiguration sNConfiguration, java.util.Set<SNNode> nodes, java.util.Set<SNEdge> edges, java.util.HashMap<SNNode,java.util.Set<SNNode>> neighbours) Constructor giving the parameter for the GilbertCommunicationGraph and the edges, as well as neighbourhood relations explicitly

Method Summary

Modifier and Type	Method and Description
void	addNodes(SNConfiguration sNConfiguration, java.util.Set<SNNode> nodesToAdd) Method to add a number of nodes to an existing graph.
java.util.Set<SNEdge>	createEdges(SNConfiguration sNConfiguration, java.util.Set<SNNode> initialNodes) For creating the edges for a set of nodes, all possible communicative edges are iterated, and for each edge it is decided whether it will be present or not
double	getP()

Methods inherited from class IRPact_modellierung.network.CommunicationGraph

getCommunicationNeighbours, getCommunicationNeighbours

Methods inherited from class IRPact_modellierung.network.SocialGraph

addEdge, addIsolatedNode, getAllMediaNeighbours, getEdges, getNeighbours, getNeighbours, getNeighbours, getNeighbours, getNodes, modifyEdgeMedium, modifyEdgeNodes, modifyEdgeSource, modifyEdgeTarget, removeEdge, replaceEdge, retrieveAllEdges, retrieveEdge

Methods inherited from class IRPact_modellierung.SimulationEntity

getAssociatedSimulationContainer

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

GilbertCommunicationGraph

public GilbertCommunicationGraph(SimulationContainer associatedSimulationContainer,
                                 SNConfiguration sNConfiguration,
                                 java.util.Set<SNNode> nodes,
                                 java.util.Set<SNEdge> edges,
                                 java.util.HashMap<SNNode,java.util.Set<SNNode>> neighbours)

Constructor giving the parameter for the GilbertCommunicationGraph and the edges, as well as neighbourhood relations explicitly

Parameters:

associatedSimulationContainer - The container the social network is embedded in

sNConfiguration - The configuration object of the social network

nodes - The nodes the graph contains

edges - The edges the graph contains

neighbours - The neighbourhood relationships of the graph

GilbertCommunicationGraph

public GilbertCommunicationGraph(SimulationContainer associatedSimulationContainer,
                                 SNConfiguration sNConfiguration,
                                 java.util.Set<SNNode> nodes)

Constructor for the GilbertCommunicationGraph giving the nodes in the social graph explicitly

Parameters:

associatedSimulationContainer - The container the social network is embedded in

sNConfiguration - The configuration object of the social network with the socialGraph parameter containing the parameter 'p'

nodes - The nodes the socialGraph is based upon

GilbertCommunicationGraph

public GilbertCommunicationGraph(SimulationContainer associatedSimulationContainer,
                                 SNConfiguration sNConfiguration,
                                 int numberOfNodes)

Constructor for the GilbertCommunicationGraph giving the number of nodes in the social graph explicitly

Parameters:

associatedSimulationContainer - The container the social network is embedded in

sNConfiguration - The configuration object of the social network with the socialGraph parameter containing the parameter 'p'

numberOfNodes - The nodes the socialGraph is based upon

Method Detail

getP

public double getP()

addNodes

public void addNodes(SNConfiguration sNConfiguration,
                     java.util.Set<SNNode> nodesToAdd)

Method to add a number of nodes to an existing graph. Considers all possible (new) communication edges in the graph, and adds them stochastically, proportionally to the set parameter

Overrides:

addNodes in class SocialGraph

Parameters:

sNConfiguration - The configuration the graph is based upon

nodesToAdd - The nodes to be added to the social graph

createEdges

public java.util.Set<SNEdge> createEdges(SNConfiguration sNConfiguration,
                                         java.util.Set<SNNode> initialNodes)

For creating the edges for a set of nodes, all possible communicative edges are iterated, and for each edge it is decided whether it will be present or not

Specified by:

createEdges in class SocialGraph

Parameters:

sNConfiguration - The configuration of the social graph of interest

initialNodes - The nodes the social graph should be initialized with

Returns:

The set of (stochastically chosen) edges within the network