-
Notifications
You must be signed in to change notification settings - Fork 0
/
graph_generation.jl
63 lines (51 loc) · 1.22 KB
/
graph_generation.jl
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
module graph_generation
using LightGraphs
using StatsBase
invLogit(x) = 1./(1.+e.^-x)
"""
given graph and probability, adds a node which must have >0
connections by flipping biased coin for each existing node
"""
function addNode(graph, p)
add_vertex!(graph)
x = nv(graph)
degree = 0
while degree ==0
flips = rand(x-1)
for i = 1:x-1
if p[i]>flips[i]
add_edge!(graph,i,x)
degree +=1
end
end
end
return graph
end
"""
given graph, b vector, and a_0, adds a new node as specified by the model
"""
function addPrefNode(g,b,a_0 = -7)
n = nv(g)
L::SparseMatrixCSC{Int64,Int64} = laplacian_matrix(g)
a::Array{Float64,1} = lufact(L) \ (b - mean(b))
a = a.-mean(a)
p::Array{Float64,1} = invLogit(a+a_0)
println(mean(p))
if (mean(p)) <1e-9
throw(DomainError)
end
addNode(g,p)
push!(b,0)
return g
end
"""
given graph and number of new edges desired, randomly adds edges between existing nodes
"""
function randEdgeGen(graph, newedges)
for i in 1:newedges
edges = sample(1:nv(graph), 2, replace = false)
add_edge!(graph,edges[1],edges[2])
end
return graph
end
end