[phpBB Debug] PHP Warning: in file [ROOT]/phpbb/session.php on line 583: sizeof(): Parameter must be an array or an object that implements Countable
[phpBB Debug] PHP Warning: in file [ROOT]/phpbb/session.php on line 639: sizeof(): Parameter must be an array or an object that implements Countable
Gephi forumsPlease post new questions on facebook group too (https://www.facebook.com/groups/gephi) 2010-05-17T13:43:52+01:00 https://forum-gephi.org/app.php/feed/topic/223 2010-05-17T13:43:52+01:002010-05-17T13:43:52+01:00 https://forum-gephi.org/viewtopic.php?t=223&p=770#p770 <![CDATA[Re: subgroups & hubs]]>
Greetings,
D-Lam

Statistics:Posted by d-lam — 17 May 2010 13:43


]]>
2010-05-14T23:26:07+01:002010-05-14T23:26:07+01:00 https://forum-gephi.org/viewtopic.php?t=223&p=760#p760 <![CDATA[Re: subgroups & hubs]]>
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.

Statistics:Posted by mbastian — 14 May 2010 23:26


]]>
2010-05-14T12:14:57+01:002010-05-14T12:14:57+01:00 https://forum-gephi.org/viewtopic.php?t=223&p=755#p755 <![CDATA[Re: subgroups & hubs]]> 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...
NW.JPG
to.......
NW disconnected subgroups.JPG
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....
NW1.JPG
to......
NW hub.JPG
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

Statistics:Posted by d-lam — 14 May 2010 12:14


]]>
2010-05-14T09:05:12+01:002010-05-14T09:05:12+01:00 https://forum-gephi.org/viewtopic.php?t=223&p=753#p753 <![CDATA[Re: subgroups & hubs]]>
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.

Statistics:Posted by mbastian — 14 May 2010 09:05


]]>
2010-05-13T17:33:11+01:002010-05-13T17:33:11+01:00 https://forum-gephi.org/viewtopic.php?t=223&p=752#p752 <![CDATA[[SOLVED] subgroups & hubs]]>
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

Statistics:Posted by d-lam — 13 May 2010 17:33


]]>