Re: [Boost-users] [BGL] what is the "Power-Law Out Degree" algorithm?

From: Rui Carvalho (rui.carvalho_at_[hidden])
Date: 2005-09-08 05:12:07

> -----Original Message-----
> From: Doug Gregor [mailto:dgregor_at_[hidden]]
> Sent: 07 September 2005 19:40
> To: boost-users_at_[hidden]
> Subject: Re: [Boost-users] [BGL] what is the "Power-Law Out Degree"
algorithm?
> > I mean, the PLOD model does not really stand shoulder to shoulder with
> > the
> > small word and erdos-renyi, does it?
> 
> It's not as popular, no, but that doesn't mean it isn't worthy :) Does
> is generate graphs poorly?
> 
> 	Doug

Hi Doug,

I've had a look at the paper by Palmer & Steffan. The paper proposes a
generator for power-law graphs in "real internet graphs".
Is this a model that may be relevant in a more general context? (e.g.
Biology where many users of the BGL come from)

The point I'm trying to make is not whether PLOD is interesting or not, I
think that should be left to the wider research community to decide.
In this sense, the Barabasi-Albert model is, so far, *the* accepted model
and its use goes beyond modelling the internet -so shouldn't it have
priority?

Anyway, thanks for the reference.

Cheers,
Rui