1 paper
Bartlomiej Blaszczyszyn, Kumar Gaurav
We consider an edge-weighted uniform random graph with a given degree sequence (Repeated Configuration Model) which is a useful approximation for many real-world networks. It has b…