Dimitris Kalamaras
Dimitris Kalamaras
User notes: > I can use tha pan function when zoomed in, but I cannot get across the boundaries of the "central" network that I'm automatically zooming in. I have...
Currently, our Windows installer and executables are unsigned which means that before starting the installation Windows shows the user the following message: To solve this we need (to buy *)...
A user suggests: It would be nice if SocNetV could apply a layout where the color of each node indicates its clustering coefficient.
SocNetV should implement Bonacich Power Centrality BPC (alpha,beta) (not to be confused with the already implemented Power Centrality (PC), a generalized degree centrality measure suggested by Gil and Schmidt). See...
SocNetV should compute Network Connectivity. This is the number of nodes that would have to be removed in order for one actor to no longer be able to reach another....
Except HCA, SocNetV should implement the following clustering algorithms to automate finding community structure: - the Girvan-Newman algorithm, older one for small graphs mainly, see paper " Community structure in...
SocNetV needs to provide more methods for the identification of cohesive subgroups in one-mode networks. -n-cliques -n-clans and n-clubs -k-plexes - matrix permutation approaches
SocNetV should be able to draw a barplot which will show the share of geodesics having a given length. This will help the user to understand how short are the...
Question by N. SajedianFard: _Does SocNetV give us the number of the connected components of the network? and is it possible to visualize the network based on the components? I...
In multi-relational networks where one relation is weighted/valued, the program interprets all relations as valued and uses Dijkstra algorithm for distances/indices computation. This is usually not a problem, since it...