Processed through Paypal
No account required.


Donate Bitcoin to this wallet:
1KkUMXvQ2ko3xcJkzitB7WYgoW6m79WFfm
Donate Ethereum to this wallet:
0x40E56922F43637224935CDC35e2c96E0392A8505
Donate Litecoin to this wallet:
LLYAFEyqjH69gkyCEpRjXNyedRCWrVChfL
Facebook Follow @GeekOnTheLoose




 Home » OlderGeeks.com Freeware Downloads » Toys, Fun Geek Stuff and Other Software » Social Network Visualizer 2.4 Windows   
File - Download Social Network Visualizer 2.4 Windows
Description

Always scroll to the bottom of the page to download files on OlderGeeks.com.
We don't believe in fake/misleading download buttons and tricks.


Social Network Visualizer 2.4 Windows
Social Network Visualizer (SocNetV) is a cross-platform, user-friendly software for social network analysis and visualization. Social Networks are displayed and analyzed as mathematical graphs, where vertices depict actors/agents and edges represent their relations.

With SocNetV you can draw social networks with a few clicks on a virtual canvas or load field data from various social network formats supported such as GraphML, GraphViz, Adjacency, Pajek, UCINET, etc.

Furthermore, you can create random networks using various random network generation models (Barabási–Albert Scale-Free, Erdős–Rényi, Watts-Strogatz Small-World, d-regular, ring lattice, etc) or recreate famous social network analysis datasets, i.e. Padgett's Florentine families.

A simple web crawler is also included to automatically create "social networks" from links found in a given initial URL. The crawler scans the given web page for links and visualizes the network of all webpages/sites linked from it.

SocNetV enables you to edit your social network data through point-and-click, analyse their social and mathematical properties, produce reports for these properties and embed visualization layouts for relevant presentation of each network.

It also supports multirelational loading and editing. You can load a social network consisting of multiple relations or create a social network on your own and add multiple relations to it.

SocNetV easily computes basic graph-theoretic properties, such as density, diameter, geodesics and distances (geodesic lengths), connectedness, eccentricity, etc. But it also computes advanced structural measures for social network analysis such as centrality and prestige indices (i.e. closeness centrality, betweeness centrality, information centrality, power centrality, proximity and pagerank prestige), triad census, clique census, clustering coefficient, etc.

The application supports various layout algorithms based either on prominence indices (i.e. circular, level and nodal sizes by centrality score) or on force-directed models (i.e. Eades Spring Embedder, Fruchterman-Reingold, etc) for meaningful visualizations of the social networks.

The program is Free Software, licensed under the GNU General Public License 3 (GPL3).
You can copy it as many times as you wish, or modify it, provided you keep the same license. The documentation is also Free, licensed under the Free Documentation License (FDL).

ChangeLog:

Version 2.4 - Feb 28, 2018
Codename: "trouble"
------------------
* New Feature: Kamada-Kawai layout model.
- In this model, the network is considered to be a dynamic system
where every two actors are 'particles' mutually connected by a 'spring'.
Each spring has a desirable length, which corresponds to their graph
theoretic distance. In this way, the optimal layout of the graph
is the state with the minimum imbalance. The degree of
imbalance is formulated as the total spring energy:
the square summation of the differences between desirable
distances and real ones for all pairs of particles
Initially, the particles/actors are placed on the vertices of a regular n-polygon
* New Feature: Node colors by prominence score visualization layout.
- Up to now, SocNetV could visualize actor prominence (centrality or prestige score)
in radial, level and node size layouts. SocNetV v2.4 supports
a node coloration layout, where the color of each node depicts its score in a
user-selected Prominence index. Simply put, the color shows how important the actor
is inside the network in terms of Centrality or Prestige.
To do this, SocNetV computes the prominence index scores of all actors and
then changes the color of every node using the HSV color model. To be precise,
different values of hue (from 0, which is absolute red to 240, which is absolute blue),
are used according to the prominence score of each node.
This way, the least important actors (the periphery) are colored blue while
the most important ones (the core) are colored red. The prominence scores between
these two corner cases follow the familiar color wheel. I.e. an actor colored
yellow means it is more important than those colored blue, cyan or green but
less important than the ones colored red. See color wheel example:
https://upload.wikimedia.org/wikipedia/commons/a/a4/RGB_color_circle.png
* New behavior: Reciprocated edges in directed networks appear in a single line.
Up to now, SocNetV displayed reciprocated directed edges between two actors A and B in
two separate lines, one for the A -> B tie and another for the A <- B tie. That was
problematic in terms of memory consumption (double edge graphic items) on very large
directed nets. It also made the network visualization less attractive as the user was
seeing double lines between nodes. From now on, SocNetV displays the reciprocated ties
between actors in a single line with two arrows. On clicking a reciprocated edge,
the Statistics panel displays info that this is a reciprocated edge along with the
weights of both arcs. If you right-click a reciprocated edge and select "Remove edge"
or "Change Edge Weight" the application asks which of the two directed edges you want
to remove/change, for instance "A --> B" or "B --> A".
* Improved memory consumption during user interaction with large networks.
Previous versions of SocNetV used to consume a lot of RAM when loading very large
networks (i.e. more than 2,000 edges). This version has been optimized to minimize
memory consumption in those cases.
* New options and features in web crawler.
Web crawler dialog and algorithm has been enhanced with nice new options and features.
The user may now specify certain link patterns to include or avoid during parsing a web page.
The crawler can also stop creating self-links, and wait for a random amount of msecs (0-1000)
between connections.
* Improved Statistics Panel.
The LCDs in the statistics panel have been replaced by simpler strings which display the
same statistics, plus with greater efficiency. For instance, when clicking on a reciprocated
edge in a directed network, the Statistics panel displays the weights of both edge directions.
* Added Performance options in Settings dialog.
New Performance options have been added in app Settings dialog (Canvas tab).
The user may now select which features of the Qt GraphicsView will be enabled.
Available options include pretty much all features of Qt GraphicsView, such as
antialiasing, antialiasing auto-adjustment, smooth pixmap transformation,
painter state saving, background caching, canvas update mode, canvas indexing
method and edge highlighting.
Of all these options, the latter (edge highlighting) has the most immediate effect
on performance. Disabling edge highlighting in networks with thousands of edges
will give a performance boost and make the interaction with the network quicker.
Also, if you need max performance, we recommend disabling all checkboxes.
* Improved UCINET format support (fullmatrix two-mode and edgelist).
SocNetV can now read two-mode UCINET files formatted in fullmatrix format. That is files that
declare both NR and NC variables. For instance, a file that declares a two-mode sociomatrix
of NR actors and NC organizations.
Work will be done in future versions to let the user select if she wants one-mode or two-mode data visualization.
At the moment, the two-mode network is visualized as follows:
First, for every row in the fullmatrix, a node i is created numbered 1:NR
Then for each column another node j is created, numbered NR:NC. Thus, the two mode network
consists of a total of NR+NC nodes.
For each non-zero (i,j) element of the fullmatrix, an edge from actor i to organization j is created.
Also, the application can now import edgelist1 formatted UCINET files which were
exported from R's sna package.
* Improved "Check for updates" procedure.
On clicking Help > "Check for updates, the app will check for the latest version released,
compare it with the version it runs and inform the user if an updated version is available.
In future versions, we might have this routine to run on load.
* Improved stability
Many bugs have been fixed and random crashes were resolved. See fixed bugs below for more.

* Bugs Fixed and closed:
#40: Wrong BC scores when the network is weighted
#54: Using 1 as weight even after saying yes to weight dialogs in some cases
#38: Disabling isolate nodes has no effect in distance matrix report
#41: Wrong variance value in clustering coefficient (in repeated computations)
#33: Missing Radial/Level Layout by Eigenvector Centrality
#48: Eccentricity scores should be infinite for those nodes which are either isolated or
cannot reach some other node. Nodes which can reach all other nodes should have
finite eccentricity.
#34: Menu options to apply Node Size layout by Prominence index
#56: Edges do not offset from source/target node when node changes size
#46: (regression) crashes on distance matrix after disabling isolates
#42: Proper progress dialogs
#44: Crash on second search after node removal
#24: No Performance options in Settings
#51: Web crawler: Fix random crashes
#60: Wrong filename extension when saving an automatically generated famous data set
#61: The "Save As" method does not always save networks in graphml format
#62: Some "edgelist1" formatted UCINET files are not recognizable
#63: Two-mode UCINET files are not supported
#65: Crash when doing Hierarchical Cluster Analysis with ill-defined input matrix
#36: Crashes on HCA with isolated nodes
#49: Connectedness method sometimes returns default result
#47: Extra columns displayed in Adjacency Matrix report when the user has disabled nodes.






















Downloads Views Developer Last Update Version Size Type Rank
847 3,855 Dimitris V. Kalamaras <img src="https://www.oldergeeks.com/downloads/gallery/thumbs/Social Network Visualizer1_th.png"border="0"> Nov 12, 2018 - 12:56 2.4 27.11MB EXE 5/5, out of 13 Votes.
File Tags
Social  2.4  Network  Visualizer  Windows  
   

Whoa there, Speedy! Your download is below
but you gotta read this first:

Like seeing no ads? No scammy, fake download buttons?
Wondering who's paying for the bandwidth? Well, we're
depending on you. This site operates on the honor system.
If your momma raised you to be honorable, you get to go
nuts downloading all you want after you make a donation.
This is how the site stays alive. Everyone hates ads. YUCK!
No one is stopping you from downloading without donating,
no one except your momma.
Thank you! -Randy & Deanna (The Older Geeks)

Monthly operating costs = $480
Donations for November = $157
Processed securely through Paypal.
No PayPal account required.

Donate Bitcoin:
1KkUMXvQ2ko3xcJkzitB7WYgoW6m79WFfm

Donate Ethereum:
0x40E56922F43637224935CDC35e2c96E0392A8505

Donate Litecoin:
LLYAFEyqjH69gkyCEpRjXNyedRCWrVChfL



Recent Super Donors ($50+)
Thanks, Joanna
Thanks, Bruce
Thanks, Travis

Recent Donors
Thanks, Midway Electronics
Thanks, Miles
Thanks, Chris
Thanks, Mikal
Thanks, Robert
Thanks, Richard
Thanks, Paul
Thanks, Bill's Motorcycle Repair

→→ Download Now ←← - Click to Rate File -
Like? Share this page on Twitter →


Copyright (c) 2018