Sure thing-- here's the example I was describing. Again, assuming my
calculations in the previous message are correct (i.e. I'm understanding the
documentation correctly), I should expect, on average, about 5 or so edges
reaching from one block to the other block, with about 6-8 edges in the
total network connecting minority block members to each other (and 235-237
edges in the total network connecting majority block members to each other).
Instead, the minority block features a higher-than-expected connectivity,
and all of the members of the minority block appear central in the overall
network.
Thanks in advance for any help.
N = 100
P = .15
def blockMaker(v):
if v<N*P:
return 1
else:
return 0
def corr(a,b):
if a==b:
return 20
else:
return 1
g, sT = random_graph(N, lambda: poisson(5), directed=False,
model="blockmodel-traditional",
block_membership= blockMaker,
vertex_corr=corr,n_iter=100,persist=True)
graph_draw(g, vertex_fill_color=sT, edge_color="black", output="figure.pdf")
--
View this message in context:
http://main-discussion-list-for-the-graph-tool-project.982480.n3.nabble.com/random-graph-stochastic-block-model-produces-unreasonably-interconnected-blocks-tp4026797p4026799.html
Sent from the Main discussion list for the graph-tool project mailing list
archive at Nabble.com.
_______________________________________________
graph-tool mailing list
[email protected]
https://lists.skewed.de/mailman/listinfo/graph-tool
