Discovering shared interests using graph analysis
Communications of the ACM - Special issue on internetworking
Self-similarity in World Wide Web traffic: evidence and possible causes
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Self-similarity in file systems
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Self-Similarity in I/O Workload: Analysis and Modeling
WWC '98 Proceedings of the Workload Characterization: Methodology and Case Studies
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Data Mining Meets Performance Evaluation: Fast Algorithms for Modeling Bursty Traffic
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Graphs over time: densification laws, shrinking diameters and possible explanations
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Graph mining: Laws, generators, and algorithms
ACM Computing Surveys (CSUR)
A network formation game for bipartite exchange economies
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Bounded budget connection (BBC) games or how to make friends and influence people, on a budget
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Weighted graphs and disconnected components: patterns and a generator
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Fast Counting of Triangles in Large Real Networks without Counting: Algorithms and Laws
ICDM '08 Proceedings of the 2008 Eighth IEEE International Conference on Data Mining
RTM: Laws and a Recursive Generator for Weighted Time-Evolving Graphs
ICDM '08 Proceedings of the 2008 Eighth IEEE International Conference on Data Mining
The web as a graph: measurements, models, and methods
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Random dot product graph models for social networks
WAW'07 Proceedings of the 5th international conference on Algorithms and models for the web-graph
Realistic, mathematically tractable graph generation and evolution, using kronecker multiplication
PKDD'05 Proceedings of the 9th European conference on Principles and Practice of Knowledge Discovery in Databases
Power laws for monkeys typing randomly: the case of unequal probabilities
IEEE Transactions on Information Theory
Analysis of large multi-modal social networks: patterns and a generator
ECML PKDD'10 Proceedings of the 2010 European conference on Machine learning and knowledge discovery in databases: Part I
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Towards trust inference from bipartite social networks
DBSocial '12 Proceedings of the 2nd ACM SIGMOD Workshop on Databases and Social Networks
On the bursty evolution of online social networks
Proceedings of the First ACM International Workshop on Hot Topics on Interdisciplinary Social Networks Research
Reachability analysis and modeling of dynamic event networks
ECML PKDD'12 Proceedings of the 2012 European conference on Machine Learning and Knowledge Discovery in Databases - Volume Part I
| Hi-index | 0.00 |
We propose a new, recursive model to generate realistic graphs, evolving over time. Our model has the following properties: it is (a) flexible, capable of generating the cross product of weighted/ unweighted, directed/undirected, uni/bipartite graphs; (b) realistic, giving graphs that obey eleven static and dynamic laws that real graphs follow (we formally prove that for several of the (power) laws and we estimate their exponents as a function of the model parameters); (c) parsimonious, requiring only four parameters. (d) fast, being linear on the number of edges; (e) simple, intuitively leading to the generation of macroscopic patterns. We empirically show that our model mimics two real-world graphs very well: Blognet (unipartite, undirected, unweighted) with 27K nodes and 125K edges; and Committee-to-Candidate campaign donations (bipartite, directed, weighted) with 23K nodes and 880K edges. We also show how to handle time so that edge/weight additions are bursty and self-similar.