I’m new in programming in R and had the task of an special random walk on a lattice with segmented edges. Your example helped me very well to understand the basics and what for functions are useful.

I found a litte inconsistent. Your function random_walk only works for 1000 steps, because you set the fixed number 1000 in row 43. Also for the animation you set the fixed intervall/steps at 1000. ]]>

I have a generic issue w.r.t igraph outputs. However, I will ask you w.r.t clustering coefficient (CC).

igraph dumps the output of local CC values without telling which value belongs to whom ? However, I would like to get something like node_ID , Local CC value and then I can dump all this information into a csv file for all the nodes.

P.S: Nodes Ids do not necessarily have to follow any order.

Can you please let me know how can we get this information ?

Thanks in advance ! ]]>

The membership function is not working, do you have an idea why? ]]>

Thank you for the tutorial, I’m new to R and this has been very helpful.

I was wondering, when you fit the expected power law distribution on the curve, what does the value 10 in the equation:

lines(1:20,10*(1:20)^((-power$alpha)+1)) signify?

Is it an arbitrary constant? I could not find any reference to a variable (except that the upper limit for the y-axis is 10!)

Thank you for your reply,

Anan

A greedy heuristic that strives to minimize the total cost of the virtual network needed to satisfy the demand requirements and the physical link capacities. A pseudocode that fully describes how your heuristic determines the location and number of the virtual machines (VMs) and the virtual links that lead to that VMs to fulfill the demand given the physical resources.

Number of Nodes (N)

-Number of Links (L)

-Maximum node demand (D max)

-Maximum link capacity (C max)

-Cost of opening a new facility (F cost)

-Cost of introducing a virtual machine (V cost; V cost < F cost)

-Maximum load that can be handled by a virtual machine (V max) ]]>