OK -- I'm going to try and reach out to the original integrator and see if I can figure it out.
Since infomap is random-walk based, I _think_ the code would require some accommodation for disconnected components (like tunneling or code to iterate over components). But it's also possible that infomap has been updated since that comment was written and it's no longer relevant. On Thu Jan 15 2015 at 11:08:59 AM Thomas Lin Pedersen <[email protected]> wrote: > I don’t know - While I’m not 100% sure I can’t recall anything about that > from the initial article. > > The only thing I can say is that it seems to work fine on my extremely > sparse graphs… > > > On 15 Jan 2015, at 17:52, Nick Eubank <[email protected]> wrote: > > I'm not entirely sure -- I've been having trouble getting infomap to run > to completion on a very large network (10 million nodes, 200 million > edges), and while trouble shooting found that note in the C documentation > and (a) thought it might be an explanation, and (b) was nervous about that > note not appearing in the other documentation. I'm running infomap on the > giant component now to see if that fixes the problem, but it's not done > yet... > > Do you think the note in the C documentation is wrong or out of date? > On Thu, Jan 15, 2015 at 12:21 AM Thomas Lin Pedersen <[email protected]> > wrote: > >> Can this be elaborated upon? I use infomap on very sparse graph that both >> contains unconnected subgraphs as well as zero-degree vertices and haven’t >> experienced any problems… >> >> /Thomas >> >> >> On 14 Jan 2015, at 22:22, Gábor Csárdi <[email protected]> wrote: >> >> Agreed! https://github.com/igraph/rigraph/issues/59 Gabor >> >> On Wed, Jan 14, 2015 at 3:17 PM, Nick Eubank <[email protected]> >> wrote: >> >>> Hi All, >>> >>> Two quick things: >>> - the C notes for community_infomap() say infomap can't take isolated >>> vertices. It might be a good idea to put that note in the python and R >>> documentation. I only found it after lots of trouble shooting. >>> - Does "isolated vertices" mean no vertices of degree zero, or no >>> disconnected components? >>> >>> Thanks! >>> >>> Nick >>> >>> _______________________________________________ >>> igraph-help mailing list >>> [email protected] >>> https://lists.nongnu.org/mailman/listinfo/igraph-help >>> >>> >> _______________________________________________ >> igraph-help mailing list >> [email protected] >> https://lists.nongnu.org/mailman/listinfo/igraph-help >> >> >> _______________________________________________ >> igraph-help mailing list >> [email protected] >> https://lists.nongnu.org/mailman/listinfo/igraph-help >> > _______________________________________________ > igraph-help mailing list > [email protected] > https://lists.nongnu.org/mailman/listinfo/igraph-help > > > _______________________________________________ > igraph-help mailing list > [email protected] > https://lists.nongnu.org/mailman/listinfo/igraph-help >
_______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
