Hi,
how can I identify & separate subgroups in a network?
And is there an algorithm who make hubs more visible? For example pushes parts (some nodes) in the network who are closer/denser in itself apart .....and maybe in the middle (between all the parts)....there is a hub!?!?!?
Thanks & Greetings,
D-Lam
[SOLVED] subgroups & hubs
- mbastian
- Gephi Architect
- Posts:728
- Joined:10 Dec 2009 10:11
- Location:San Francisco, CA [phpBB Debug] PHP Warning: in file [ROOT]/vendor/twig/twig/lib/Twig/Extension/Core.php on line 1275: count(): Parameter must be an array or an object that implements Countable
Re: subgroups & hubs
Hi
Subgroups and communities can be found with using Modularity algorithm, as showed in the Quick Start.
I don't understand what you mean about hubs more visible? I think the best way to make a node more visible is to increase its size. And you can do that in Ranking. Maybe you can provide a screenshot to explain what you need.
Subgroups and communities can be found with using Modularity algorithm, as showed in the Quick Start.
I don't understand what you mean about hubs more visible? I think the best way to make a node more visible is to increase its size. And you can do that in Ranking. Maybe you can provide a screenshot to explain what you need.
-
- Posts:20
- Joined:04 May 2010 01:13 [phpBB Debug] PHP Warning: in file [ROOT]/vendor/twig/twig/lib/Twig/Extension/Core.php on line 1275: count(): Parameter must be an array or an object that implements Countable
Re: subgroups & hubs
Hi,
thanks for your help.
Subgroups: Ok, you are right, but especially I mean subgroups (dyadics & more) who are disconnected with the main network. For isolates it is easy (degree filter).....but for dyadics or more???
In networks with 10000 nodes & edges it's hard to see under so many edges if there is a dyadic in the middle of the network!
For example I thought there is an algorithm (maybe the force atlas do that) who design the network from... to....... I thought it is important because for closeness or betweenness I need one connected network without disconnected subgroups....so I have to delete these disconnected subgroups.....or can Gephi handle that???
Hubs: Yeah you are right again......my fault.....I mean another visualization (mhhhh....I hope I mean that )......so from.... to...... Especially for networks with 10000 and more nodes & edges it's very helpful! Or is it what the Force Atlas do(or something like this)???
Thanks & Greetings,
D-Lam
thanks for your help.
Subgroups: Ok, you are right, but especially I mean subgroups (dyadics & more) who are disconnected with the main network. For isolates it is easy (degree filter).....but for dyadics or more???
In networks with 10000 nodes & edges it's hard to see under so many edges if there is a dyadic in the middle of the network!
For example I thought there is an algorithm (maybe the force atlas do that) who design the network from... to....... I thought it is important because for closeness or betweenness I need one connected network without disconnected subgroups....so I have to delete these disconnected subgroups.....or can Gephi handle that???
Hubs: Yeah you are right again......my fault.....I mean another visualization (mhhhh....I hope I mean that )......so from.... to...... Especially for networks with 10000 and more nodes & edges it's very helpful! Or is it what the Force Atlas do(or something like this)???
Thanks & Greetings,
D-Lam
- mbastian
- Gephi Architect
- Posts:728
- Joined:10 Dec 2009 10:11
- Location:San Francisco, CA [phpBB Debug] PHP Warning: in file [ROOT]/vendor/twig/twig/lib/Twig/Extension/Core.php on line 1275: count(): Parameter must be an array or an object that implements Countable
Re: subgroups & hubs
Yes for subgroups you're looking for "Connected components". The algorithm is very easy, but we don't have it yet in Gephi. We should add this in the next release I guess.
And getting the network without disconnected components is looking for what is named the "Giant Component". A filter is also missing to get it.
And for hubs, yes using ForceAtlas layout algorithm definitely makes the network readable and reveals structures.
And getting the network without disconnected components is looking for what is named the "Giant Component". A filter is also missing to get it.
And for hubs, yes using ForceAtlas layout algorithm definitely makes the network readable and reveals structures.
-
- Posts:20
- Joined:04 May 2010 01:13 [phpBB Debug] PHP Warning: in file [ROOT]/vendor/twig/twig/lib/Twig/Extension/Core.php on line 1275: count(): Parameter must be an array or an object that implements Countable
Re: subgroups & hubs
Thanks for the infos!!!!
Greetings,
D-Lam
Greetings,
D-Lam