Self-Organization of Weighted Networks in Connection with the Misanthrope Process

From an undirected random graph, by the weight redistribution of the edges, we obtain a weighted network. The weight redistribution of the edges can be connected to the well-known Misanthrope process, in which distinguishable particles hop among different urns. Under specific conditions, the condensation phenomena can be observed, i.e., nearly all the edges connect to one vertex in the network. When there is no condensation, by adjusting the parameters, the strength distribution can be scale-free or exponentially decreasing. The numerical results fit well with the analytical ones.