Permalink
Cannot retrieve contributors at this time
Name already in use
A tag already exists with the provided branch name. Many Git commands accept both tag and branch names, so creating this branch may cause unexpected behavior. Are you sure you want to create this branch?
SD_networks/module_functions_net.jl
Go to fileThis commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
96 lines (88 sloc)
3.26 KB
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
module MainNetworkGrowth | |
using LightGraphs, Distributions | |
export Network_grow | |
function Network_grow(delta::Float64, frac::Float64, fin_elem::Int64, in_comp::String, out_comp::String; lim_comp::String="nodes", start_cnt::Int64=2, nd_lim1::Int64=0, nd_lim2::Int64=1000000) | |
gr = Graph(start_cnt, Int(start_cnt*(start_cnt - 1)/2)) | |
neis = ones(Int64, start_cnt)*(start_cnt - 1) | |
last = start_cnt | |
T = 0 | |
if lim_comp == "nodes" | |
lim_val = last | |
elseif lim_comp == "comps" | |
lim_val = 1 | |
else lim_comp == "time" | |
lim_val = 0 | |
end | |
while (lim_val < fin_elem) | |
event, dt = Choose_event(gr, neis, delta, in_comp) | |
if event == 0 | |
last += 2 | |
add_vertices!(gr, 2) | |
add_edge!(gr, last-1, last) | |
append!(neis, [1, 1]) | |
else | |
last += 1 | |
add_vertices!(gr, 1) | |
gr, neis = Edges_inherit!(gr, neis, frac, event, last) | |
end | |
T += dt | |
if lim_comp == "nodes" | |
lim_val = last | |
elseif lim_comp == "comps" | |
lim_val = length(connected_components(gr)) | |
else lim_comp == "time" | |
lim_val = T | |
end | |
end | |
if out_comp == "cc_distr" | |
cc = connected_components(gr) | |
lens = sort(map(length, cc)) | |
return lens | |
elseif out_comp == "big_comp" | |
cc = connected_components(gr) | |
lens = map(length, cc) | |
return maximum(lens) | |
elseif out_comp == "node_deg" | |
cc = connected_components(gr) | |
lens = sort(map(length, cc)) | |
max_size = lens[end] | |
if nd_lim1 < max_size < nd_lim2 | |
nd = map(x -> length(neighbors(gr, x)), vertices(gr)) | |
else | |
nd = [1, 1] | |
end | |
return sort(nd) | |
elseif out_comp == "graph" | |
return gr, T | |
elseif out_comp == "com_nodes_edges" | |
cc = connected_components(gr) | |
nodes = map(length, cc) | |
edges = map(x -> sum([length(neighbors(gr, i)) for i in x])/2, cc) | |
nodes_m = sort(unique(nodes)) | |
edges_m = map(x -> mean(edges[nodes .== x]), sort(unique(nodes))) | |
return nodes_m, edges_m | |
end | |
end | |
function Choose_event(gr::LightGraphs.SimpleGraph, neis::Array{Int64, 1}, delta::Float64, in_comp::String) | |
if in_comp == "mod1" | |
rates = delta*ones(length(neis)) | |
elseif in_comp == "mod2" | |
rates = delta*neis | |
end | |
push!(rates, 1.0) | |
events = collect(vertices(gr)) | |
push!(events, 0) | |
event = wsample(events, rates) | |
dt = log(1/rand())/sum(rates) | |
return event, dt | |
end | |
function Edges_inherit!(gr::LightGraphs.SimpleGraph, neis::Array{Int64, 1}, frac::Float64, event::Int64, last::Int64) | |
edges = neighbors(gr, event) | |
inh_edges = filter(x -> rand() < frac, edges) | |
push!(inh_edges, event) | |
map(x -> add_edge!(gr, x, last), inh_edges) | |
map(x -> neis[x] += 1, inh_edges) | |
push!(neis, length(inh_edges)) | |
return gr, neis | |
end | |
end |