Supplementary Materials for

Community structure and scale-free collections of Erdos-Renyi graphs
by C. Seshadhri, Tamara G. Kolda, and Ali Pinar

----------------------------------------------------------------------
MATLAB Scripts
----------------------------------------------------------------------
To get help for each method, type "help <scriptname>" in MATLAB.


* preprocess_graph - Makes the graphs simple (undirected, unweighted, and no self-loops).
* degree_dist - Calculate degree distribution for an undirected graph.
* bter - Generate BTER model for a given degree distribution.
* compare_graphs - Compare the output of various graph models.
* example_script - Script to reproduce results in paper.

----------------------------------------------------------------------
Data
----------------------------------------------------------------------
All data is taken from SNAP. We have converted these files to MATLAB
data files (ending in .mat). The files are:

--------------------
ca-AstroPh
--------------------
SNAP web page: http://snap.stanford.edu/data/ca-AstroPh.html

Arxiv ASTRO-PH (Astro Physics) collaboration network is from the
e-print arXiv and covers scientific collaborations between authors
papers submitted to Astro Physics category. If an author i co-authored
a paper with author j, the graph contains a undirected edge from i to
j. If the paper is co-authored by k authors this generates a
completely connected (sub)graph on k nodes.

The data covers papers in the period from January 1993 to April 2003
(124 months). It begins within a few months of the inception of the
arXiv, and thus represents essentially the complete history of its
ASTRO-PH section.

Source citation: J. Leskovec, J. Kleinberg and C. Faloutsos. Graph
Evolution: Densification and Shrinking Diameters. ACM Transactions on
Knowledge Discovery from Data (ACM TKDD), 1(1), 2007.

--------------------
ca-ContMat
--------------------
SNAP web page: http://snap.stanford.edu/data/ca-CondMat.html

Arxiv COND-MAT (Condense Matter Physics) collaboration network is from
the e-print arXiv and covers scientific collaborations between authors
papers submitted to Condense Matter category. If an author i
co-authored a paper with author j, the graph contains a undirected
edge from i to j. If the paper is co-authored by k authors this
generates a completely connected (sub)graph on k nodes.

The data covers papers in the period from January 1993 to April 2003
(124 months). It begins within a few months of the inception of the
arXiv, and thus represents essentially the complete history of its
COND-MAT section.

Source citation: J. Leskovec, J. Kleinberg and C. Faloutsos. Graph
Evolution: Densification and Shrinking Diameters. ACM Transactions on
Knowledge Discovery from Data (ACM TKDD), 1(1), 2007.

--------------------
cit-HepPh
--------------------

SNAP web page: http://snap.stanford.edu/data/cit-HepPh.html
Arxiv HEP-PH (high energy physics phenomenology ) citation graph is
from the e-print arXiv and covers all the citations within a dataset
of 34,546 papers with 421,578 edges. If a paper i cites paper j, the
graph contains a directed edge from i to j. If a paper cites, or is
cited by, a paper outside the dataset, the graph does not contain any
information about this.

The data covers papers in the period from January 1993 to April 2003
(124 months). It begins within a few months of the inception of the
arXiv, and thus represents essentially the complete history of its
HEP-PH section.

The data was originally released as a part of 2003 KDD Cup. 

Source Citation: J. Gehrke, P. Ginsparg, J. M. Kleinberg. Overview of
the 2003 KDD Cup. SIGKDD Explorations 5(2): 149-151, 2003.

--------------------
soc-Epinions1
--------------------
SNAP web page: http://snap.stanford.edu/data/soc-Epinions1.html

This is a who-trust-whom online social network of a a general consumer
review site Epinions.com. Members of the site can decide whether to
''trust'' each other. All the trust relationships interact and form
the Web of Trust which is then combined with review ratings to
determine which reviews are shown to the user.

Source Citation: M. Richardson and R. Agrawal and P. Domingos. Trust
Management for the Semantic Web. ISWC, 2003.