Re: [igraph] Using power law distribution to generate a scale-free graph

[Gábor Csárdi]

I don't know any such work. Actually I still don't know what you mean
by 'power distribution to unify'.

Anyway, maybe it is worth checking some "complex networks" review
articles (Newman's, Boccaletti's) and the review about power laws by
Newman: http://arxiv.org/abs/cond-mat/0412004.

Possibly there are newer ones as well.

G.

On Tue, Jun 12, 2012 at 4:55 AM, shahab <address@hidden> wrote:
> Thanks Gabor for the point.  But I am mostly looking  for a
> theoretical foundation , an analytically supported proof.
> I appreciate if you point me to related work in this direction.
>
> best,
> /Shahab
>
> On Thu, Jun 7, 2012 at 4:54 PM, Gábor Csárdi <address@hidden> wrote:
>> Hi,
>>
>> On Thu, Jun 7, 2012 at 8:02 AM, shahab <address@hidden> wrote:
>> [...]
>>> Now knowing that I exploited a power distribution function to unify
>>> some nodes, can I imply that  G'  is a scale-free graph and exposes a
>>> power law distribution on node degrees?
>>
>> I am not sure what you mean by 'power distribution to unify'. Maybe
>> you can, but why don't you just do some simulations to check? (If
>> calculating it directly is difficult.)
>>
>> G.
>>
>> [...]
>>
>> _______________________________________________
>> igraph-help mailing list
>> address@hidden
>> https://lists.nongnu.org/mailman/listinfo/igraph-help
>
> _______________________________________________
> igraph-help mailing list
> address@hidden
> https://lists.nongnu.org/mailman/listinfo/igraph-help



-- 
Gabor Csardi <address@hidden>     MTA KFKI RMKI