NAME
node_deg_over_time.py - Time evolution of the degree of a node in a growing graph.
SYNOPSYS
node_deg_over_time.py <layer> <arrival_times> <node_id> [<node_id> ...]
DESCRIPTION
Compute the degree ki(t) of node i in a growing network as a function of time. The file layer contains the edge list of the final network. Each line of the file is in the format:
src_ID dest_ID
where src_ID and dest_ID are the IDs of the two endpoints of an edge.
The file arrival_times is a list of node arrival times, in the format:
time_i node_i
where time_i is the time at which node_i arrived in the graph. Notice that time_i must be an integer in the range [0, N-1], where N is the total number of nodes in the final graph.
The third parameter node_id is the ID of the node whose degree over time will be printed on output. If more than one node_id is provided, the degrees over time of all the corresponding nodes are printed on output.
OUTPUT
The program prints on stdout a list of lines in the format:
t kit
where kit is the degree of node i at time t. The first line of output is in the format:
#### node_id
where node_id is the ID of node i.
If more than one node_ids is provided as input, the program prints the degree over time of all of them, sequentially.
REFERENCE
V. Nicosia, G. Bianconi, V. Latora, M. Barthelemy, “Growing multiplex networks”, Phys. Rev. Lett. 111, 058701 (2013).
Link to paper: http://prl.aps.org/abstract/PRL/v111/i5/e058701