[SOLVED] subgroups & hubs

[d-lam]

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

[mbastian]

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.

[d-lam]

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

[mbastian]

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.

[d-lam]

Thanks for the infos!!!!

Greetings,
D-Lam