A graph may be the Kronecker cover in more than one way. In this note we explore this phenomenon and apply it to show that the minimal common cover of two graphs need not be uniqu...
How can we generate realistic graphs? In addition, how can we do so with a mathematically tractable model that makes it feasible to analyze their properties rigorously? Real graphs...
Jure Leskovec, Deepayan Chakrabarti, Jon M. Kleinb...
Given a large, real graph, how can we generate a synthetic graph that matches its properties, i.e., it has similar degree distribution, similar (small) diameter, similar spectrum,...
How can we generate realistic networks? In addition, how can we do so with a mathematically tractable model that allows for rigorous analysis of network properties? Real networks ...
Jure Leskovec, Deepayan Chakrabarti, Jon M. Kleinb...