ref.bib

%
% References used in papers by Jérôme Kunegis.  These are references I
% use a lot, so they are put here, where they can be cited from any
% publication.
%
% References have names of the form b<N>, where <N> is a number.
%
% This file is incomplete.  It only contains references I have actually
% cited somewhere.  References I've never cited may only be listed in
% the file 'OLD', explaining the gaps in the numbers here. 
%

@inproceedings{b4,
	title = {Extracting Large-Scale Knowledge Bases from the {Web}},
	author = {Ravi Kumar and Prabhakar Raghavan and Srdhar
                  Rajagolapan and Andrew Tomkins},
	notes = {Finding complete unidirectional bipartite subgraphs of
                  the directed link graph of the web.  (Apply to the
                  user/document bipartite graph)},
	booktitle = {Proc. Int. Conf. on Very Large Data Bases},
	year = {1999},
	pages = {639--650},
}

@inproceedings{b6,
	title = {Smoothing of Recommenders' Ratings for Collaborative
                  Filtering},
	author = {Han-Shen Huang and Chun-Nan Hsu},
	booktitle = {Proc. Conf. on Artif. Intell. and Appl.},
	year = {2001},
}

@article{b7,
	author = {Ken Goldberg and Theresa Roeder and Dhruv Gupta and
                  Chris Perkins},
	title = {{Eigentaste}: A Constant Time Collaborative Filtering
                  Algorithm},
	journal = {Inf. Retrieval},
	volume = {4},
	number = {2},
	year = {2001},
	pages = {133--151},
}

@misc{b8,
	author = {Panagiotis Symeonidis Alexandros},
	title = {Nearest-biclusters Collaborative Filtering},
}

@inproceedings{b10,
	title = {An Algorithmic Framework for Performing Collaborative
                  Filtering},
	author = {Jonathan Herlocker and Joseph Konstan and Al Borchers
                  and John Riedl},
	booktitle = {Proc. Int. Conf. on Res. and Dev. in
                  Inf. Retrieval},
	year = {1999},
	pages = {230--237},
}

@article{b11,
	title = {Evaluating Collaborative Filtering Recommender
                  Systems},
	author = {Jonathan Herlocker and Joseph Konstan and Loren
                  Terveen and John Riedl},
	journal = {ACM Trans. Inf. Syst.},
	volume = {22},
	number = {1},
	year = {2004},
	pages = {5--53},
}

@inproceedings{b12,
 	author = {Charu C. Aggarwal and Joel L. Wolf and Kun-Lung Wu and
                  Philip S. Yu},
	title = {Horting Hatches an Egg: A New Graph-theoretic Approach
                  to Collaborative Filtering},
 	booktitle = {Proc. Int. Conf. on Knowl. Discov. and Data Min.},
	year = {1999},
	pages = {201--212},
}

@article{b13,
	title = {Studying Recommendation Algorithms by Graph Analysis},
	author = {Batul J. Mirza and Benjamin J. Keller and Naren
                  Ramakrishnan},
	year = {2001},
	journal = {Intell. Inf. Syst.},
	volume = {20},
	number = {2},
	pages = {131--160},
}

@inproceedings{b15,
	title = {The Application of New Concepts of Dissimilarities
                  between Nodes of a Graph to Collaborative Filtering},
	author = {François Fouss and Alain Pirotte and Marco Saerens},
	year = {2004},
	booktitle = {Proc. Workshop on Stat. Approaches for Web Min.},
	pages={26--37},
}

@article{b16,
	author = {Douglas J. Klein},
	title = {Resistance-Distance Sum Rules},
	journal = {Croatica Chemica Acta},
	volume = {75},
	number = {2},
	year = {2002},
	pages = {633--649},
}


@article{b18,
	title = {Theory of Resistor Networks: the Two-point Resistance},
	author = {F.~Y. Wu},
	journal = {J. Phys. A},
	volume = {37},
	pages = {6653--6673},
	year = {2004}
}

@book{b19,
	title = {Random Walks and Electric Networks},
	author = {Doyle, Peter G. and Snell, J. Laurie},
	year = {1984},
	publisher = {Math. Ass. of Am.},
	notes = { Includes algorithms to calculate equivalent
                  resistance: Monte-Carlo, Relaxation, Markov chains },
}

@inproceedings{b25,
	title = {Empirical Analysis of Predictive Algorithms for
                  Collaborative Filtering},
	author = {Breese, John S. and Heckerman, David and Kadie, Carl},
        booktitle= {Proc. Conf. on Uncertain. in Artif. Intell.},
        year = {1998},
	pages = {43--52},
	notes = {
		early comparative study of collaborative filtering
                  methods
	}
}

@inproceedings{b26,
	title = {Social Information Filtering: Algorithms for Automating
                  `Word of Mouth'},
	author = {Upendra Shardanand and Patti Maes},
	booktitle = {Proc. Conf. on Human Factors in Comput. Syst.},
	volume = {1},
	pages = {210--217},
	year = {1995},
}

@article{b27,
	author = {Jon Kleinberg},
	title = {Authoritative Sources in a Hyperlinked Environment},
	journal = {J. ACM},
	volume = {46},
	number = {5},
	year = {1999},
	pages = {604--632},
	notes = {
		The main HITS reference.
		Finding hubs and authorities in a directed graph from a
                  hyperlinked document structure.  Presented as
                  post-retrieval step.
	}
}

@inproceedings{b29,
	title = {A Joint Framework for Collaborative and Content
                  Filtering},
	author = {Justin Basilico and Thomas Hofmann},
	booktitle = {Proc. Int. Conf. on Res. and Dev. in
                  Inf. Retrieval},
	year = {2004},
	pages = {550--551}
}

@inproceedings{b30,
	title = {Unifying Collaborative and Content-based Filtering},
	author = {Justin Basilico and Thomas Hofmann},
	booktitle = {Proc. Int. Conf. on Mach. Learn.},
	year = {2004},
}

@inproceedings{b31,
	title = {Collaborative Filtering via {Gaussian} Probabilistic
                  Latent Semantic Analysis},
	author = {Thomas Hofmann},
	booktitle = {Proc. Int. Conf. on Res. and Dev. in
                  Inf. Retrieval},
	year = {2003},
	pages = {259--266},
}

@article{b33,
	title = {Item-based Top-{N} Recommendation Algorithms},
	author = {Mukund Deshpande and George Karypis},
	journal = {ACM Trans. Inf. Syst.},
	volume = {22},
	number = {1},
	year = {2004},
	pages = {143--177},
	notes = {About recommendation datasets (ie. values are only 0
                  and 1)},
}

@article{b34,
	title = {Latent Semantic Models for Collaborative Filtering},
	author = {Thomas Hofmann},
	journal = {ACM Trans. Inf. Syst.},
	volume = {22},
	number = {1},
	year = {2004},
	pages = {89--115},
}

@inproceedings{b36,
	title = {Information Retrieval based on Collaborative Filtering
                  with Latent Interest Semantic Map},
	author = {Noriaki Kawamae and Katsumi Takahashi},
	booktitle = {Proc. Int. Conf. on Knowl. Discov. and Data Min.},
	year = {2005},
	pages = {618--623},
}

@inproceedings{b37,
	title = {Recommendation Algorithm Combining the User-based
                  Classified Regression and the Item-based Filtering},
	author = {Yu Chuan and Xu Jieping and Du Xiaoyong},
	booktitle = {Proc. Int. Conf. on Electronic Commerce},
	year = {2006},
	pages = {574--578},
}

@inproceedings{b41,
	title = {Document Retrieval and Clustering: From Principal
                  Component Analysis to Self-aggregation Networks},
	author = {Chris H. Q. Ding},
	booktitle = {Proc. Int. Workshop on Artif. Intell. and Stat.},
	year = {2003},
}

@inproceedings{b42,
	title = {Explaining Collaborative Filtering Recommendations},
	author = {Jonathan Herlocker and Joseph Konstan and John Riedl},
	booktitle = {Comput. Supported Cooperative Work},
	pages = {241--250},
	year = {2000},
}

@inproceedings{b43,
	author = {M. Connor and Jonathan Herlocker},
	title = {Clustering Items for Collaborative Filtering},
	year = {2001},
	booktitle = {Proc. SIGIR Workshop on Recomm. Syst.},
}

@inproceedings{b44,
	author = {Matthew R. McLaughlin and Jonathan Herlocker},
	title = {A Collaborative Filtering Algorithm and Evaluation
                  Metric That Accurately Model the User Experience},
	booktitle = {Proc. Int. Conf. on Res. and Dev. in
                  Inf. Retrieval},
	year = {2004},
	pages = {329--336},
}


@article{b54,
	title = {Probabilistic Memory-Based Collaborative Filtering},
	author = {Kai Yu and Anton Schwaighofer and Volker Tresp and
                  Xiaowei Xu and Hans-Peter Kriegel},
	journal = {Trans. on Knowl. and Data Engineering},
	volume = {16},
	number = {1},
	year = {2004},
	pages = {56--69},
}

@inproceedings{b55,
	author = {Rong Jin and Luo Si and ChengXiang Zhai and Jamie
                  Callan},
	title = {Collaborative Filtering with Decoupled Models for
                  Preferences and Ratings},
	booktitle = {Proc. Int. Conf. on Inf. and Knowl. Manag.},
	year = {2003},
	pages = {309--316},
}

@inproceedings{b56,
	author = {Michael P. O'Mahony and Neil J. Hurley and Guenole
                  C. M. Silvestre},
	title = {Utility-based neighbourhood formation for efficient and
                  robust collaborative filtering},
	booktitle = {Proc. Conf. on Electronic Commerce},
	year = {2004},
	pages = {260--261},
}

@article{b59,
	title = {Statistical Mechanics of Complex Networks},
	author = {Réka Albert and Albert-Laszló Barabási},
	journal = {Rev. of Mod. Phys.},
	number = {1},
	pages = {47--97},
	volume = {74},
	year = {2002},
	notes = {
		#: Random graph models.
		#: Examples of the power law exponent γ
	},
}

@inproceedings{b67,
	author = {Ravi Kumar and Uma Mahadevan and D. Sivakumar},
	title = {A Graph-theoretic Approach to Extract Storylines from
                  Search Results},
	booktitle = {Proc. Int. Conf. on Knowl. Discov. and Data Min.},
	year = {2004},
	pages = {216--225},
}

@inproceedings{b68,
	title = {A Graph-based Recommender System for Digital Library},
	author = {Huang, Zan and Chung, Wingyan and Ong, Thian-Huat and
                  Chen, Hsinchun },
	booktitle = {Proc. Int. Conf. on Digital Libraries},
	pages = {65--73},
	priority = {3},
	year = {2002}
}

@inproceedings{b70,
	author = {Bin Gao and Tie-Yan Liu and Xin Zheng and Qian-Sheng
                  Cheng and Wei-Ying Ma},
	title = {Consistent Bipartite Graph Co-partitioning for
                  Star-structured High-order Heterogeneous Data
                  Co-clustering},
	booktitle = {Proc. Int. Conf. on Knowl. Discov. and Data Min.},
	year = {2005},
	pages = {41--50},
}

@inproceedings{b73,
	author = {L. Ungar and D. Foster},
	title = {A formal statistical approach to collaborative
                  filtering},
	year = {1998},
	booktitle= {Proc. Conf. on Automated Learn. and Discov.},
}

@inproceedings{b75,
	author = {D. Nichols},
	title = {Implicit Rating and Filtering},
	pages = {31--36},
	booktitle = {Proc. DELOS Workshop on Filtering and Collaborative
                  Filtering},
	year = {1998}
}

@inproceedings{b77,
    author = {David Pennock and Eric Horvitz and Steve Lawrence and
                  C. Lee Giles},
    title = {Collaborative Filtering by Personality Diagnosis: A Hybrid
                  Memory- and Model-based Approach},
    booktitle = {Proc. Conf. on Uncertain. in Artif. Intell.},
    pages = {473--480},
    year = {2000},
}

@inproceedings{b78,
	author = {Gui-Rong Xue and Chenxi Lin and Qiang Yang and WenSi
                  Xi and Hua-Jun Zeng and Yong Yu and Zheng Chen},
	title = {Scalable Collaborative Filtering using Cluster-based
                  Smoothing},
	booktitle = {Proc. Int. Conf. on Res. and Dev. in
                  Inf. Retrieval},
	year = {2005},
	pages = {114--121},
}

@article{b79,
	title = {Solving Cluster Ensemble Problems by Bipartite Graph
                  Partitioning},
	author = {Xiaoli Zhang Fern and Carla E. Brodley},
}

@article{b80,
	title = {Bipartite Graphs as Models of Complex Networks},
	author = {Jean-Loup Guillaume and Matthieu Latapy},
	notes = {
		#: A random graph model for unipartite graphs, which
                  modesl them as the projection of a random bipartite
                  graphs, in which both types of nodes have their own
                  degree distribution.  The projection ensures that the
                  resulting graph has high clustering coefficient
                  values.  No closed-form expressions are given.
	},
}

@inproceedings{b82,
	author = {Paul Resnick and N. Iacovou and M. Suchak and
                  P. Bergstorm and John Riedl},
	title = {{GroupLens}: An Open Architecture for Collaborative
                  Filtering of {NetNews}},
	booktitle = {Proc. Conf. on Comput. Supported Cooperative Work},
	pages = {175--186},
	year = {1994},
}

@article{b83,
	author = {David Goldberg and David Nichols and Brian M. Oki and
                  Douglas Terry},
	title = {Using collaborative filtering to weave an information
                  tapestry},
	journal = {Commun. ACM},
	volume = {35},
	number = {12},
	year = {1992},
	pages = {61--70},
}

@book{b89,
	title = {{Markov} Random Fields: Theory and Application},
	author = {Rama Chellappa and Anil Jain},
	year = {1993},
	publisher = {Academic Press},
}

@book{b95,
	title = {Probabilistic Reasoning in Intelligent Systems:
                  Networks of Plausible Inference},
	author = {Judea Pearl},
	year = {1988},
	isbn = {0-934613-73-7},
	publisher = {Morgan Kaufmann Publishers Inc.},
}

@book{b96,
	author = {Yurii A. Rozanov},
	title = {Markov Random Fields},
	year = {1983},
	publisher = {Springer},
}

@article{b97,
	author = {Xiao, Wenjun and Gutman, Ivan },
	journal = {Theoretica Chimica Acta},
	number = {4},
	pages = {284--289},
	title = {Resistance Distance and {Laplacian} Spectrum},
	volume = {110},
	year = {2003}
}

@article{b101,
	author = {Douglas J. Klein and Milan Randić},
	title = {Resistance Distance},
	journal = {J. Math. Chem.},
	volume = {12},
	number = {1},
	year = {1993},
	pages = {81--95},
}

@article{b105,
	title = {Random-walk Computation of Similarities between Nodes of
                  a Graph with Application to Collaborative
                  Recommendation},
	author = {François Fouss and Alain Pirotte and Jean-Michel Renders
                  and Marco Saerens},
	journal = {Trans. on Knowl. and Data Engineering},
	volume = {19},
	number = {3},
	year = {2007},
	pages = {355--369},
}

@inproceedings{b107,
	title = {A Novel Way of Computing Similarities between Nodes of
                  a Graph, with Application to Collaborative
                  Recommendation},
	author = {François Fouss and Alain Pirotte and Marco Saerens},
	booktitle = {Proc. Int. Conf. on Web Intell.},
	year = {2005},
	pages = {550--556},
}

@inproceedings{b112,
	title = {Distance-Free Image Retrieval Based on Stochastic
                  Diffusion over Bipartite Graphs},
	author = {Christian Bauckhage},
	booktitle = {Br. Mach. Vision Conf.},
	year = {2007},
	pages = {1--10},
}

@inproceedings{b113,
	title = {Why Does Collaborative Filtering Work? --
                  Recommendation Model Validation and Selection by
                  Analyzing Bipartite Random Graphs},
	author = {Zan Huang and Daniel D. Zeng},
	booktitle = {Proc. Workshop of Inf. Technol. and Syst.},
	year = {2005},
}

@article{b114,
	author = {Zan Huang and Hsinchun Chen and Daniel Zeng},
	title = {Applying Associative Retrieval Techniques to Alleviate
                  the Sparsity Problem in Collaborative Filtering},
	journal = {ACM Trans. Inf. Syst.},
	volume = {22},
	number = {1},
	year = {2004},
	pages = {116--142},
}

@book{b116,
	title = {Modern Graph Theory},
	author = {Béla Bollobás},
	year = {1998},
	publisher = {Springer},
	_notes = {
		Has several chapters about resistance graphs,
                  resistance distance and the Laplacian matrix.
	},
}

@book{b117,
	title = {Eigenspaces of Graphs},
	author = {Dragoš Cvetković and Peter Rowlinson and Slobodan
                  Simić},
	year = {1997},
	publisher = {Cambridge Univ. Press},
}

@book{b118,
	author = {Chris D. Godsil and Gordon Royle},
	title = {Algebraic Graph Theory},
	year = {2001},
	publisher = {Springer},
}

@inproceedings{b129,
	author = {Ken Lang},
	title = {{NewsWeeder}: Learning to Filter {Netnews}},
	booktitle = {Proc. Int. Conf. on Mach. Learn.},
	year = {1995},
}

@techreport{b120,
	author = {Y. Zhao and G. Karypis},
	title = {Criterion Functions for Document Clustering:
                  Experiments and Analysis},
	year = {2001},
	institution = {Department of Comput. Science, Univ. of Minnesota, Minneapolis, MN},
	number = {01--40},
}

@inproceedings{b121,
	author = {M. Steinbach and G. Karypis and V. Kumar},
	title = {A Comparison of Document Clustering Techniques},
	year = {2000},
	booktitle= {Proc. KDD Workshop on Text Min.},
}

@inproceedings{b132,
	title = {Item-based Collaborative Filtering Recommendation
                  Algorithms},
	author = {Badrul M. Sarwar and George Karypis and Joseph
                  A. Konstan and John Riedl},
	booktitle = {Proc. Int. World Wide Web Conf.},
	year = {2001},
	pages = {285--295},
}

@article{b133,
	author = {Sergey Brin and Lawrence Page},
	title = {The Anatomy of a Large-scale Hypertextual {Web} Search
                  Engine},
	journal = {Comput. Netw. and ISDN Syst.},
	volume = {30},
	number = {1--7},
	pages = {107--117},
	year = {1998},
	notes = {
		#: The primary reference for PageRank.
	}
}

@book{b135,
	author = {Golub, Gene H. and Van Loan, Charles F.},
	publisher = {The Johns Hopkins Univ. Press},
	title = {Matrix Computations},
	year = {1996},
}

@article{b136,
	title = {Nineteen Dubious Ways to Compute the Exponential of a
                  Matrix, Twenty-five Years Later},
	author = {Cleve Moler and Van Loan, Charles},
	journal = {SIAM Rev.},
	volume = {45},
	number = {1},
	year = {2003},
	pages = {1--46},
}

@inproceedings{b137,
	title = {Application of Kernels to Link Analysis},
	author = {Takahiko Ito and Masashi Shimbo and Taku Kudo and Yuji
                  Matsumoto},
	booktitle = {Proc. Int. Conf. on Knowl. Discov. in Data Min.},
	year = {2005},
	pages = {586--592},
	notes = {Mentions the matrix exponential in connection with
                  kernels.
		Laplacian kernel, regularized Laplacian kernel.},
}

@book{b138,
	title = {Pattern Recognition and Machine Learning},
	author = {Christopher M. Bishop},
	year = {2006},
	publisher={Springer},
}

@inproceedings{b139,
	title = {Semi-supervised Learning using Randomized Mincuts}, 
	author = {Avrim Blum and John Lafferty and Mugizi Robert Rwebangira},
	booktitle = {Proc. Int. Conf. on Mach. Learn.},
	year = {2004},
	pages = {13--20},
	notes_ = {Classification by making a MRF model out of nearest-neighbor},
}

@article{b140,
	title = {A Comparison of Collaborative-Filtering Recommendation
                  Algorithms for e-commerce},
	author = {Zan Huang and Daniel Zeng and Hsinchun Chen},
	journal = {IEEE Intell. Syst.},
	volume = {22},
	number = {5},
	year = {2007},
	pages = {68-78},
}

@article{b142,
	title = {A Graph Model for e-commerce Recommender Systems},
	author = {Zan Huang and Wingyan Chung and Hsinchun Chen},
	journal = {Am. Soc. for Inf. Sci. and Technol.},
	volume = {55},
	number = {3},
	year = {2004},
	pages = {259--274},
}

@inproceedings{b144,
	author = {Zan Huang and Xin Li and Hsinchun Chen},
	title = {Link Prediction Approach to Collaborative Filtering},
	booktitle = {Proc. Jt. Conf. on Digital Libraries},
	year = {2005},
	pages = {141--142},
	notes = {Reviews some graph-based distance/similarity measures.
		Graph is unweighted bipartite.
		Mentions: graph distance and "Katz-beta"
	},
}

@article{b145,
	author={Leo Katz},
	title={A New Status Index Derived from Sociometric Analysis},
	journal = {Psychometrika},
	year={1953},
	volume={18},
	number={1},
	pages={39-43},
}

@inproceedings{b147,
	title = {Enriched Categories and the {Floyd}--{Warshall} Connection},
	author = {Vaughan Pratt},
	booktitle = {Proc. Int. Conf. on Algebraic Methodol. and Software Technol.},
	year = {1989},
	pages = {177--180},
}

@inproceedings{b148,
	author = {Marina Meilă and Jianbo Shi},
	title = {A Random Walks View of Spectral Segmentation},
	booktitle = {Proc. Int. Conf. on Artif. Intell. and Stat.},
	year = {2001},
}

@inproceedings{b150,
	author = {Joel C. Miller and Gregory Rae and Fred Schaefer and
                  Lesley A. Ward and Thomas LoFaro and Ayman Farahat},
	title = {Modifications of {Kleinberg's} {HITS} Algorithm using
                  Matrix Exponentiation and {Web} Log Records},
	booktitle = {Proc. Int. Conf. on Res. and Dev. in
                  Inf. Retrieval},
	year = {2001},
	pages = {444--445},
}

@inproceedings{b152,
	title = {An Experimental Investigation of Graph Kernels on a
                  Collaborative Recommendation Task},
	author = {François Fouss and Luh Yen and Alain Pirotte and Marco
                  Saerens},
	booktitle = {Proc. Int. Conf. on Data Min.},
	year = {2006},
	pages = {863--868},
}

@inproceedings{b153,
	author = {M. Saerens and François Fouss and L. Yen and
                  P. Dupont},
	title = {The Principal Component Analysis of a Graph and Its
                  Relationships to Spectral Clustering},
	year = {2004},
	booktitle = {Proc. Eur. Conf. on Mach. Learn.},
}

@techreport{b154,
	title = {A Novel Way of Computing Similarities between Nodes of
                  a Graph, with Application to Collaborative Filtering
                  and Subspace Projection of the Graph Nodes},
	author = {François Fouss and Alain Pirotte and Jean-Michel
                  Renders and Marco Saerens},
	year = {2006},
	institution = {Univ. Cath. de Louvain},
}

@inproceedings{b155,
	author = {Alex Smola and Risi Kondor},
	title = {Kernels and Regularization on Graphs},
	booktitle = {Proc. Conf. on Learn. Theory and Kernel Mach.},
	year = {2003},
	pages = {144--158},
}

@inproceedings{b156,
	title = {Diffusion Kernels on Graphs and Other Discrete
                  Structures},
	author = {Risi Kondor and John Lafferty},
	booktitle = {Proc. Int. Conf. on Mach. Learn.},
	year = {2002},
	pages = {315--322},
}

@techreport{b157,
	author = {V. Hernández and J. E. Román and A. Tomás and
                  V. Vidal},
	title = {A Survey of Software for Sparse Eigenvalue Problems},
	number = {STR-6},
	institution = {Univ. Politécnica de Valencia},
	year = {2006},
}



@article{b160,
	author = {Kalervo Järvelin and Jaana Kekäläinen},
	title = {Cumulated Gain-based Evaluation of {IR} Techniques},
	journal = {ACM Trans. Inf. Syst.},
	volume = {20},
	number = {4},
	year = {2002},
	pages = {422--446},
}

@inproceedings{b161,
	title = {Modeling Relationships at Multiple Scales to Improve
                  Accuracy of Large Recommender Systems},
	author = {Robert Bell and Yehuda Koren and Chris Volinsky},
	booktitle = {Proc. Int. Conf. on Knowl. Discov. and Data Min.},
	pages = {95--104},
	year = {2007},
}

@misc{b163,
	title = {{ClustKNN}: A Highly Scalable Hybrid Model- and
                  Memory-Based {CF} Algorithm},
	author = {Al Mamunur Rashid and Shyong K. Lam and George Karypis
                  and John Riedl},
}

@inproceedings{b165,
	title = {Incremental {SVD}-Based Algorithms for Highly Scalable
                  Recommender Systems},
	author = {Badrul Sarwar and Karypis, George and Joseph Konstan and
                  John Riedl},
	booktitle = {Proc. Int. Conf. on Comput. and Inf. Technol.},
	year = 2002},
	pages= {399--404},
}

@inproceedings{b166,
    title = {Application of Dimensionality Reduction in Recommender
                  Systems--A Case Study},
    author = {Badrul Sarwar and George Karypis and Joseph Konstan and
                  John Riedl},
    booktitle = {Proc. ACM {WebKDD} Workshop},
    year = {2000}
}

@inproceedings{b167,
	title = {Estimation of Rank Deficient Matrices from Partial
                  Observations: Two-step Iterative Algorithms},
	author = {Rui Guerreiro and Pedro Aguiar},
	booktitle = {Proc. Int. Conf. on Energy Minimization Methods in
                  Comput. Vision and Pattern Recognit.},
	year = {2003},
	pages = {450--466},
}

@inproceedings{b178,
	title = {Weighted Low-rank Approximations},
	author = {Nathan Srebro and Tommi Jaakkola},
	booktitle = {Proc. Int. Conf. on Mach. Learn.},
	year = {2003},
	pages = {720--727},
	notes = {Weighted low-rank approximation of sparse matrices used
                  for collaborative filtering.  More or less the
                  standard reference for the mask approximation.
	},
}

@inproceedings{b179,
	title = {Using Singular Value Decomposition Approximation for
                  Collaborative Filtering},
	author = {Sheng Zhang and Weihong Wang and James Ford and Fillia
                  Makedon and Justin Pearlman},
	booktitle = {Proc. Int. Conf. on E-Commerce Technol.},
	year = {2005},
	pages = {257--264},
}

@article{b190,
	title = {The Matrix-Forest Theorem and Measuring Relations in
                  Small Social Groups},
	author = {Pavel Chebotarev and Elena Shamis},
	journal = {Automation and Remote Control},
	volume = {58},
	number = {9},
	pages = {1505--1514},
	year = {1997},
}

@article{b191,
	title={On Proximity Measures for Graph Vertices},
	author={Pavel Chebotarev and Elena Shamis},
	year={1998},
	number = {10},
	journal = {Automation and Remote Control},
	pages={1443--1459},
	volume = {59}
}

@article{b192,
	title = {A Measure of Betweenness Centrality Based on Random
                  Walks},
	author = {M. E. J. Newman},
	journal = {Soc. Netw.},
	number = {1},
	pages = {39--54},
	volume = {27},
	year = {2005},
}

@inproceedings{b193,
	title = {Directed {Laplacian} Kernels for Link Analysis},
	author = {Pawel Majewski},
	booktitle = {Proc. Int. Conf. on Intell. Data Engineering and Automated Learn.},
	year = {2006},
	pages = {314--321},
}

@inproceedings{b197,
	title = {Maximum-Margin Matrix Factorization},
	author = {Nathan Srebro and Jason D. M. Rennie and Tommi
                  S. Jaakola},
	booktitle = {Advances in Neural Inf. Process. Syst.},
	year = {2005},
	pages = {1329--1336},
}

@inproceedings{b199,
	title = {Improved Neighborhood-based Collaborative Filtering},
	author = {Robert Bell and Yehuda Koren},
	booktitle = {Proc. KDDCup},
	year = {2007},
	pages = {7--14},
}

@article{b201,
	title = {Toward the Next Generation of Recommender Systems: A
                  Survey of the State-of-the-art and Possible
                  Extensions},
	author = {Gediminas Adomavicius and Alexander Tuzhilin},
	journal = {Trans. on Knowl. and Data Engineering},
	year = {2005},
	volume = {17},
	pages = {734--749},
}

@inproceedings{b202,
	title = {Collaborative Filtering with Multi-component Rating for
                  Recommender Systems},
	author = {Nachiketa Sahoo and Ramayya Krishnan and George Duncan
                  and James Callan},
	booktitle = {Proc. Workshop on Inf. Technol. and Syst.},
	year = {2006},
}

@inproceedings{b213,
	title = {Fast Direction-aware Proximity for Graph Mining},
	author = {Hanghang Tong and Christos Faloutsos and Yehuda Koren},
	booktitle = {Proc. Int. Conf. on Knowl. Discov. and Data Min.},
	year = {2007},
	pages = {747--756},
 }
	
@inproceedings{b216,
	_address = {New York, NY, USA},
	author = {Lampe, Cliff and Johnston, Erik },
	booktitle = {Proc. Int. Conf. on Supporting Group Work},
	doi = {10.1145/1099203.1099206},
	isbn = {1595932232},
	pages = {11--20},
	priority = {3},
	_publisher = {ACM Press},
	title = {Follow the ({S}lash) dot: Effects of Feedback on New
                  Members in an Online Community},
	year = {2005}
}

@inproceedings{b222,
	title = {Co-ranking Authors and Documents in a Heterogeneous
                  Network},
	author = {Ding Zhou and Orshanskiy, S.A.  and Hongyuan Zha and
                  Giles, C.L.  },
	booktitle = {Proc. Int. Conf. on Data Min.},
	year = {2007},
	pages = {739--744},
}

@inproceedings{b223,
	title = {Fast Random Walk with Restart and Its Applications},
	author = {Hanghang Tong and Christos Faloutsos and Jia-Yu Pan},
	booktitle = {Proc. Int. Conf. on Data Min.},
	year = {2006},
	pages = {613--622},
}

@inproceedings{b224,
	title = {Collaborative Machine Learning},
	author = {Thomas Hofmann and Justin Basilico},
	booktitle = {From Integrated Publication and Information Systems
                  to Virtual Information and Knowl. Environments},
	pages = {173--182},
	series = {Lecture Notes in Comput. Sci.},
	volume = {3379},
	year = {2005},
}

@inproceedings{b225,
	author={Ulrik Brandes and Daniel Fleischer},
	title={Centrality Measures Based on Current Flow},
	year={2005},
	pages={533--544},
	booktitle = {Proc. Symp. on Theoretical Aspects of Comput. Sci.}
}

@article{b228,
	title = {Collective Dynamics of `Small-world' Networks},
	author = {Watts, Duncan J. and Strogatz, Steven H.},
	journal = {Nature},
	volume = {393},
	number = {1},
	pages = {440--442},
	year = {1998},
	notes = {
		large clustering coefficient, small diameter.
	},
}

@article{b233,
	title = {Community Mining from Signed Social Networks},
	author = {Bo Yang and William Cheung and Jiming Liu},
	journal = {Trans. on Knowl. and Data Engineering},
	volume = {19},
	number = {10},
	year = {2007},
	pages = {1333--1348},
}


@inproceedings{b234,
	title = {Linear Iterations on Ordered Semirings for Trust
                 Metric Computation and Attack Resiliency
                 Evaluation},
	author = {Theodorakopoulos, George and Baras, John S.},
	booktitle = {Proc. Int. Symp. on Math. Theory of Netw. and Syst.},
	pages = {509--514},
	year = {2006},
}

@inproceedings{b235,
	title = {The {PageTrust} Algorithm: How to Rank {Web} Pages when
                  Negative Links are Allowed?},
	author = {Cristobald De Kerchove and Paul Van Dooren},
	booktitle = {Proc. SIAM Int. Conf. on Data Min.},
	pages = {346--352},
	year = {2008},
	notes = {
		#: a kind of signed PageRank.
		#: mentions a "local trust metric" that can be interpreted as a signed
                  stochastic process.
	},
}

@inproceedings{b236,
	author = {Sepandar D. Kamvar and Mario T. Schlosser and Hector
                  Garcia-Molina},
	title = {The {EigenTrust} Algorithm for Reputation Management in
                  {P2P} Networks},
	booktitle = {Proc. Int. World Wide Web Conf.},
	year = {2003},
	pages = {640--651},
	notes = { signed variant of PageRank. },
}


@inproceedings{b237,
	title={{Page-reRank}: Using Trusted Links to Re-rank Authority},
	author = {Massa, Paolo and Hayes, Conor},
	booktitle = {Proc. Int. Conf. on Web Intell.},
	year = {2005},
	pages = {614--617},
}

@article{b239,
	title={Co-authorship, Rational {Erdős} Numbers, and Resistance
                  Distances in Graphs},
	author={Balaban, Alexandru T. and Klein, Douglas J.},
	journal={Scientometrics},
	year={2002},
	volume={55},
	pages={59--70},
	number={1}
}

@article{b242,
	title = {Graph Evolution: Densification and Shrinking
                  Diameters},
	author = {Jure Leskovec and Jon Kleinberg and Christos
                  Faloutsos},
	journal = {ACM Trans. Knowl. Discov. from Data},
	year = {2007},
	volume = {1},
	number = {1},
	pages = {1--40},
	notes = {
		* temporal graph model where the average degree
                  increases with time and the mean distance descreases
                  with time.
		* the total node count (u) and edge count follow a power
                  law: u ∼ e^α, where α is independent of time.  1 ≤ α ≤
                  2.  α = 1 corresponds to the case of constant node
                  degree, and α = 2 to an almost full graph.
	},
}

@inproceedings{b244,
	title = {Distance-function Design and Fusion for Sequence Data},
	author = {Yi Wu and Edward Y. Chang},
	booktitle = {Proc. Int. Conf. on Inf. and Knowl. Manag.},
	year = {2004},
	pages = {324--333},
}

@inproceedings{b246,
	author = {Inderjit S. Dhillon and Yuqiang Guan and Brian Kulis},
	title = {Kernel $k$-Means: Spectral Clustering and Normalized
                  Cuts},
	booktitle = {Proc. Int. Conf. Knowl. Discov. and Data Min.},
	year = {2004},
	pages = {551--556}
}

@inproceedings{b247,
	author = {Sun, J.  and Zeng, H.  and Liu, H.  and Lu, Y.  and
                  Chen, Z. },
	title = {Cube{SVD}: A Novel Approach to Personalized {Web}
                  Search},
	year = {2005},
	booktitle = {Proc. Int. World Wide Web Conf.},
	pages = {382--390},
}


@article{b249,
	title = {The Forest Metric for Graph Vertices},
	author = {Pavel Chebotarev and Elena Shamis},
	journal = {Electronic Notes in Discrete Math.},
	volume = {11},
	year = {2002},
	pages = {98--107},
}

@article{b253,
	title = {On the Spectra of Nonsymmetric {Laplacian} Matrices},
	author = {Rafig Agaev and Pavel Chebotarev},
	year = {2005},
	journal = {Linear Algebra and Its Appl.},
	volume = {399},
	pages = {157--168},
}

@inproceedings{b256,
	title = {The Link Prediction Problem for Social Networks},
	author = {David Liben-Nowell and Jon Kleinberg},
	booktitle = {Proc. Int. Conf. on Inf. and Knowl. Manag.},
	year = {2003},
	pages = {556--559},
}

@article{b257,
	author = {Robert Bell and Yehuda Koren},
	title = {Lessons from the {Netflix} {Prize} Challenge},
	journal = {SIGKDD Explorations},
	volume = {9},
	number = {2},
	year = {2007},
	pages = {75--79},
}

@inproceedings{b260,
	title = {Friends and Foes: Ideological Social Networking},
	author = {Michael Brzozowski and Tad Hogg and Gabor Szabo},
	booktitle = {Proc. Conf. on Human Factors in Comput. Syst.},
	year = {2008},
	pages = {817--820},
	notes = {
		#: Uses data from Essembly.com
		#: Identifies three types of relationships: friends,
                  allies and foes.  friends differ from allies: allies
                  have the same opinion, and friends are just people you
                  know.
	},
}

@inproceedings{b262,
	author = {Scott White and Padhraic Smyth},
	title = {Algorithms for Estimating Relative Importance in Networks},
	booktitle = {Proc. Int. Conf. on Knowl. Discov. and Data Min.},
	year = {2003},
	pages = {266--275},
 }

@inproceedings{b263,
	title = {Learning Semantic Similarity},
	author = {Jaz Kandola and John Shawe-Taylor and Nello
                  Cristianini},
	booktitle = {Advances in Neural Inf. Process. Syst.},
	year = {2002},
	pages = {657--664},
}

@article{b264,
	title = {{Laplacians} and the {Cheeger} Inequality for Directed Graphs},
	author = {Fan Chung},
	journal = {Ann. of Comb.},
	year = {2005},
	volume = {9},
	number = {1},
	pages = {1--19},
}

@book{b268,
        title = {Social Network Analysis: A Handbook},
	author = {Scott, John},
	publisher = {SAGE},
	year = {2000}
}

@article{b269,
	title = {A Clustering Coefficient for Weighted Networks, with
                  Application to Gene Expression Data},
	author = {Gabriela Kalna and Desmond J. Higham},
	journal = {AI Commun.},
	volume = {20},
	number = {4},
	year = {2007},
	issn = {0921-7126},
	pages = {263--271},
	_publisher = {IOS Press},
	_address = {Amsterdam, The Netherlands, The Netherlands},
}

@inproceedings{b270,
	title = {Multiple Relationship Types in Online Communities and
                  Social Networks},
	author = {Tad Hogg and Dennis M. Wilkinson and Gabor Szabo and
                  Michael J. Brzozowski},
	booktitle = {Proc. AAAI Spring Symp. on Soc. Inf. Process.},
	year = {2008},
}

@techreport{b271,
	author = {Page, Lawrence and Brin, Sergey and Motwani, Rajeev
                  and Winograd, Terry },
	title = {The {PageRank} Citation Ranking: Bringing Order to the
                  {Web}},
	year = {1998},
	institution = {Stanford Digital Library Technol. Project}
}

@inproceedings{b272,
	author = {Marc A. Najork and Hugo Zaragoza and Michael
                  J. Taylor},
	title = {Hits on the {Web}: How does it Compare?},
	booktitle = {Proc. Int. Conf. on Res. and Dev. in
                  Inf. Retrieval},
	year = {2007},
	pages = {471--478},
}

@inproceedings{b273,
	author = {Lin Xiao and Jun Sun and Stephen Boyd},
	title = {A Duality View of Spectral Methods for Dimensionality
                  Reduction},
	booktitle = {Proc. Int. Conf. on Mach. Learn.},
	year = {2006},
	pages = {1041--1048},
}

@article{b280,
	title = {An r-Dimensional Quadratic Placement Algorithm},
	author = {Kenneth M. Hall},
	journal = {Manag. Sci.},
	volume = {17},
	year = {1970},
	pages = {219--229},
	number = {3},
}

@inproceedings{b283,
	author = {Sameer Agarwal and Kristin Branson and Serge
                  Belongie},
	title = {Higher Order Learning with Graphs},
	booktitle = {Proc. Int. Conf. on Mach. Learn.},
	year = {2006},
	pages = {17--24}
}

@article{b284,
	title = {A Partitioning Approach to Structural Balance},
	author = {Patrick Doreian and Andrej Mrvar},
	journal = {Soc. Netw.},
	volume = {18},
	year = {1996},
	pages = {149--168},
}

@book{b285,
	author = {Fan Chung},
	title = {Spectral Graph Theory},
	year = {1997},
	publisher = {Am. Math. Soc.}
}

@inproceedings{b287,
	author = {Mikhail Belkin and Partha Niyogi},
	title = {{Laplacian} Eigenmaps and Spectral Techniques for
                  Embedding and Clustering},
	booktitle = {Advances in Neural Inf. Process. Syst.},
	year = {2002},
	pages = {585--591},
}

@techreport{b289,
	title = {A Short Tour of Kernel Methods for Graphs},
	author = {Thomas Gärtner and Quoc V. Le and Alex Smola},
	year = {2006},
}

@article{b292,
	author = {Jonathan D. Cohen},
	title = {Drawing Graphs to Convey Proximity: An Incremental
                  Arrangement Method},
	journal = {ACM Trans. Comput.-Human Interaction},
	volume = {4},
	number = {3},
	year = {1997},
	pages = {197--229},
}

@article{b293,
	title = {A Multilinear Singular Value Decomposition},
	author = {Lieven De Lathauwer and Bart De Moor and Joos
                  Vandewalle},
	journal = {Matrix Anal. and Appl.},
	volume = {21},
	number = {4},
	year = {2000},
	pages = {1253--1278},
}

@article{b294,
	author = {Bojan Mohar},
	title = {The {Laplacian} Spectrum of Graphs},
	year = {1991},
	journal = {Graph Theory, Comb., Appl.},
	volume = {2},
	pages = {871--898},
	publisher = {Wiley},
}

@inbook{b296,
	title = {Semi-supervised Learning},
	author = {Lawrence K. Saul and Kilian Q. Weinberger and Fei Sha
                  and Jihun Ham and Daniel D. Lee},
	chapter = {Spectral Methods for Dimensionality Reduction},
	year = {2006},
        publisher = {MIT Press},
	editor = {Olivier Chapelle and Bernhard Schölkopf and Alexander
                  Zien},
}

@inproceedings{b301,
	title = {Semantic Analysis of Tag Similarity Measures in
                  Collaborative Tagging Systems},
	author = {Cattuto, Ciro and Benz, Dominik and Hotho, Andreas and
                  Stumme, Gerd},
        booktitle = {Proc. Workshop on Ontology Learn. and Population},
	year = {2008},
}

@article{b304,
	title = {A Tutorial on Spectral Clustering},
	author = {Luxburg, Ulrike von},
	journal = {Stat. and Comput.},
	volume = {17},
	number = {4},
	year = {2007},
	pages = {395--416},
}

@inproceedings{b306,
	title = {A Kernel View of the Dimensionality Reduction of
                  Manifolds},
	author = {Jihun Ham and Daniel D. Lee and Sebastian Mika and
                  Bernhard Schölkopf},
	booktitle = {Proc. Int. Conf. on Mach. Learn.},
	year = {2004},
	pages = {47},
}

@article{b308,
	title = {Feature Discovery in Non-metric Pairwise Data},
	author = {Julian Laub and Klaus-Robert Müller},
	journal = {J. Mach. Learn. Res.},
	volume = {5},
	year = {2004},
	pages = {801--818},
}

@inproceedings{b309,
	author = {Inderjit S. Dhillon},
	title = {Co-clustering Documents and Words using Bipartite
                  Spectral Graph Partitioning},
	booktitle = {Proc. Int. Conf. on Knowl. Discov. and Data Min.},
	year = {2001},
	pages = {269--274},
}

@inproceedings{b311,
	title = {Recommender System for Online Dating Service},
	author = {Lukáš Brožovský and Václav Petříček},
	booktitle = {Proc. Conf. Znalosti},
	year = {2007},
	pages = {29--40},
	notes = {libimseti},
}

@inproceedings{b312,
	author = {Chris H. Q. Ding and Xiaofeng He and Hongyuan Zha},
	title = {A Spectral Method to Separate Disconnected and
                  Nearly-disconnected {Web} Graph Components},
	booktitle = {Proc. Int. Conf. on Knowl. Discov. and Data Min.},
	year = {2001},
	pages = {275--280},
}

@inproceedings{b319,
	title = {The `{DGX}' Distribution for Mining Massive, Skewed
                  Data},
	author = {Zhiqiang Bi and Christos Faloutsos and Flip Korn},
 	booktitle = {Proc. Int. Conf. on Knowl. Discov. and Data Min.},
	year = {2001},
	pages = {17--26},
}

@inproceedings{b320,
	author = {Christos Gkantsidis and Milena Mihail and Ellen
                  Zegura},
	title = {Spectral Analysis of {Internet} Topologies},
	booktitle = {Proc. Jt. Conf. IEEE Comput. and Communications Societies},
	year = {2003},
	pages = {364--374},
}

@inproceedings{b321,
	author = {Fei Wang and Tao Li and Changshui Zhang},
	title = {Semi-Supervised Clustering via Matrix Factorization},
	booktitle = {Proc. SIAM Int. Conf. on Data Min.},
	year = {2008},
	pages = {1--12}
}

@article{b322,
	author = {Kenneth E. Read},
	title = {Cultures of the {Central} {Highlands}, {New} {Guinea}},
	year = {1954},
	volume = {10},
	number = {1},
	journal = {Southwestern J. Anthropol.},
	pages = {1--43},
	notes = {the ucidata-gama dataset of the tribes of the Eastern
                  Central Highlands of New Guinea},
}

@book{b323,
	title = {Structural Models in Anthropology},
	author = {Per Hage and Frank Harary},
	year = {1983},
	publisher = {Cambridge Univ. Press},
}

@inproceedings{b324,
	title = {Matrices in the Theory of Signed Simple Graphs},
	author = {Thomas Zaslavsky},
	year = {2008},
	booktitle = {Proc. Int. Conf. Discrete Math.},
	pages = {207--229},
}

@inproceedings{b325,
	author = {Ramanathan Guha and Ravi Kumar and Prabhakar Raghavan
                  and Andrew Tomkins},
	title = {Propagation of Trust and Distrust},
	booktitle = {Proc. Int. World Wide Web Conf.},
	year = {2004},
	pages = {403--412},
	notes = {
		#: Trust networks with negative edges using the epinions
                  corpus.
		#: Link sign prediction (personalized trust)
		#: matrix-multiplication-based algorithms.
		#: They try out variable weighting for forward and
                  backward edges.
	},
}

@inproceedings{b331,
	title = {Statistical Analysis of the Social Network and
                  Discussion Threads in {S}lashdot},
	author = {Vicenç Gómez and Andreas Kaltenbrunner and Vicente
                  López},
	booktitle = {Proc. Int. World Wide Web Conf.},
	year = {2008},
	pages = {645--654},
}

@inproceedings{b332,
	title = {{DBpedia.org}--Querying {Wikipedia} like a Database},
	author = {Christian Bizer and Cyganiak, R. and Auer, S. and
                  Kobilarov, G.},
	booktitle = {Proc. Int. World Wide Web Conf.},
	year = {2007},
}

@inproceedings{b333,
	title = {{YAGO}--A Core of Semantic Knowledge},
	author = {Fabian Suchanek and Gjergji Kasneci and Gerhard
                  Weikum},
	booktitle = {Proc. Int. World Wide Web Conf.},
	year = {2007},
	pages = {697--706},
}

@article{b334,
	title = {Social Status in an Open-source Community},
	author = {Daniel Stewart},
	year = {2005},
	volume = {70},
	number = {5},
	journal = {Am. Sociological Rev.},
	pages = {823--842},
}

@article{b335,
	title = {Incorporating Contextual Information in Recommender
                  Systems using a Multidimensional Approach},
	author = {Gediminas Adomavicius and Ramesh Sankaranarayanan and
                  Shahana Sen and Alexander Tuzhilin},
	journal = {ACM Trans. Inf. Syst.},
	volume = {23},
	number = {1},
	year = {2005},
	pages = {103--145},
}

@inproceedings{b336,
	title = {Statistical Properties of Community Structure in Large
                  Social and Information Networks},
	author = {Jure Leskovec and Kevin J. Lang and Anirban Dasgupta
                  and Michael W. Mahoney},
	booktitle = {Proc. Int. World Wide Web Conf.},
	year = {2008},
	pages = {695--704},
	notes = {
		#: Network community profile plots (NCP)
		#: lots of corpora
	},
}

@article{b343,
	title = {Amazon.com Recommendations: Item-to-item Collaborative
                  Filtering},
	author = {Linden, G. and Smith, B. and York, J.},
	journal = {IEEE Internet Comput.},
	year = {2003},
	volume = {7},
	number = {1},
	pages = {76--80},
}

@inproceedings{b344,
	title = {The {Cinematch} System: Operation, Scale Coverage,
                  Accuracy, Impact},
	author = {Bennett, Jim},
	booktitle = {Proc. Summer Sch. on the Present and Future of Recomm. Syst.},
	year = {2006},
}

@inproceedings{b345,
	author = {Bryan Klimt and Yiming Yang},
	title = {The {Enron} Corpus: A New Dataset for Email
                  Classification Research},
	booktitle = {Proc. Eur. Conf. on Mach. Learn.},
	year = {2004},
	pages = {217--226},
}

@inproceedings{b346,
	title = {{BibSonomy}: A Social Bookmark and Publication
                  Sharing System},
	author = {Andreas Hotho and Robert Jäschke and Christoph Schmitz
                  and Gerd Stumme},
	booktitle = {Proc. Workshop on Conceptual Struct. Tool
                  Interoperability},
	pages = {87--102},
	year = {2006},
}

@inproceedings{b347,
	title = {Probabilistic Latent Semantic Analysis},
	author = {Thomas Hofmann},
	booktitle = {Proc. Conf. on Uncertain. in Artif. Intell.},
	year = {1999},
	pages = {289--296},
}

@article{b349,
	title = {{CiteULike}: A Researcher's Social Bookmarking
                  Service},
	author = {Emamy, Kevin and Cameron, Richard},
	journal = {Ariadne},
	number = {51},
	year = {2007},
}

@article{b350,
	title = {A Least-squares Approach to Joint Diagonalization},
	author = {Wax, M. and Sheinvald, J.},
	journal = {IEEE Signal Process. Lett.},
	year = {1997},
	volume = {4},
	number = {2},
	pages = {52--53},
	_notes = {
		#: Use in PhD thesis as main reference for Joint
                  Diagonalization (JD).
	},
}

@article{b351,
	title = {Bounds for the Least {Laplacian} Eigenvalue of a Signed Graph},
	author = {Yaoping P. Hou},
	journal = {Acta Math. Sinica},
	volume = {21},
	number = {4},
	year = {2005},
	pages = {955--960},
}

@article{b352,
	title = {The Structure of Scientific Collaboration Networks},
	author = {Mark E. J. Newman},
	journal = {Proc. Natl. Acad. Sci. U.S.A.},
	year = {2001},
	pages = {404--409},
	volume = {98},
	number = {2},
}

@inproceedings{b353,
	title = {Joint Diagonalization of Kernels for Information
                  Fusion},
	author = {Alberto Muñoz and Javier González},
	booktitle = {Proc. Iberoamerican Congress on Pattern
                  Recognit.},
	year = {2007},
	pages = {556--563},
}

@inproceedings{b354,
	title = {Exploit Semantic Information for Category Annotation
                  Recommendation in {Wikipedia}},
	author = {Wang, Yang and Wang, Haofen and Zhu, Haiping and Yu,
                  Yong},
	booktitle = {Natural Lang. Process. and Inf. Syst.},
	pages = {48--60},
	year = {2007},
}

@article{b355,
	title = {On the Notion of Balance of a Signed Graph},
	author = {Frank Harary},
	journal = {Michigan Math. J.},
	year = {1953},
	volume = {2},
	pages = {143--146},
	number = {2},
	notes = {balance theory},
}

@article{b356,
	title = {On the {Laplacian} Eigenvalues of Signed Graphs},
	author = {Yaoping P. Hou and Jiongsheng S. Li and Yongliang
                  Pan},
	journal = {Linear and Multilinear Algebra},
	year = {2003},
	number = {51},
	volume = {1},
	pages = {21--30},
}

@inproceedings{b357,
  author = {Yehuda Koren and Liran Carmel and David Harel},
  title = {{ACE}: A Fast Multiscale Eigenvectors Computation for Drawing
               Huge Graphs},
  booktitle = {Symp. on Inf. Visualization},
  year = {2002},
  pages = {137-144},
}

@article{b358,
	title = {Latent {D}irichlet Allocation},
	author = {David Blei and Andrew Ng and Michael Jordan and John
                  Lafferty},
	journal = {J. Mach. Learn. Res.},
	year = {2003},
	volume = {3},
	pages = {993--1022},
}

@book{b359,
	title = {Modern Information Retrieval},
	author = {Ricardo Baeza-Yates and Berthier Ribeiro-Neto},
	year = {1999},
	publisher = {Addison-Wesley}
}

@inproceedings{b360,
	author = {Ivan Titov and Ryan McDonald},
	title = {Modeling Online Reviews with Multi-grain Topic Models},
	booktitle = {Proc. Int. World Wide Web Conf.},
	year = {2008},
	pages = {111--120},
}

@article{b362,
	title = {A Characterization of the Smallest Eigenvalue of a
                  Graph},
	author = {Madhav Desai and Vasant Rao},
	journal = {Graph Theory},
	volume = {18},
	number = {2},
	pages = {181--194},
	year = {1994},
	notes = {
		for an unsigned graph, they consider the matrix D+A, and
                  show that it is positive-semidefinite, and that it is
                  singular iff the graph is bipartite.  This is in fact
                  the signed Laplacian of the corresponding graph with
                  only negative edges.
	},
}

@inproceedings{b364,
	title = {Learning with Hypergraphs: Clustering, Classification,
                  and Embedding},
	author = {Dengyong Zhou and Jiayuan Huang and Bernhard
                  Schölkopf},
	notes = {duality between bipartite graph and hypergraph (not
                  tensors)},
	booktitle = {Advances in Neural Inf. Process. Syst.},
	year = {2007},
	pages = {1601--1608},
}

@article{b365,
	title = {Dual Graphs and Knot Invariants},
	author = {Magnhild Lien and William Watkins},
	journal = {Linear Algebra and its Appl.},
	volume = {306},
	number = {1},
	year = {2000},
	pages = {123--130},
}

@article{b366,
	title = {The Use of the Area Under the {ROC} Curve in the
                  Evaluation of Machine Learning Algorithms},
	author = {Andrew P. Bradley},
	journal = {Pattern Recognit.},
	year = {1997},
	volume = {30},
	pages = {1145--1159},
	notes = {
		ROC, AUC, area under curve.
	},
}

@inproceedings{b367,
	title = {Controversial Users Demand Local Trust Metrics: an
                  Experimental Study on {epinions.com} Community},
	author = {Paolo Massa and Paolo Avesani},
	booktitle = {Proc. American Association for Artif. Intell. Conf.},
	year = {2005},
	pages = {121--126},
	notes = {
#: Epinions.
#: What they call local trust metrics: prediction of trust given a user
                  pair, as opposed to a global trust measure.
	},
}

@misc{b370,
	title = {Avoiding Monotony: Improving the Diversity of
                  Recommendation Lists},
	author = {Mi Zhang, Neil Hurley},
	notes = {Inhaltlich meine Diplomarbeit},
}

@inproceedings{b371,
	title = {Online-updating Regularized Kernel Matrix Factorization
                  Models for Large-scale Recommender Systems},
	author = {Steffen Rendle and Lars Schmidt-Thieme},
	booktitle = {Proc. Int. Conf. on Recomm. Syst.},
	year = {2008},
	pages = {251--258},
}

@inproceedings{b372,
	title = {Matrix Factorization and Neighbor Based Algorithms for
                  the {N}etflix {P}rize Problem},
	author = {Gábor Takács and István Pilászy and Bottyán Németh and
                  Domonkos Tikk},
	year = {2008},
	booktitle = {Proc. Int. Conf. on Recomm. Syst.},
	pages = {267--274},
}

@inproceedings{b373,
	title = {Query Suggestion Using Hitting Time},
	author = {Qiaozhu Mei and Dengyong Zhou and Kenneth Church},
	booktitle = {Proc. Int. Conf. on Inf. and Knowl. Manag.},
	year = {2008},
	pages = {469--478},
	notes = {Bipartite query-url graph, diffusion process.},
}

@inproceedings{b374,
	title = {Factorization Meets the Neighborhood: a Multifaceted
                  Collaborative Filtering Model},
	author = {Yehuda Koren},
	booktitle = {Proc. Int. Conf. on Knowl. Discov. and Data Min.},
	year = {2008},
	pages = {426--434},
}

@inproceedings{b376,
	author = {Bronwyn H. Hall and Adam B. Jaffe and Manuel
                  Trajtenberg},
	title = {The {NBER} Patent Citations Data File: Lessons,
                  Insights and Methodological Tools},
	booktitle = {{NBER} Working Papers 8498, Natl. Bureau of
                  Economic Research, Inc},
	year = {2001},
}

@article{b377,
	title = {On the Pseudo-inverse of the {Laplacian} of a Bipartite Graph},
	author = {Ngoc-Diep Ho and Paul Van Dooren},
	journal = {Appl. Math. Lett.},
	volume = {18},
	number = {8},
	pages = {917--922},
	year = {2005},
}

@inproceedings{b379,
	title = {Combining Content and Link for Classification using
                  Matrix Factorization},
	author = {Shenghuo Zhu and Kai Yu and Yun Chi and Yihong Gong},
	booktitle = {Proc. Int. Conf. on Res. and Dev. in
                  Inf. Retrieval},
	year = {2007},
	pages = {487--494},
}

@inproceedings{b387,
	title = {Relation between {PLSA} and {NMF} and Implications},
	author = {Eric Gaussier and Cyril Goutte},
	booktitle = {Proc. Int. Conf. on Res. and Dev. in
                  Inf. Retrieval},
	year = {2005},
	pages = {601--602},
}

@inproceedings{b388,
	author = {Ian Porteous and Evgeniy Bart and Max Welling},
	title = {Multi-{HDP}: A Non Parametric Bayesian Model for Tensor
                  Factorization},
	booktitle = {Proc. AAAI Conf. on Artif. Intell.},
	year = {2008},
	pages = {1487--1490},
}

@inproceedings{b390,
	title = {Network Analysis of Collaboration Structure in
                  {Wikipedia}},
	author = {Ulrik Brandes and Patrick Kenis and Jürgen Lerner and
                  Raaij, Denise van},
	booktitle = {Proc. Int. World Wide Web Conf.},
	pages = {731--740},
	year = {2009},
}

@article{b391,
	title = {Learning Probabilistic Models of Link Structure},
	author = {Lise Getoor and Nir Friedman and Daphne Koller and
                  Benjamin Taskar},
	year = {2002},
	journal = {J. Mach. Learn. Res.},
	volume= {3},
	pages = {679--707},
}

@inproceedings{b393,
	title = {Algorithms for Non-negative Matrix Factorization},
	author = {Daniel D. Lee and Sebastian H. Seung},
	booktitle = {Advances in Neural Inf. Process. Syst.},
	year = {2000},
	pages = {556--562},
}

@article{b396,
	author = {Réka Albert and Hawoong Jeong and Albert-László
                  Barabási},
	title = {The Diameter of the {World} {Wide} {Web}},
	journal = {Nature},
	volume = {401},
	pages = {130},
	year = {1999},
}

@article{b397,
	title = {Engineering a Multi-purpose Test Collection for {W}eb
                  Retrieval Experiments},
	author = {Peter Bailey and Nick Craswell and David Hawking},
	journal = {Inf. Process. and Manag.},
	volume = {39},
	number = {6},
	pages = {853--871},
	year = {2003},
}

@article{b400,
	title = {Summarizing Dynamic Bipolar Conflict Structures},
	author = {Ulrik Brandes and Daniel Fleischer and Jürgen Lerner},
	journal = {Trans. on Visualization and Comput. Graphics},
	volume = {12},
	number = {6},
	pages = {1486--1499},
	year = {2006},
}

@inproceedings{b401,
	title = {Classifying Networked Entities with Modularity
                  Kernels},
	author = {Zhang, Dell and Mao, Robert},
	booktitle = {Proc. Conf. on Inf. and Knowl. Manag.},
	year = {2008},
	pages = {113--122},
}

@inproceedings{b405,
	title = {On Spectral Graph Drawing},
	author = {Yehuda Koren},
	booktitle = {Proc. Int. Comput. and Comb. Conf.},
	year = {2003},
	pages = {496--508},
}

@inbook{b406,
	chapter = {Visualization of Conflict Networks},
	author = {Ulrik Brandes and Jürgen Lerner},
	pages = {169--188},
	publisher = {IOS Press},
	year = {2008},
	volume = {36},
	title = {{NATO} Science for Peace and Security Series {E}: Human
                  and Societal Dynamics},
}

@article{b408,
	title = {Power Laws, {Pareto} Distributions and {Zipf}'s Law},
	author = {M. E. J. Newman},
	journal = {Contemp. Phys.},
	volume = {46},
	number = {5},
	year = {2006},
	pages = {323--351},
	notes = {Equation (5): Robust estimation of the power law
                  exponent.},
}

@article{b413,
	title = {Finding Community Structure in Networks using the
                  Eigenvectors of Matrices},
	author = {M. E. J. Newman},
	journal = {Phys. Rev. E},
	volume = {74},
	number = {3},
	year = {2006},
	pages = {036104},
}

@inproceedings{b418,
	title = {Planetary-scale Views on a Large Instant-Messaging
                  Network},
	author = {Jure Leskovec and Eric Horvitz},
	booktitle = {Proc. Int. World Wide Web Conf.},
	year = {2008},
	pages = {915--924},
}

@inproceedings{b421,
	title = {Rhythms of Social Interaction: Messaging within a
                  Massive Online Network},
	author = {Scott A. Golder and Dennis M. Wilkinson and Bernardo
                  A. Huberman},
	year = {2007},
	booktitle = {Proc. Int. Conf. on Communities and Technol.},
}

@article{b425,
	title = {Weighted Spectral Distribution for {Internet} Topology
                  Analysis: Theory and Applications},
	author = {Damien Fay and Hamed Haddadi and Andrew Thomason and
                  Andrew W. Moore and Richard Mortier and Almerima
                  Jamakovic and Steve Uhlig and Miguel Rio},
	journal = {IEEE Trans. on Netw.},
	volume={18},
	number={1},
	pages={164--176},
	year={2010},
}

@inproceedings{b426,
	title = {Combining Content and Collaboration in Text Filtering},
	author = {Ian M Soboroff and Charles K. Nicholas},
	booktitle = {Proc. Workshop on Mach. Learn. for Inf. Filtering},
	year = {1999},
	pages = {86--91},
}

@inproceedings{b427,
	title = {Freebase: A Collaboratively Created Graph Database for
            Structuring Human Knowledge},
	author = {Kurt Bollacker and Colin Evans and Praveen Paritosh
                  and Tim Sturge and Jamie Taylor},
	booktitle = {Proc. Int. Conf. on Manag. of Data},
	year = {2008},
	pages = {1247--1249},
}

@misc{b430,
	title = {{O}pen {IPTV} {F}orum},
	author = {{Members of the {O}pen {IPTV} {F}orum}},
	note = {Whitepaper},
	year = {2009},
}

@inproceedings{b431,
	title = {Introducing the {Enron} Corpus},
	author = {Bryan Klimt and Yiming Yang},
	booktitle = {Proc. Conf. on Email and Anti-spam},
	year = {2004},
}

@inproceedings{b433,
	title = {Information Retrieval using a Singular Value
                  Decomposition Model
               of Latent Semantic Structure},
	author = {George W. Furnas and Scott C. Deerwester and Susan
                  T. Dumais and Thomas K. Landauer and Richard A.
                  Harshman and Lynn A. Streeter and Karen E. Lochbaum},
	booktitle = {Proc. Int. Conf. on Res. and Dev. in
                  Inf. Retrieval},
  	year = {1988},
 	pages = {465--480},
}

@article{b434,
	title = {Some Mathematical Notes on Three-mode Factor Analysis},
	author = {Ledyard R. Tucker},
	journal = {Psychometrika},
	volume = {31},
	number = {3},
	year = {1966},
	pages = {279--311},
}

@article{b435,
	title = {Analysis of Individual Differences in Multidimensional
                  Scaling via an $n$-way Generalization Of
                  `{Eckart}--{Young}' Decomposition},
	author = {J. Carroll and Jih-Jie Chang},
	journal = {Psychometrika},
	volume = {35},
	number = {3},
	year = {1970},
	pages = {283--319},
}

@inproceedings{b436,
	title = {{Flickr} Tag Recommendation based on Collective
                  Knowledge},
	author = {Börkur Sigurbjörnsson and Zwol, Roelof van},
	booktitle = {Proc. Int. World Wide Web Conf.},
	year = {2008},
	pages = {327--336},
}

@book{b437,
	title = {{WordNet}: an Electronic Lexical Database},
	editor = {Christiane Fellbaum},
	publisher = {MIT Press},
	year = {1998},
}

@article{b438,
	title = {Probabilistic {H}orn Abduction and {B}ayesian
                  Networks},
	author = {Poole, David},
	journal = {Artif. Intell.},
	volume = {64},
	number = {1},
	year = {1993},
	pages = {81--129},
}

@article{b439,
	title = {Emergence of Scaling in Random Networks},
	author = {Albert-László Barabási and Réka Albert},
	journal = {Science},
	number = {5439},
	pages = {509--512},
	volume = {286},
	year = {1999},
	notes = {
		Preferential attachment (main reference).
		Scale-free network.
		Barabási--Albert model.
	},
}

@inproceedings{b441,
	title = {Improving Social Filtering Techniques through
                  {WordNet}-based User Profiles},
	author = {Pasquale Lops and Marco Degemmis and Giovanni
                  Semeraro},
	booktitle = {Proc. Int. Conf. on User Modeling},
	year = {2007},
	pages = {268--277},
}

@article{b452,
	title = {Normalized Cuts and Image Segmentation},
	author = {Jianbo Shi and Jitendra Malik},
	journal = {IEEE Trans. on Pattern Anal. and Mach. Intell.},
	volume = {22},
	number = {8},
	pages = {888--905},
	year = {2000},
}

@inproceedings{b453,
	title = {On Spectral Clustering: Analysis and an Algorithm},
	author = {Andrew Y. Ng and Michael I. Jordan and Yair Weiss},
	booktitle = {Advances in Neural Inf. Process. Syst.},
	year = {2001},
	pages = {849--856},
}

@article{b456,
	title = {Spectral Measures of Bipartivity in Complex Networks},
	author = {Ernesto Estrada and Juan A. Rodríguez-Velázquez},
	journal = {Phys. Rev. E},
	year = {2005},
	volume = {72},
	number = {4},
	pages = {046105},
	notes = {
		β(G) = Σ<sub>i</sub> cosh(λ<sub>i</sub>) / Σ<sub>i</sub>
                  e<sup>λ<sub>i</sub></sup>
		0 ≤ β(G) ≤ 1, with β(G) = 1 when G is bipartite
	},
}

@inproceedings{b461,
	title = {Microscopic Evolution of Social Networks},
	author = {Jure Leskovec and Lars Backstrom and Ravi Kumar and
                  Andrew Tomkins},
 	booktitle = {Proc. Int. Conf. on Knowl. Discov. and Data Min.},
	year = {2008},
	pages = {462--470},
	notes = {
		They only consider the closing of edges, i.e. 2-paths.
	},
}

@article{b462,
	title = {Power-law Distributions in Empirical Data},
	author = {Aaron Clauset and Cosma Rohilla Shalizi and
                  M. E. J. Newman},
	journal = {SIAM Rev.},
	volume = {51},
	number = {4},
	pages = {661--703},
	year = {2009},
}

@inproceedings{b464,
	title = {Geometry-aware Metric Learning},
	author = {Lu, Zhengdong and Prateek Jain and Inderjit
                  S. Dhillon},
	booktitle = {Proc. Int. Conf. on Mach. Learn.},
	year = {2009},
	pages = {673--680},
}

@misc{b468,
	notes = {Same as b364},
},

@inproceedings{b472,
	author = {Seshadri, Mukund and Machiraju, Sridhar and Sridharan,
                  Ashwin and Bolot, Jean and Faloutsos, Christos and
                  Leskovec, Jure},
	title = {Mobile Call Graphs: Beyond Power-law and Lognormal
                  Distributions},
	booktitle = {Proc. Int. Conf. on Knowl. Discov. and Data Min.},
	year = {2008},
	pages = {596--604},
}

@article{b475,
	author = {Lada Adamic and Eytan Adar},
	title = {Friends and Neighbors on the {Web}},
	journal = {Soc. Netw.},
	year = {2001},
	volume = {25},
	pages = {211--230},
}

@inproceedings{b479,
	title = {Computing the Inverse Matrix Hyperbolic Sine},
	author = {Cardoso, João R. and Leite, F. Silva},
	booktitle = {Proc. Int. Conf. on Numerical Anal. and its Appl.},
	year = {2001},
	pages = {160--169},
}

@inproceedings{b480,
	author = {Viswanath, Bimal and Mislove, Alan and Cha, Meeyoung
                  and Gummadi, Krishna P.},
	title = {On the Evolution of User Interaction in {Facebook}},
	booktitle = {Proc. Workshop on Online Soc. Netw.},
	year = {2009},
	pages = {37--42},
}

@inproceedings{b482,
	title = {Fast Nonparametric Matrix Factorization for Large-scale
		Collaborative Filtering},
	author = {Kai Yu and Shenghuo Zhu and John Lafferty and Yihong
                  Gong},
	booktitle = {Proc. Int. Conf. on Res. and Dev. in
                  Inf.
		Retrieval},
	year = {2009},
	pages = {211--218},
}

@techreport{b492,
	title = {Multi-view Clustering for Mining Heterogeneous Social
                  Network Data},
	author = {Derek Greene and Pádraig Cunningham},
	year = {2009},
	institution = {Univ. Coll. Dublin},
}

@article{b493,
	title = {A Model of Weighted Network: the Student Relationships
                  in a Class},
	author = {Bo Hu and Xin-Yu Jiang and Jun-Feng Ding and Yan-Bo
                  Xie and Bing-Hong Wang},
	year = {2004},
	journal = {CoRR},
	volume = {cond-mat/0408125},
}

@inproceedings{b494,
	title = {Growth of the {Flickr} Social Network},
	author = {Alan Mislove and Hema Swetha Koppula and Krishna
                  P. Gummadi and Peter Druschel and Bobby
                  Bhattacharjee},
	booktitle = {Proc. Workshop on Online Soc. Netw.},
	year = {2008},
	pages = {25--30},
	notes = {
#: The wosn datasets ( Flickr Links (147MB) YouTube (directed) Links
                  (210MB) YouTube (undirected) Links (920MB) Internet
                  Links (546KB) Wikipedia Links (271MB)), from
                  http://socialnetworks.mpi-sws.org/data-wosn2008.html
	},
}

@misc{b495,
	title = {Trust-aware Recommender Systems},
	author = {Paolo Massa and Paolo Avesani},
	notes = {
		#: Hybrid collborative-social/trust recommender.
	},
}

@misc{b496,
	title = {Towards Machine Learning on the Semantic Web},
	author = {Volker Tresp and Markus Bundschus and Achim Rettinger
                  and Yi Huang},
}

@inproceedings{b497,
	title = {Collaborative Filtering with Temporal Dynamics},
	author = {Yehuda Koren},
 	booktitle = {Proc. Int. Conf. on Knowl. Discov. and Data Min.},
	year = {2009},
	pages = {447--456},
}

@misc{b498,
	title = {A Unified Approach to Building Hybrid Recommender
                  Systems},
	author = {Asela Gunawardana and Christopher Meek},
}

@inproceedings{b499,
	title = {Learning to Recommend with Trust and Distrust
                  Relationships},
	author = {Ma, Hao and Lyu, Michael R. and King, Irwin},
	booktitle = {Proc. Conf. on Recomm. Syst.},
	year = {2009},
	pages = {189--196},
	doi = {10.1145/1639714.1639746},
	acmid = {1639746},
}

@inproceedings{b500,
	title = {Personalised and Dynamic Trust in Social Networks},
	author = {Frank E. Walter and Stefano Battiston and Frank
                  Schweitzer},
	booktitle = {Proc. Int. Conf. on Recomm. Syst.},
	year = {2009},
	pages = {197--204},
	notes = {
		#: von Neumann kernel on user–user trust matrix.
	},
}

@misc{b501,
	title = {Improving Recommendation Accuracy by Clustering Social
                  Networks with Trust},
	author = {Tom DuBois and Jennifer Golbeck and John Kleint and
                  Aravind Srinivasan},
	notes = {
		#: Collaborative-trust hybrid, with clustering.
	},
}

@misc{b502,
	title = {Category Theory in Ontology Research: Concrete Gain
                  from an Abstract Approach},
	author = {Markus Krötzsch and Pascal Hitzler and Marc Ehrig and
                  York Sure},
}

@misc{b503,
	title = {Random projection in dimensionality reduction:
                  Applications to image and text data},
	author = {Ella Bingham and Heikki Mannila},
}

@misc{b504,
	title = {Generalized Low Rank Approximations of Matrices},
	author = {Jieping Ye},
	notes = {
	#: Given k matrices A<sub>i</sub> of size m×n, find U ∈
                  <b>R</b><sup>m×r</sup>, V ∈ <b>R</b><sup>n×s</sup> and
                  R<sub>i</sub> ∈ <b>R</b><sup>r×s</sup> minimizing
                  Σ<sub>i</sub> |A<sub>i</sub> − U R<sub>i</sub>
                  V<sup>T</sup>|<sub>F</sub>.
	},
}

@misc{b505,
	title = {A Mathematical Bibliography of Signed and Gain Graphs
                  and Allied Areas},
	author = {Thomas Zaslavsky},
	notes = {Cites the Slashdot Zoo paper},
}

@misc{b506,
	title = {Kernel $k$-means, Spectral Clustering and Normalized
                  Cuts},
	author = {Inderjit S. Dhillon and Yuqiang Guan and Brian Kulis},
}

@article{b507,
	title = {Eigenvalues of Rank-one Updated Matrices with some
                  Applications},
	author = {Jiu Ding and Aihui Zhou},
	journal = {Appl. Math. Lett.},
	volume = {20},
	number = {12},
	year = {2007},
	pages = {1223--1226},
}

@article{b508,
	title = {Rank-one Modification of the Symmetric Eigenproblem},
	author = {James Bunch and Christopher Nielsen and Danny
                  Sorensen},
	journal = {Numerische Math.},
	volume = {31},
	number = {1},
	year = {1978},
	pages = {31--48},
}

@misc{b509,
	title = {Collaborative Filtering and the Generalized Vector
                  Space Model},
	author = {Ian Soboroff and Charles Nicholas},
}

@misc{b510,
	title = {Recommending New Movies: Even a Few Ratings Are More
                  Valuable Than Metadata},
	author = {István Pilászy and Domonkos Tikk},
	notes = {
		#: Hybrid collaborative-content-based recommender.  They
                  say item features are not useful in Netflix because
                  the item dimension pretty well populated.
	},
}

@book{b511,
	title = {Networks, Crowds, and Markets: Reasoning About a Highly
                  Connected World},
	author = {David Easley and Jon Kleinberg},
	notes = {
		#: Chapter 5 about signed graphs, they cite the Slashdot
                  Zoo paper.
	},
}

@article{b512,
	title = {Mathematical Results on Scale-free Random Graphs},
	author = {B. Bollobás},
	notes = {
		#: preferential attachment
		#: the LCD model
	},
}

@misc{b513,
	title = {A Spatio-Temporal Approach to Collaborative Filtering},
	author = {Zhengdong Lu and Deepak Agarwal and Inderjit
                  S. Dhillon},
}

@misc{b514,
	title = {Tensor Decompositions and Applications},
	author = {Tamara G. Kolda and Brett W. Bader},
	notes = {
		#: Recommended by Stephan Spiegel.
	},
}

@inproceedings{b515,
	title = {Beyond Streams and Graphs: Dynamic Tensor Analysis},
	author = {Jimeng Sun and Dacheng Tao and Christos Faloutsos},
 	booktitle = {Proc. Int. Conf. on Knowl. Discov. and Data Min.},
	year = {2006},
	pages = {374--383},
	notes = {
		#: Take time as a tensor dimension and perform tensor
                  decomposition.  They don't really talk about network
                  evolution.
	},
}

@book{b516,
	title = {Linear Algebra and Its Applications},
	author = {Peter D. Lax},
	year = {1984},
	publisher = {Wiley},
	notes = {
		#: 8.5: Avoidance of eigenvalue crossings.
	},
}

@misc{b517,
	title = {Simple Waves Do Not Avoid Eigenvalue Crossings},
	author = {Lyuba Chumakova and Esteban G. Tabak},
	notes = {
		#: avoided crossing.
	},
}

@phdthesis{b518,
	title = {Online Social Networks: Measurement, Analysis, and
                  Applications to Distributed Information Systems},
	author = {Alan Mislove},
	school = {Rice Univ.},
	year = {2009},
	notes = {
		#: Explanation of the WOSN 2008 datasets (Youtube
                  un/directed, Flickr, Internet, Wikipedia).
	},
}

@inproceedings{b519,
	author = {Lung-de Shyu and Seng-yong Lau and Polly Huang},
	title = {On the Search of {Internet} {AS}-level Topology
                  Invariants},
	booktitle = {Proc. Global Telecommunications Conf.},
	pages = {1--5},
	year = {2006},
	notes = {
		#: The Normalized Laplacian spectrum (a.k.a. weighted
                  spectral distribution) is the only constant over time.
	},
}

@inproceedings{b520,
	title = {The {Netflix} {Prize}},
	author = {James Bennett and Stan Lanning},
	year = {2007},
	booktitle = {Proc. KDD Cup},
	pages = {3--6},
	notes = {
		#: The "netflix" dataset.
	},
}

@book{b521,
	title = {Introduction to Information Retrieval},
	author = {Christopher D. Manning and Prabhakar Raghavan and
                  Hinrich Schütze},
	year = {2008},
	publisher = {Cambridge Univ. Press},
	notes = {
		#: Mean average precision (MAP).
	},
}

@article{b522,
	title = {Graph Kernels},
	author = {S.V. N. Vishwanathan and Karsten M. Borgwardt and Imre
                  Risi Kondor and Nicol N. Schraudolph},
	journal = {J. Mach. Learn. Res.},
	year = {2010},
	volume = {11},
	pages = {1201--1242},
}

@inproceedings{b523,
	title = {Improving Recommendation Lists through Topic
                  Diversification},
	author = {Cai-Nicolas Ziegler and Sean M. McNee and Joseph
                  A. Konstan and Georg Lausen},
	booktitle = {Proc. Int. World Wide Web Conf.},
	year = {2005},
	pages = {22--32},
	notes = {
		#: The bx / bookcrossing dataset.
	},
}

@inproceedings{b524,
	title = {{CiteSeer}: An Autonomous {Web} Agent for Automatic
                  Retrieval and Identification of Interesting
                  Publications},
	author = {Kurt Bollacker and Steve Lawrence and C. Lee Giles},
	booktitle = {Proc. Int. Conf. on Auton. Agents},
	year = {1998},
	pages = {116--123},
	notes = {
		#: The "citeseer" dataset.
	},
}

@inproceedings{b525,
	title = {The {DBLP} Computer Science Bibliography: Evolution,
                  Research Issues, Perspectives},
	author = {Michael Ley},
	booktitle = {Proc. Int. Symp. on String Process. and Inf. Retrieval},
	year = {2002},
	pages = {1--10},
	notes = {
		#: The "dblp" dataset.
	},
}

@inproceedings{b526,
	title = {The Resistance Distance is Meaningless for Large Random
                  Geometric Graphs},
	author = {Agnes Radl and Luxburg, Ulrike von and Matthias Hein},
	booktitle = {Proc. Workshop on Analyzing Netw. and Learn. with Graphs},
	year = {2009},
	_pages = {},
}

@inproceedings{b527,
	title = {Signed Networks in Social Media},
	author = {Leskovec, Jure and Huttenlocher, Daniel and Kleinberg,
                  Jon},
	booktitle = {Proc. Int. Conf. on Human Factors in Comput. Syst.},
	year = {2010},
	pages = {1361--1370},
}

@techreport{b528,
	title = {Perturbation Theory for the Singular Value
                  Decomposition},
	author = {Gilbert W. Stewart},
	year = {1990},
	institution = {Univ. of Maryland, Coll. Park},
}

@misc{b529,
	title = {Evolution of Networks},
	author = {S.N. Dorogovtsev and J.F.F. Mendes},
	notes = {
		#: from the Physics literature.
	},
}

@inproceedings{b530,
	title = {Link Prediction in Relational Data},
	author = {Ben Taskar and Ming-Fai Wong and Pieter Abbeel and
                  Daphne Koller},
	booktitle = {Advances in Neural Inf. Process. Syst.},
	year = {2003},
}
                  
@article{b531,
	title = {Network Bipartivity},
	author = {Petter Holme and Fredrik Liljeros and Christofer
                  R. Edling and Kim, Beom Jun},
	journal = {Phys. Rev. E},
	year = {2003},
	volume = {68},
	number = {5},
	pages = {056107},
}

@article{b532,
	title = {Impact of Human Mobility on Opportunistic Forwarding
                  Algorithms},
	author = {Augustin Chaintreau and Pan Hui and Jon Crowcroft and
                  Christophe Diot and Richard Gass and James Scott},
	journal = {IEEE Trans. on Mobile Comput.},
	year = {2007},
	volume = {6},
	number = {6},
	pages = {606--620},
	notes = {
		#: The ''contact'' dataset.
	},
}

@misc{b533,
	title = {Context-aware Recommendations on Rails},
	author = {Tim Hussein and Timm Linder and Werner Gaulke and
                  Jürgen Ziegler},
	notes = {
		#: May be similar to the Universal Recommender.
	},
}

@misc{b534,
	title = {A Unified View of Kernel $k$-means, Spectral Clustering
                  and Graph Cuts},
	author = {Inderjit Dhillon and Yuqiang Guan and Brian Kulis},
}

@article{b535,
	author = {Faloutsos, Michalis and Faloutsos, Petros and
                  Faloutsos, Christos},
	title = {On Power-law Relationships of the {Internet} Topology},
	journal = {SIGCOMM Comput. Commun. Rev.},
	volume = {29},
	number = {4},
	year = {1999},
	pages = {251--262},
	notes = {
		#: the eigenvalue exponent: the eigenvalues of the
                  adjacency matrix of networks follow a power-law, whose
                  exponent is called the 'eigen exponent'.
	},
}

@misc{b536,
	title = {Spectra of `Real–World' Graphs: Beyond the Semi-Circle
                  Law},
	author = {Illés J. Farkas and Imre Derényi and Albert-László
                  Barabási and Tamás Vicsek},
}

@article{b537,
	title = {Spectra and Eigenvectors of Scale-free Networks},
	author = {Goh, K.-I.  and Kahng, B.  and Kim, D. },
	journal = {Phys. Rev. E},
	volume = {64},
	number = {5},
	pages = {051903},
	year = {2001},
	notes = {
		#: In scale-free networks, the largest eigenvalue λ₁
                  grows as n<sup>1/4</sup>.
	},
}

@misc{b538,
	title = {On Social Networks and Collaborative Recommendation},
	author = {Ioannis Konstas and Vassilios Stathopoulos and Joemon
                  M Jose},
	notes = {
		#: Hybrid social-folksonomy recommender.
	},
}

@misc{b539,
	title = {Growing Network with Local Rules: Preferential
                  Attachment, Clustering Hierarchy, and Degree
                  Correlations},
	author = {Alexei Vázquez},
}

@misc{b540,
	title = {{Logsonomy} -- Social Information Retrieval With
                  Logdata},
	author = {Beate Krause and Robert Jäschke and Andreas Hotho and
                  Gerd Stumme},
	notes = {
		#: The user×query-word×clicked-search-result tensor
	},
}

@misc{b541,
	title = {Statistical Evaluation of Algebraic Constraints for
                  Social Networks},
	author = {Philippa Pattison and Stanley Wasserman and Garry
                  Robins and Alaina Michaelson Kanfer},
}

@misc{b542,
	title = {A Note on Juncture Homomorphism},
	author = {Martin G. Everett and Stephen P. Borgatti},
	notes = {
		#: Graph semigroups.
	},
}

@misc{b543,
	title = {{SoRec}: Social Recommendation Using Probabilistic
                  Matrix Factorization},
	author = {Hao Ma and Haixuan Yang and Michael R. Lyu and Irwin
                  King},
	notes = {
		#: Hybrid social-collaborative recommender.
	},
}

@misc{b544,
	title = {Mining Social Networks Using Heat Diffusion Processes
                  for Marketing Candidates Selection},
	author = {Hao Ma and Haixuan Yang and Michael R. Lyu and Irwin
                  King},
	notes = {
		#: Heat diffusion with negative edges.
	},
}

@inproceedings{b545,
	title = {What is {Twitter}, a Social Network or a News Media?},
	author = {Haewoon Kwak and Changhyun Lee and Hosung Park and Sue
                  Moon},
	booktitle = {Proc. Int. World Wide Web Conf.},
	year = {2010},
	pages = {591--600},
	notes = {
		#: The "twitter" dataset.
	},
}

@inproceedings{b546,
	author = {Luo, Bin and Wilson, Richard C. and Hancock, Edwin
                  R.},
	title = {Spectral Clustering of Graphs},
	booktitle = {Proc. Int. Conf. on Graph-based Representations in
                  Pattern Recognit.},
	year = {2003},
	pages = {190--201},
	notes = {
		#: Cluster individual graphs uses statistics derived
                  from their adjacency matrices.
	},
}

@misc{b547,
	title = {Dynamic Social Network Analysis Using Latent Space
                  Models},
	author = {Purnamrita Sarkar and Andrew W. Moore},
}

@misc{b548,
	title = {A Latent Space Approach to Dynamic Embedding of
                  Co-occurrence Data},
	author = {Purnamrita Sarkar and Sajid M. Siddiqi and Geoffrey
                  J. Gordon},
	notes = {
		#: Evolution of the bipartite author by
                  word-in-publication graph over time.
		#: They use a probabilistic method similar to Markov
                  chains, where adjacency timeslices depend on each
                  other.
	},
}

@inbook{b549,
	author = {Thomas Gärtner and Tamás Horváth and Quoc V. Le and
                  Alex Smola and Stefan Wrobel},
	chapter = {Kernel Methods for Graphs},
	title = {Min. Graph Data},
	year = {2006},
	publisher = {Wiley},
	editor = {Diane J. Cook and Lawrence B. Holder},
}

@inproceedings{b550,
	title = {Cluster Kernels for Semi-supervised Learning},
	author = {Olivier Chapelle and Jason Weston and Berhard
                  Schölkopf},
	booktitle = {Advances in Neural Inf. Process. Syst.},
	year = {2003},
	pages = {585--592},
	notes = {
		#: Spectral transformations for semi-supervised
                  learning.
		#: includes some spectral transformation functions, but
                  no method to learn them.
	},
}

@inproceedings{b551,
	title = {Governance in Social Media: A Case Study of the
                  {Wikipedia} Promotion Process},
	author = {Jure Leskovec and Daniel Huttenlocher and Jon
                  Kleinberg},
	booktitle = {Proc. Int. Conf. on Weblogs and Soc. Media},
	year = {2010},
	pages = {98--105},
	notes = {The "elec" dataset},
}

@article{b552,
	title = {Mapping the {Gnutella} Network: Properties of
                  Large-scale Peer-to-peer Systems and Implications for
                  System Design},
	author = {Matei Ripeanu and Ian Foster and Adriana Iamnitchi},
	journal = {IEEE Internet Comput. J.},
	year = {2002},
	volume = {6},
	notes = {
		#: The p2p-Gnutella* datasets from SNAP.
	},
}

@inproceedings{b553,
	title = {The {Reuters} Corpus Volume 1--From Yesterday's News to
                  Tomorrow's Language Resources},
	author = {Tony Rose and Mark Stevenson and Miles Whitehead},
	booktitle = {Proc. Int. Conf. on Lang. Resources and
                  Evaluation},
	pages = {29--31},
	year = {2002},
	notes = {
		#: Not the "reuters" dataset.
	},
}

@article{b554,
	title = {Collecting the {Internet} {AS}-level Topology},
	author = {Zhang, Beichuan and Liu, Raymond and Massey, Daniel
                  and Zhang, Lixia},
	journal = {SIGCOMM Comput. Commun. Rev.},
	volume = {35},
	number = {1},
	year = {2005},
	pages = {53--61},
	notes = {
		#: The "topology" dataset.
	},
}

@inproceedings{b555,
	title = {Predicting Positive and Negative Links in Online Social
                  Networks},
	author = {Leskovec, Jure and Huttenlocher, Daniel and Kleinberg,
                  Jon},
	booktitle = {Proc. Int. Conf. on World Wide Web},
	year = {2010},
	pages = {641--650},
}

@article{b556,
	title = {The Dynamics of Viral Marketing},
	author = {Jure Leskovec and Lada Adamic and Bernardo
                  A. Huberman},
	journal = {ACM Trans. on the Web},
	year = {2007},
	volume = {1},
	number = {1},
	notes = {The Amazon dataset},
}

@misc{b557,
	title = {Resource Description Framework ({RDF}) Model and
                  Syntax},
	author = {Ora Lassila and Ralph R. Swick},
	year = {1998},
}

@inproceedings{b558,
	title = {Knowledge Driven Dimension Reduction for Clustering},
	author = {Ian Davidson},
	booktitle = {Proc. Int. Conf. on Res. and Dev. in
                  Inf. Retrieval},
	year = {2009},
	pages = {1034--1039},
	notes = {
		#: Clustering points in Euclidean space, with additional
                  positive and negative constraints.
		#: They end up using a matrix D−A where D_ii is the sum
                  of values in a line of A, with the constraint that
                  D_ii >0.  No absolute values are used.  In all
                  examples, A_ii = 1 is used. A is not necessarily
                  sparse.
		#: They compute the lowest eigenvalue/-vector in a
                  generalized eigenvalue problem, similar to the
                  normalized cut algorithm by Shi & Malik.
	},
}

@misc{b559,
	title = {Clustering with Qualitative Information},
	author = {Moses Charikar and Venkatesan Guruswami and Anthony
                  Wirth},
	notes = {
		#: signed clustering.
		#: MaxAgree, MinDisagree.
		#: weighted signed edges.
		#: They reduce it to a linear program in n^2 variables.
	},
}

@inproceedings{b560,
	title = {Measurement and Analysis of Online Social Networks},
	author = {Alan Mislove and Massimiliano Marcon and Krishna
                  P. Gummadi and Peter Druschel and Bobby
                  Bhattacharjee},
	booktitle = {Proc. Internet Measurement Conf.},
	year = {2007},
	notes = {
		#: The IMC 2007 networks.
	},
}

@article{b561,
	title = {Community Structure in Large Networks: Natural Cluster
                  Sizes and the Absence of Large Well-Defined Clusters},
	author = {Jure Leskovec and Kevin J. Lang and Anirban Dasgupta
                  and Michael W. Mahoney},
	journal = {CoRR},
	volume = {abs/0810.1355},
	year = {2008},
	notes = {The web-Google dataset},
}

@misc{b562,
	title = {Graph Sparsification by Effective Resistances},
	author = {Daniel A. Spielman and Nikhil Srivastava},
	notes = {Appriximate Effective Resistance by Random
                  Projections},
}

@misc{b563,
	title = {Completing Wikipedia's Hyperlink Structure through
                  Dimensionality Reduction},
	author = {Robert West and Doina Precup and Joelle Pineau},
	notes = {Link prediction in the Wikipedia hyperlink graph by
                  spectral methods},
}

@inbook{b564,
	chapter = {Graph Kernels by Spectral Transforms},
	title = {Semi-supervised Learning},
	author = {Zhu, Xiaojin and Jaz Kandola and John Lafferty and
                  Zoubin Ghahramani},
	year = {2006},
	publisher = {MIT Press},
	editor = {Olivier Chapelle and Bernhard Schölkopf and Alexander
                  Zien},
	notes = {Spectral transformation of kernels},
}

@inproceedings{b565,
	title = {Social Synchrony: Predicting Mimicry of User Actions in
                  Online Social Media},
	author = {Choudhury, Munmun De and Sundaram, Hari and John,
                  Ajita and Seligmann, Dorée Duncan},
	booktitle = {Proc. Int. Conf. on Comput. Sci. and Engineering},
	year = {2009},
	pages = {151--158},
	notes = { The Digg dataset },
}

@misc{b566,
	title = {Operators for Propagating Trust and their Evaluation in
                  Social Networks},
	author = {Chung-Wei Hang and Yonghong Wang and Munindar
                  P. Singh},
	notes = {They define operators on graphs that can be interpreted
                  as a "graph algebra"},
}

@article{b567,
	title = {The Small-World Problem},
	author = {Stanley Milgram},
	journal = {Psychol. Today},
	volume = {1},
	number = {1},
	year = {1967},
	pages = {61--67},
	notes = { six degrees of separation },
}

@article{b568,
	title = {An Experimental Study of the Small World Problem},
	author = {Jeffrey Travers and Stanley Milgram},
	journal = {Sociometry},
	volume = {32},
	number = {4},
	year = {1969},
	pages = {425--443},
	notes = { six degrees of separation (2) },
}

@article{b569,
	title = {On Random Graphs {I}},
	author = {Paul Erdős and Alfréd Rényi},
	journal = {Publ. Math. Debrecen},
	volume = {6},
	year = {1959},
	pages = {290--297},
	notes = {
		#: The Erdős–Rényi model (main reference)
	},
}

@article{b570,
	title = {Self-similar Community Structure in a Network of Human
                  Interactions},
	author = {Roger Guimerà and Leon Danon and Albert Díaz-Guilera
                  and Francesc Giralt and Alex Arenas},
	journal = {Phys. Rev. E},
	volume = {68},
	number = {6},
	pages = {065103},
	year = {2003},
	notes = {arenas-email dataset},
}

@article{b571,
	title = {Models of Social Networks based on Social Distance
                  Attachment},
	author = {Marián Boguñá and Romualdo Pastor-Satorras and Albert
                  Díaz-Guilera and Alex Arenas},
	journal = {Phys. Rev. E},
	volume = {70},
	number = {5},
	year = {2004},
	pages = {056122},
	notes = {arenas-pgp dataset},
}

@article{b572,
	title = {Community Detection in Complex Networks using Extremal
                  Optimization},
	author = {Jordi Duch and Alex Arenas},
	journal = {Phys. Rev. E},
	volume = {72},
	number = {2},
	pages = {027104},
	year = {2005},
	notes = {arenas-meta dataset},
}

@article{b573,
	title = {Directed Network Modules},
	author = {Gergely Palla and Illés J. Farkas and Péter Pollner
                  and Imre Derényi and Tamás Vicsek},
	journal = {New J. Phys.},
	volume = {9},
	number = {6},
	pages = {186},
	year = {2007},
	notes = {cfinder-google dataset},
}

@inproceedings{b574,
	title = {Relation Prediction in Multi-Relational Domains using
                  Matrix Factorization},
	author = {Christoph Lippert and Stefan Hagen Weber and Yi Huang
                  and Volker Tresp and Matthias Schubert and Hans-Peter
                  Kriegel},
	booktitle = {Proc. Workshop on Struct. Input Struct. Output},
	year = {2008},
	notes = {
		#: Factorization of multirelational matrices.
		#: Multirelational Matrix Factorization (MRMF)
		#: This is a nonnegative factorization, so there are no
                  issues of orthogonality
	},
}

@misc{b575,
	title = {Scalable Proximity Estimation and Link Prediction in
                  Online Social Networks},
	author = {Han Hee Song and Tae Won Cho and Vacha Dave and Yin
                  Zhang and Lili Qiu},
}

@misc{b576,
	title = {Maximum Margin based Semi-supervised Spectral Kernel
                  Learning},
	author = {Zenglin Xu and Jianke Zhu and Michael R. Lyu and Irwin
                  King},
}

@misc{b577,
	title = {The {Laplacian} of a Hypergraph},
	author = {Fan Chung},
}

@misc{b578,
	title = {A Unified View of Matrix Factorization Models},
	author = {Ajit P. Singh and Geoffrey J. Gordon},
}

@misc{b579,
	title = {On Learning Rotations},
	author = {Raman Arora},
}

@misc{b580,
	title = {Clustering with Multiple Graphs},
	author = {Wei Tang and Zhengdong Lu and Inderjit S. Dhillon},
}

@misc{b581,
	title = {{TripleRank}: Ranking Semantic Web Data by Tensor
                  Decomposition},
	author = {Thomas Franz and Antje Schultz and Sergej Sizov and
                  and Steffen Staab},
}

@misc{b582,
	title = {Laws of Graph Evolution: Densification and Shrinking
                  Diameters},
	author = {Jure Leskovec and Jon Kleinberg and Christos
                  Faloutsos},
}

@book{b583,
	title = {Graphs, Dioids and Semirings},
	author = {Gondran, Michel and Minoux, Michel},
	year = {2008},
	publisher = {Springer},
}

@misc{b584,
	title = {On Social Networks and Collaborative Recommendation},
	author = {Ioannis Konstas and Vassilios Stathopoulos and Joemon
                  M Jose},
	notes = {Multirelational block matrix on the user-user and
                  user-song-tag last.fm network},
}

@misc{b585,
	title = {Community Detection in Networks with Positive and
                  Negative Links},
	author = {V.A. Traag and Jeroen Bruggeman},
	notes = {
		#: frustation: the same of "(algebraic) conflict"
		#: signed spectral clustering
	},
}

@misc{b586,
	title = {Analysis of Community Structure in Networks of
                  Correlated Data},
	author = {Sergio Gómez and Pablo Jensen and and Alex Arenas},
	notes = {signed modularity},
}

@misc{b587,
	title = {Spectral Transformation Approaches To Semi-supervised
                  Learning},
	author = {Chonghai Hu and Chengqun Wang and Langsheng Liu},
}

@misc{b588,
	title = {Recommendation as Link Prediction},
	author = {Xin Li and Hsinchun Chen},
}
                  
@misc{b589,
	title = {Link Prediction in Weighted Networks: The Role of Weak
                  Ties},
	author = {Lü, Linyuan and Tao Zhou},
}

@inproceedings{b590,
	title = {Using Friendship Ties and Family Circles for Link
                  Prediction},
	author = {Elena Zheleva and Lise Getoor and Jennifer Golbeck and
                  Ugur Kuter},
	booktitle = {Proc. Workshop on Soc. Netw. Min. and Anal.},
	year = {2008},
	pages = {97--113},
}

@misc{b591,
	title = {A Fixed-Point Method to Compute Similarities in Sparse
                  Response Data},
	author = {Christian Desrosiers and George Karypis},
	notes = {What I would call the "generalized Laplacian".  They
                  solve it in the expected way.},
}

@misc{b592,
	title = {Link Prediction on Evolving Data using Matrix and
                  Tensor Factorizations},
	author = {Evrim Acar and Daniel M. Dunlavy and Tamara G. Kolda},
}

@misc{b593,
	title = {A Survey on Link Prediction Models for Social Network
                  Data},
	author = {Evan Wei Xiang},
}

@article{b594,
	title = {Similarity Index Based on Local Paths for Link
                  Prediction of Complex Networks},
	author = {Lü, Linyuan and Jin, Ci-Hang and Zhou, Tao},
	journal = {Phys. Rev. E},
	volume = {80},
	number = {4},
	pages = {046122},
	year = {2009},
	notes = {Katz index, ...},
}

@misc{b595,
	title = {Recommendations Using Absorbing Random Walks},
	author = {Ajit P. Singh and Asela Gunawardana and Chris Meek and
                  Arun C. Surendran},
	notes = {Birelational hybrid adjacency matrix},
}

@misc{b596,
	title = {Construction of Bipartite and Unipartite Weighted
                  Networks from Collections of Journal Papers},
	author = {Steven A. Morris and Gary G. Yen},
	notes = {Big multirelational adjacency matrix.  Although they
                  seperate papers and referenced papers, instead of
                  using unipartite reference links. },
}

@misc{b597,
	title = {Link Prediction of Social Networks Based on Weighted
                  Proximity Measures},
	author = {Tsuyoshi Murata and Sakiko Moriyasu},
	notes = {Weighted versions of number of common neighbors,
                  Jaccard, etc.},
}

@misc{b598,
	title = {Trustlet, Open Research on Trust Metrics},
	author = {Paolo Massa and Kasper Souren},
}

@misc{b599,
	title = {Trust Metrics in Recommender Systems},
	author = {Paolo Massa and Paolo Avesani},
}

@misc{b600,
	title = {The Time Series Link Prediction Problem with
                  Applications in Communication Surveillance},
	author = {Zan Huang and Dennis K.J. Lin},
}

@misc{b601,
	title = {Graph Mining: An Overview},
	author = {Christian Borgelt},
	notes = {Cites ''spectral transformation''},
}

@article{b602,
	title = {An Experimental Investigation of Graph Kernels on
                  Collaborative Recommendation and Semisupervised
                  Classification},
	author = {François Fouss and Kevin Françoisse and Luh Yen and
                  Alain Pirotte and Marco Saerens},
}

@inproceedings{b603,
	author = {Petrović, Saša and Osborne, Miles and Lavrenko,
                  Victor},
	title = {The {Edinburgh} {Twitter} Corpus},
	booktitle = {Proc. Workshop on Comput. Linguistics in a World of Soc. Media},
	year = {2010},
	pages = {25--26},
	notes = {The twitter-petrovic dataset.},
}

@misc{b604,
	title = {Semantic Network Analysis of Ontologies},
	author = {Bettina Hoser and Andreas Hotho and Robert Jäschke and
                  Christoph Schmitz and Gerd Stumme},
	notes = {They use a complex Hermitian characteristic matrix of
                  the ER graph.  They don't use individual entities and
                  relationships, only entity and relationship types. },
}

@misc{b605,
	title = {Detecting Rich-Club Ordering in Complex Networks},
	author = {V. Colizza and A. Flammini and M. A. Serrano and
                  A. Vespignani},
}

@inproceedings{b606,
	title = {A Comparison of Statistical and Machine Learning
                  Algorithms on the Task of Link Completion},
	author = {Anna Goldenberg and Jeremy Kubica and Paul Komarek},
	booktitle = {Proc. Workshop on Link Anal. for Detecting Complex Behav.},
	year = {2003},
}

@misc{b607,
	title = {Weighted Evolving Networks: Coupling Topology and
                  Weight Dynamics},
	author = {Alain Barrat and Marc Barthélemy and Alessandro
                  Vespignani},
	notes = {"truly" weighted edges (i.e. capacity of a
                  connection)},
}

@article{b608,
	title = {The Architecture of Complex Weighted Networks},
	author = {Alain Barrat and Marc Barthélemy and Romualdo
                  Pastor-Satorras and Alessandro Vespignani},
	journal = {Proc. Natl. Acad. Sci. U.S.A.},
	year = {2004},
	volume = {101},
 	number = {11},
	pages = {3747--3752},
	notes = {Weighted network, equivalent to the previous
                  reference},
}

@misc{b609,
	title = {Modeling the Evolution of Weighted Networks},
	author = {Alain Barrat and Marc Barthélemy and and Alessandro
                  Vespignani},
	notes = {weighted preferential attachment},
}

@misc{b610,
	title = {Some Generalizations of Matrix Commutativity},
	author = {M. P. Drazin},
}

@misc{b611,
	title = {Semi-supervised Classification from Discriminative
                  Random Walks},
	author = {Jérôme Callut and Kevin Françoisse and Marco Saerens
                  and Pierre Dupont},
	notes = {
			Bounded random walks;
			The betweenness centrality using only nodes of a
                  certain label, used for semi-supervised classification
	},
}

@article{b612,
	title = {Empirical Analysis of {Web}-based User-Object Bipartite
                  Networks},
	author = {Ming-Sheng Shang and Linyuan Lü and Yi-Cheng Zhang and
                  Tao Zhou},
	journal = {Europhys. Lett.},
	volume = {90},
	number = {4},
	pages = {48006},
	year = {2010},
	notes = {
		bipartite clustering coefficient;
		bipartite assortativity/dissortativity
	},
}

@misc{b613,
	title = {The Birth of the Giant Component},
	author = {Svante Janson and Donald E. Knuth and Tomasz Luczak
                  and Boris Pittel},
	notes = {The giant connected component of random graphs;
                  connectivity of random graphs},
}

@inproceedings{b614,
	title = {Eigenvectors for Clustering: Unipartite, Bipartite, and
                  Directed Graph Cases},
	author = {Andri Mirzal and Masashi Furukawa},
	booktitle = {Proc. Int. Conf. on Electronics and Inf.
                  Engineering},
	year = {2010},
	pages = {303--309},
}

@misc{b615,
	title = {Pseudo-Random Graphs},
	author = {M. Krivelevich and B. Sudakov},
}

@misc{b616,
	title = {Diffusion Maps, Spectral Clustering and Eigenfunctions
                  of {Fokker}--{Planck} Operators},
	author = {Boaz Nadler and Stéphane Lafon and Ronald. R. Coifman
                  and Ioannis G. Kevrekidis},
}

@misc{b617,
	title = {A Study of Graph Spectra for Comparing Graphs},
	author = {Ping Zhu and Richard C. Wilson},
}

@misc{b618,
	title = {Graph and Semigroup Homomorphisms on Networks of
                  Relations},
	author = {Douglas R. White and Karl P. Reitz},
}

@article{b619,
	title = {Overview of the 2003 {KDD} {Cup}},
	author = {Johannes Gehrke and Paul Ginsparg and Jon Kleinberg},
	journal = {SIGKDD Explorations},
	volume = {5},
	number = {2},
	year = {2003},
	pages = {149--151},
	notes = {
		hep-th-citations dataset
	},
}

@misc{b620,
	title = {Mining Communities in Networks: A Solution for
                  Consistency and Its Evaluation},
	author = {Haewoon Kwak and Yoonchan Choi and Young-Ho Eom and
                  Hawoong Jeong and Sue Moon},
	notes = {uses the cyworld dataset},
}

@misc{b621,
	title = {Detecting Commmunities via Simultaneous Clustering of
                  Graphs and Folksonomies},
	author = {Akshay Java and Anupam Joshi and Tim Finin},
	notes = {
		#: Decomposition of an aggregate block matrix on the
                  entity types {document, tag} and the relationship
                  types link (document×document) and has-tag
                  (document×tag).
	},
}

@inproceedings{b622,
	title = {Clustering by Weighted Cuts in Directed Graphs},
	author = {Marina Meilă and William Pentney},
	booktitle = {Proc. SIAM Int. Conf. on Data Min.},
	year = {2007},
}

@misc{b623,
	title = {Clustering on Complex Graphs},
	author = {Bo Long, Mark Zhang, Philip S. Yu, Tianbing Xu},
	notes = {here, a complex graph has multiple edge types},
}

@book{b624,
	title = {The Geometry of Information Retrieval},
	author = {Keith van Rijsbergen},
	publisher = {Cambridge Univ. Press},
	year = {2004},
	notes = {
		#: a quantum model.
	},
}

@misc{b625,
	title = {Empirical Comparison of Algorithms for Network
                  Community Detection},
	author = {Jure Leskovec and Kevin J. Lang and Michael
                  W. Mahoney},
}

@misc{b626,
	title = {Applying Latent Dirichlet Allocation to Group Discovery
                  in Large Graphs},
	author = {Keith Henderson and Tina Eliassi-Rad},
	notes = {LDA on the adjacency matrix},
}

@misc{b627,
	title = {Large Human Communication Networks: Patterns and a
                  Utility-Driven Generator},
	author = {Nan Du and Christos Faloutsos and Bai Wang and Leman
                  Akoglu},
	notes = {
		#:clique power-law
		#: unipartite networks with multiple edges over time
	},
}

@misc{b628,
	title = {Laplacian Eigenmaps for Dimensionality Reduction and
                  Data Representation},
	author = {Mikhail Belkin and Partha Niyogi},
	notes = {
		Take the "Gauss graph" of a set of points and then use
                  its normalized Laplacian eigenvectors for clustering
	}
}

@inproceedings{b629,
	title = {How Does the Data Sampling Strategy Impact the
                  Discovery of Information Diffusion in Social Media?},
	author = {Choudhury, Munmun De and Yu-Ru Lin and Hari Sundaram
                  and Candan, K. Selçuk and Lexing Xie and Aisling
                  Kelliher},
	booktitle = {Proc. Int. Conf. on Weblogs and Soc. Media},
	year = {2010},
	pages = {34--41},
	notes = {The munmun Twitter dataset},
}

@misc{b630,
	title = {Finding Alternative Clusterings Using Constraints},
	author = {Ian Davidson and Zijie Qi},
	notes = {Finding a modified clustering that takes into account
                  must-link and cannot-link information},
}

@misc{b631,
	title = {Finding Structure in Heterogeneous Networks},
	author = {Rumi Ghosh and Kristina Lerman},
	notes = {von Neumann kernel in multirelational networks},
}

@article{b632,
	title = {Das asymptotische {Verteilungsgesetz} der {Eigenwerte}
                  linearer partieller {Differenzialgleichungen} (mit
                  einer {Anwendung} auf die {Theorie} der
                  {Hohlraumstrahlung})},
	author = {Hermann Weyl},
	journal = {Math. Ann.},
	year = {1912},
	volume = {71},
	number = {4},
	pages = {441--479},
}

@article{b633,
	title = {Perturbation Bounds in Connection with Singular Value
                  Decomposition},
	author = {Per-{\AA}ke Wedin},
	journal = {BIT Numerical Math.},
	year = {1972},
	volume = {12},
	number = {1},
	pages = {99--111},
}

@article{b634,
	title = {The Sum-over-Paths Covariance Kernel: A Novel
                  Covariance Measure between Nodes of a Directed Graph},
	author = {Amin Mantrach and Luh Yen and Jérôme Callut and Kevin
                  Françoisse and Masashi Shimbo and Marco Saerens},
	journal = {IEEE Trans. on Pattern Anal. and Mach. Intell.},
	year = {2010},
	volume = {32},
	number = {6},
	pages = {1112--1126},
	notes = {
#: They use a cost matrix C, whose entries are the inverse of the
                  adjacency matrix: C_ij = A_ij^-1.  Costs are additive
                  along the edges of a path.
#: They use a rational spectral transformation of a matrix '''W''' which
                  is not symmetric and which is derived from statistical
                  arguments.
	},
}

@misc{b635,
	title = {RQL: A Query Language for Recommender Systems},
	author = {Gediminas Adomavicius and Alexander Tuzhilin and Rong
                  Zheng},
}

@inproceedings{b636,
	author = {Liu, Wei and Qian, Buyue and Cui, Jingyu and Liu,
                  Jianzhuang},
	title = {Spectral Kernel Learning for Semi-supervised
                  Classification},
	booktitle = {Proc. Int. Jt. Conf. on Artif. Intell.},
	year = {2009},
	pages = {1150--1155},
}

@misc{b637,
	title = {The TOPHITS Model for Higher-Order Web Link Analysis},
	author = {Tamara Kolda and Brett Bader},
	notes = {Decomposing the webpage-webpage-term tensor that
                  contains a 1-entry (i,j,w) when webpage i links to j
                  using word w},
}

@misc{b638,
	title = {Higher-Order Web Link Analysis Using Multilinear
                  Algebra},
	author = {Tamara G. Kolda and Brett W. Bader and Joseph
                  P. Kenny},
	notes = {TOPHITS},
}

@misc{b639,
	title = {Models for Longitudinal Network Data},
	author = {Tom A. B. Snijders},
	notes = {Stochastic models for continuous network evolution.
                  Markov Chains.  I don't really understand the idea},
}

@misc{b640,
	title = {The Worldwide Air Transportation Network: Anomalous
                  Centrality, Community Structure, and Cities' Global
                  Roles},
	author = {R. Guimerà, S. Mossa, A. Turtschi, and
                  L. A. N. Amaral},
}

@article{b641,
	title = {Modularity from Fluctuations in Random Graphs and
                  Complex Networks},
	author = {Guimerà, Roger and Sales-Pardo, Marta and Amaral, Luís
                  A. Nunes},
	journal = {Phys. Rev. E},
	volume = {70},
	number = {2},
	pages = {025101},
	year = {2004},
	notes = {Modularity is observed in Erdős–Rényi random graphs},
}

@inproceedings{b642,
	author = {Sören Auer and Christian Bizer and Georgi Kobilarov
                  and Jens Lehmann and Richard Cyganiak and Zachary
                  Ives},
	title = {{DBpedia}: A Nucleus for a Web of Open Data },
	booktitle = {Proc. Int. Semant. Web Conf.},
	pages = {722--735},
	year = {2008},
	notes = {the DBpedia dataset},
}

@misc{b643,
	title = {Which graphs are determined by their spectrum?},
	author = {Edwin R. van Dam, Willem H. Haemers},
	notes = { #cospectral },
}

@inproceedings{b644,
	title = {A Novel Way of Computing Dissimilarities between Nodes
                  of a Graph, with Application to Collaborative
                  Filtering and Subspace Projection of the Graph Nodes},
	author = {François Fouss and Alain Pirotte and Jean-Michel
                  Renders and Marco Saerens},
	booktitle = {Proc. Eur. Conf. on Mach. Learn.},
	year = {2004},
	pages = {26--37},
	notes = {published version of [154]},
}

@article{b645,
	author = {Lewis, David D. and Yang, Yiming and Rose, Tony G. and
                  Li, Fan},
	title = {{RCV1}: A New Benchmark Collection for Text
                  Categorization Research},
	journal = {J. Mach. Learn. Res.},
	year = {2004},
	volume = {5},
	pages = {361--397},
	notes = {The "reuters" dataset},
}

@book{b646,
	title = {Spectra of Graphs},
	author = {Andries E. Brouwer and Willem H. Haemers},
	publisher = {Springer},
	year = {2012},	
	notes = {Spectral graph theory and much more},
}

@article{b647,
	title = {Signed Graphs},
	author = {Thomas Zaslavsky},
	journal = {Discrete Appl. Math.},
	volume = {4},
	year = {1982},
	pages = {47--74},
}

@book{b648,
	title = {Geometry of {Lie} Groups},
	author = {Boris Rosenfeld},
	year = {1997},
	publisher = {Kluwer Academic Publishers},
	notes = {split-complex numbers},
}

@article{b649,
	title = {Hyperbolic Complex Structures in Physics},
	author = {Joseph Hucks},
	journal = {J. Math. Phys.},
	volume = {34},
	number = {12},
	year = {1993},
	pages = {5986--6008},
	notes = {split-complex numbers},
}

@article{b650,
	title = {Preliminary Sketch of Quaternions},
	author = {William K. Clifford},
	journal = {Proc. London Math. Soc.},
	year = {1873},
	volume = {4},
	number= {1},
	pages = {381--395},
	notes = {split-complex numbers},
}

@article{b651,
	title = {On Products and Line Graphs of Signed Graphs, their
                  Eigenvalues and Energy},
	author = {Germina, K. A. and Hameed K., Shahul and Thomas
                  Zaslavsky},
	journal = {Linear Algebra and Its Appl.},
	year = {2011},
	volume = {435},
	number = {10},
	pages = {2432--2450},
	notes = {The rank of the signed Laplacian.},
}

@article{b652,
	title = {Algebraic Connectivity of Graphs},
	author = {Miroslav Fiedler},
	journal = {Czechoslov. Math. J.},
	volume = {23},
	number = {98},
	pages = {298--305},
	year = {1973},
	notes = {The Fiedler vector; algebraic connectivity},
}

@misc{b653,
	title = {Temporal Link Prediction using Matrix and Tensor
                  Factorizations},
	author = {Daniel M. Dunlavy, Tamara G. Kolda, Evrim Acar},
}

@article{b654,
	title = {Commute Times for a Directed Graph using an Asymmetric
                  {Laplacian}},
	author = {Daniel Boley and Gyan Ranjan and Zhang, Zhi-Li},
	journal = {Linear Algebra and Its Appl.},
	volume = {435},
	pages = {224--242},
	year = {2011},
}

@misc{b655,
	title = {Temporal Collaborative Filtering with Bayesian
                  Probabilistic Tensor Factorization},
	author = {Liang Xiong, Xi Chen, Tzu-Kuo Huang, Jeff Schneider,
                  Jaime G. Carbonell},
}

@misc{b656,
	title = {On the equivalence between Non-negative Matrix
                  Factorization and Probabilistic Latent Semantic
                  Indexing},
	author = {Chris Ding, Tao Li, Wei Peng},
}

@inproceedings{b657,
	title = {Nonparametric Transforms of Graph Kernels for
                  Semi-Supervised Learning},
	author = {Xiaojin Zhu and Jaz Kandola and Zoubin Ghahramani and
                  John Lafferty},
	booktitle = {Advances in Neural Inf. Process. Syst.},
	year = {2005},
	_pages = {},
}

@article{b658,
	title = {Zur {Theorie} der {Matrices}},
	author = {Oskar Perron},
	journal = {Math. Ann.},
	volume = {64},
	number = {2},
	pages = {248--263},
	year = {1907},
	notes = {Perron--Frobenius theorem},
}

@article{b659,
	title = {Power and Centrality: A Family of Measures},
	author = {Phillip Bonacich},
	journal = {Am. J. of Sociology},
	volume = {92},
	number = {5},
	year = {1987},
	pages = {1170--1182},
	notes = {eigenvector centrality},
}

@misc{b660,
	title = {An Eigendecomposition Updating Algorithm for Large
                  {Hermitian} Matrices under Low Rank Perturbations},
	author = {Martin J. Gander},
}

@article{b661,
	title = {Calculating Status with Negative Relations},
	author = {Phillip Bonacich and Paulette Lloyd},
	journal = {Soc. Netw.},
	number = {26},
	year = {2004},
	pages = {331--338},
	notes = {The dominant eigenvector of '''A''' for signed graphs},
}

@book{b662,
	title = {The Art of Doing Science and Engineering: Learning to
                  Learn},
	author = {Richard W. Hamming},
	year = {1997},
	publisher = {Taylor \& Francis},
}

@book{b663,
	title = {The Algebraic Eigenvalue Problem},
	author = {James H. Wilkinson},
	year = {1965},
	publisher = {Oxford Univ. Press},
	notes = {Perturbation theory for the eigenvalue decomposition},
}

@book{b664,
	title = {Matrix Analysis and Applied Linear Algebra},
	author = {Carl D. Meyer},
	year = {2000},
	publisher = {SIAM},
	notes = {Neumann series},
}

@article{b665,
	title = {{Reality} {Mining}: Sensing Complex Social Systems},
	author = {Eagle, Nathan and Pentland, Alex (Sandy)},
	journal = {Personal Ubiquitous Comput.},
	volume = {10},
	number = {4},
	year = {2006},
	pages = {255--268},
	notes = {The "mit" dataset},
}

@article{b666,
	title = {The Hyperbolic Number Plane},
	author = {Garret Sobczyk},
	journal = {The Coll. Math. J.},
	volume = {26},
	year = {1995},
	pages = {268--280},
	notes = {split-complex numbers},
}

@article{b667,
	title = {Coverings of Bipartite Graphs},
	author = {Andrew Dulmage and Nathan Mendelsohn},
	journal = {Canadian J. Math.},
	volume = {10},
	year = {1958},
	pages = {517--534},
	notes = {bipartite double cover},
}

@book{b668,
	title = {Topics in Matrix Analysis},
	author = {Roger A. Horn and Charles R. Johnson},
	publisher = {Cambridge Univ. Press},
	year = {1994},
	notes = {mentions the matrix hyperbolic sine},
}

@misc{b669,
	title = {Algebraic Models for Social Networks},
	author = {Philippa Pattison},
}

@inproceedings{b670,
	title = {New Perspectives and Methods in Link Prediction},
	author = {Ryan N. Lichtenwalter and Jake T. Lussier and Nitesh
                  V. Chawla},
 	booktitle = {Proc. Int. Conf. on Knowl. Discov. and Data Min.},
	year = {2010},
	pages = {243--252},
	notes = {link prediction using regression on simple features of
                  nodes, e.g. in-degree, out-degree, common neighbors,
                  etc.}
}

@article{b671,
	title = {Statistical-mechanical Approach to Subgraph Centrality
                  in Complex Networks},
	author = {Ernesto Estrada and Naomichi Hatano},
	journal = {Chemical Phys. Lett.},
	volume = {439},
	number = {1--3},
	pages = {247--251},
	year = {2007},
	notes = {"estrada entropy" of a network},
}

@inproceedings{b672,
	title = {On the Eigenvalue Power Law},
	author = {Milena Mihail and Christos H. Papadimitriou},
	booktitle = {Proc. Int. Workshop on Randomization and
                  Approximation Techniques},
	year = {2002},
	pages = {254--262},
}

@article{b673,
	title = {Controllability of Complex Networks},
	author = {Yang-Yu Liu and Jean-Jacques Slotine and Albert-László
                  Barabási},
	journal = {Nature},
	volume = {473},
	pages = {167--173},
	year = {2011},
	month = {May},
}

@article{b674,
	title = {Eigenvector-like Measures of Centrality for Asymmetric
                  Relations},
	author = {Phillip Bonacich, Paulette Lloyd},
	journal = {Soc. Netw.},
	year = {2001},
	volume = {23},
	pages = {191--201},
}

@misc{b675,
	title = {Uncovering Organizational Hierarchies},
	author = {Linton C. Feeman},
	notes = {SVD of a skew-symmetric adjacency matrix},
}

@article{b676,
	title = {Link Prediction in Complex Networks: A Survey},
	author = {Lü, Linyuan and Zhou, Tao},
	volume={390},
        number={6},
        journal={Physica A},
        year={2011},
        pages={1150--1170},
}

@misc{b677,
	title = {Mining Association Rules in Folksonomies},
	author = {Christoph Schmitz, Andreas Hotho, Robert Jäschke, Gerd
                  Stumme},
	notes = {18 ways of projecting a folksonomy onto two
                  dimensions},

}

@inproceedings{b678,
	title = {Temporal Analysis of Semantic Graphs using {ASALSAN}},
	author = {Brett W. Bader and Richard A. Harshman and Tamara
                  G. Kolda},
	booktitle = {Proc. Int. Conf. on Data Min.},
	year = {2007},
	pages = {33--42},
}

@inproceedings{b679,
	title = {Models for Analysis of Asymmetrical Relationships Among
                  $N$ Objects or Stimuli},
	author = {Richard A. Harshman},
	booktitle = {Proc. First Meeting of the Psychometric Soc. and
                  the Soc. for Math. Psychol.},
	year = {1978},
}

@misc{b680,
	title = {Network `Small-World-Ness': A Quantitative Method for
                  Determining Canonical Network Equivalence},
	author = {Mark D. Humphries, Kevin Gurney},
	notes = {A numerical statistic measuring the ''small-worldness''
                  of a network.},
}

@incollection{b681,
	title = {A New Measure of Heterogeneity of Complex Networks
                  Based on Degree Sequence},
	author = {Jun Wu and Yue-Jin Tan and Hong-Zhong Deng and Da-Zhi
                  Zhu},
	booktitle = {Unifying Themes in Complex Systems},
	pages = {66--73},
	year = {2010},
	notes = {The entropy of a scale-free network.},
}

@misc{b682,
	title = {A General Algorithm to fit constrained DEDICOM Models},
	author = {Roberto Rocci},
}

@incollection{b683,
	title = {Multidimensional Analysis of Preference Structures},
	author = {Richard A. Harshman and Margaret E. Lundy},
	year = {1990},
	booktitle = {Contributions to Economic Anal.},
	editor = {M. H. Shugard and D. S. Sibley},
	volume = {187},
	pages = {185--204},
	notes = {DEDICOM for skew-symmetric matrices (this is redundant
                  since skew-symmetric matrices are normal)},
}

@article{b684,
	title = {A Generalization of {Takane}'s Algorithm for
                  {DEDICOM}},
	author = {Kliers, Henk A. L. and ten Berge, Jos M. F. and
                  Takane, Yoshio and de Leeuw, Jan},
	journal = {Psychometrika},
	volume = {55},
	number = {1},
	pages = {151--158},
	year = {1990},
}

@misc{b685,
	title = {Diagonal Estimation in DEDICOM},
	author = {Takane, Y.},
	booktitle = {Proc. of the 1985 Ann. Meeting of the Behaviormetric Soc.},
	year = {1985},
	pages = {100--101},
}

@article{b686,
	title = {A Model for the Analysis of Asymmetric Data in
                  Marketing Research},
	author = {Richard A. Harshman and Paul E. Green and Yoram Wind
                  and Margaret E. Lundy},
	journal = {Marketing Sci.},
	volume = {1},
	number = {2},
	year = {1982},
	pages = {205-242},
	notes = {DEDICOM},
}

@article{b687,
	title = {Algorithms for {DEDICOM}: Acceleration, Deceleration,
                  or Neither?},
	author = {Takane, Yoshio and Zhang, Zhidong},
	journal = {J. of Chemometrics},
	year = {2009},
	volume = {23},
	pages = {364--370},
}

@article{b688,
	title = {An Alternating Least Squares Algorithm for Fitting the
                  Two- and Three-way {DEDICOM} Model and the {IDIOSCAL}
                  Model},
	author = {Henk A. L. Kliers},
	journal = {Psychometrika},
	volume = {54},
	number = {3},
	pages = {515--521},
	year = {1989},
}

@misc{b689,
	title = {Eigenspectral Analysis of Hermitian Adjacency Matrices
                  for the Analysis of Group Substructures},
	author = {Bettina Hoser, Andreas Geyer-Schulz},
}

@misc{b690,
	title = {Fast and Scalable Algorithms for Semi-supervised Link
                  Prediction on Static and Dynamic Graphs},
	author = {Rudy Raymond and Hisashi Kashima},
	notes = {
		#: Really interesting but I don't get it.  Uses both the
                  Kronecker product and the Kronecker sum.
	},
}

@misc{b691,
	title = {{Hilbert} Space Theory in Psychology},
	author = {Naohito Chino},
}

@misc{b692,
	title = {Heterogeneity in Oscillator Networks: Are Smaller Worlds
                  Easier to Synchronize?},
	author = {Takashi Nishikawa and Adilson E. Motter and Ying-Cheng
                  Lai and Frank C. Hoppensteadt},
}

@article{b693,
	title = {Entropy Optimization of Scale-free Networks Robustness
                  to Random Failures},
	author = {Bing Wang and Huanwen Tang and Chonghui Guo and
                  Zhilong Xiu},
	journal = {Physica A},
	volume = {363},
	number = {2},
	year = {2006},
	pages = {591--596},
}

@misc{b694,
	title = {Information Theory of Complex Networks: On Evolution
                  and Architectural Constraints},
	author = {Rocard V. Solé and Sergi Valverde},
}

@misc{b695,
	title = {A Recurrence among the Elements of Functions of
                  Triangular Matrices},
	author = {B. N. Parlett},
	notes = {computation of the Schur decomposition.},
}

@misc{b696,
	title = {Drawing Directed Graphs Clockwise},
	author = {Christian Pich},
	notes = {using the skew-symmetric adjacency matrix},
}

@inproceedings{b697,
	title = {Bowling Alone and Trust Decline in Social Network
                  Sites},
	author = {Paolo Massa and Martino Salvetti and Danilo Tomasoni},
	booktitle = {Proc. Int. Conf. Dependable, Auton. and Secure Comput.},
	year = {2009},
	pages = {658--663},
	notes = {advogato dataset},
}

@book{b698,
	title = {Manuale di economia politica con una introduzione alla
                  scienza sociale (Manual of Political Economy)},
	author = {Vilfredo Pareto},
	year = {1919},
	publisher = {Milano : Societa Editrice Libraria},
}

@book{b699,
	title = {Foundations of Statistical Natural Language
                  Processing},
	author = {Christopher D. Manning and Hinrich Schütze},
	year = {1999},
	publisher = {MIT Press},
}

@inproceedings{b700,
	title = {Structure and Evolution of Online Social Networks},
	author = {Kumar, Ravi and Novak, Jasmine and Tomkins, Andrew},
 	booktitle = {Proc. Int. Conf. on Knowl. Discov. and Data Min.},
	year = {2006},
	pages = {611--617},
	notes = {
		The density of a network first increases, then
                  decreases, then increases again.
	}
}

@article{b701,
	author = {Fan Chung and Ron Graham},
	title = {Quasi-random Graphs with Given Degree Sequences},
	journal = {Random Struct. Algorithms},
	volume = {32},
	number = {1},
	year = {2008},
	pages = {1--19},
}

@book{b702,
	title = {Measuring Inequality: A Methodological Handbook},
	author = {Philip B. Coulter},
	publisher = {Westview Press},
	year = {1989},
	notes = {
		Hoover index.
	},
}

@article{b703,
	title = {Convex Non-negative Matrix Factorization for Massive
                  Datasets},
	author = {Christian Thurau and Kristian Kersting and Mirwaes
                  Wahabzada and Christian Bauckhage},
	journal = {Knowl. and Inf. Syst.},
	year = {2011},
	volume = {29},
	number = {2},
	pages = {457--478},
}

@article{b704,
	title = {Temporal Relation Co-clustering on Directional Social
                  Network and Author-Topic Evolution},
	author = {Wei Peng and Tao Li},
	journal = {Knowl. and Inf. Syst.},
	year = {2011},
	volume = {26},
	number = {3},
	pages = {467--486},
}

@article{b705,
	title = {A General Framework for Relation Graph Clustering},
	author = {Bo Long and Zhongfei Zhang and Philip S. Yu},
	journal = {Knowl. and Inf. Syst.},
	year = {2010},
	volume = {24},
	number = {3},
	pages = {393--413},
}

@misc{b706,
	title = {Periodic Subgraph Mining in Dynamic Networks},
	author = {Mayank Lahiri and Tanya Y. Berger-Wolf},
}

@article{b707,
	title = {On Certain Functions Resembling Quaternions, and On a
                  New Imaginary in Algebra},
	author = {James Cockle},
	journal = {Philos. Mag.},
	volume = {33},
	number = {3},
	pages = {435--439},
	year = {1848},
	notes = {First reference for split-complex numbers.},
}

@misc{b708,
	title = {{HyperANF}: Approximating the Neighbourhood Function of
                  Very Large Graphs on a Budget},
	author = {Paolo Boldi and Marco Rosa and Sebastiano Vigna},
	notes = {SPID statistic},
}

@misc{b709,
	title = {{Connes'} Distance Function for Commutative and
                  Noncommutative Graphs},
	author = {Thomas Filk},
	notes = {Found by Jörg Fliege},
}

@inproceedings{b710,
	title = {Fast Counting of Triangles in Large Real Networks
                  without Counting: Algorithms and Laws},
	author = {C. E. Tsourakakis},
	booktitle = {Proc. Int. Conf. on Data Min.},
	year = {2008},
	pages = {608--617},
}

@inproceedings{b711,
	title = {Four Degrees of Separation},
	author = {Lars Backstrom and Paolo Boldi and Marco Rosa and
                  Johan Ugander and Sebastiano Vigna},
	booktitle = {Proc. Web Sci. Conf.},
	year = {2012},
	pages = {45--54},
}

@inproceedings{b712,
	title = {Tracing the Birth of an {OSN}: Social Graph and Profile
                  Analysis in {Google+}},
	author = {Doris Schiöberg and Fabian Schneider and Harald
                  Schiöberg and Stefan Schmid and Steve Uhlig and Anja
                  Feldmann},
	booktitle = {Proc. Web Sci. Conf.},
	year = {2012},
}

@inproceedings{b713,
	author = {Paolo Boldi and Sebastiano Vigna},
	title = {The {WebGraph} Framework {I}: Compression Techniques},
	year = {2004},
	booktitle = {Proc. Int. World Wide Web Conf.},
	pages = {595--601},
}

@inproceedings{b714,
	title = {Friend or Frenemy? Predicting Signed Ties in Social
                  Networks},
	author = {Shuang Hong Yang and Alex Smola and Bo Long and
                  Hongyuan Zha and Yi Chang},
	booktitle = {Proc. Int. Conf. on Res. and Dev. in
                  Inf. Retrieval},
	year = {2012},
	pages = {555--564},
}

@article{b715,
	title = {The Strength of Weak Ties},
	author = {Mark Granovetter},
	journal = {American J. of Sociology},
	year = {1985},
	volume = {91},
	pages = {481--510},
}

@inproceedings{b716,
	author = {Ko, Youngjoong},
	title = {A Study of Term Weighting Schemes Using Class
                  Information for Text Classification},
	booktitle = {Proc. Int. Conf. on Res. and Dev. in
                  Inf. Retrieval},
	year = {2012},
	pages = {1029--1030},
	notes = {Survey of bag-of-words variants},
}

@article{b717,
	title = {Identifying Document Topics Using the {Wikipedia}
                  Category Network},
	author = {Peter Schönhofen},
	journal = {Web Intell. and Agent Syst.},
	volume = {7},
	number = {2},
	year = {2009},
	pages = {195--207},
}

@article{b718,
	title = {Cycles and Clustering in Bipartite Networks},
	author = {Pedro G. Lind and Marta C. González and Hans
                  J. Herrmann},
	journal = {Phys. Rev. E},
	volume = {72},
	year = {2005},
	pages = {056127},
}

@article{b719,
	title = {The Web of {Human} Sexual Contact},
	author = {Fredrik Liljeros and Christofer R. Edling and Luís
                  A. Nunes Amaral and H. Eugene Stanley and Yvonne
                  Åberg},
	journal = {Nature},
	month = {June},
	year = {2001},
	pages = {907--908},
	volume = {411},
}

@article{b720,
	title = {The Large-scale Organization of Metabolic Networks},
	author = {H. Jeong and B. Tombor and Réka Albert and
                  Z. N. Oltvai and Albert-László Barabási},
	journal = {Nature},
	month = {October},
	number = {407},
	year = {2000},
	pages = {651--654},
}

@article{b721,
	title = {Model and Empirical Study on Some Collaboration
                  Networks},
	author = {Zhang, Pei-Pei and Chen, Kan and He, Yue and Zhou, Tao
                  and Su, Bei-Bei and Jin, Yingdi and Chang, Hui and
                  Zhou, Yue-Ping and Sun, Li-Cheng and Wang, Bing-Hong
                  and He, Da-Ren},
        journal={Physica A},
	volume = {360},
	pages = {599--616},
	year = {2006},
}

@article{b722,
	title = {Correlations in Bipartite Collaboration Networks},
	author = {Matti Peltomäki and Mikko Alava},
	journal = {J. Stat. Mech.},
	volume = {1},
	year = {2006},
	pages = {P01010},
}

@article{b723,
	title = {Self-organization of Collaboration Networks},
	author = {José J. Ramasco and S. N. Dorogovtsev and Romualdo
                  Pastor-Satorras},
	journal = {Phys. Rev. E},
	volume = {70},
	number = {3},
	year = {2004},
	pages = {036106},
}

@article{b724,
	title = {Complex Network Study of {Brazilian} Soccer Players},
	author = {Roberto N. Onody and Paulo A. de Castro},
	journal = {Phys. Rev. E},
	volume = {70},
	number = {3},
	year = {2004},
	pages = {037103},
}

@article{b725,
	title = {Bipartite Structure of \emph{all} Complex Networks},
	author = {Guillaume, Jean-Loup and Latapy, Matthieu},
	journal = {Inf. Process. Lett.},
	volume = {90},
	number = {5},
	year = {2004},
	pages = {215--221},
}

@inproceedings{b726,
    author = {Bruce W. Herr and Weimao Ke and Elisha Hardy and Katy
                  Börner},
    title = {Movies and Actors: Mapping the {Internet} {Movie}
                  {Database}},
    booktitle = {Proc. Int. Conf. Inf. Visualization},
    year = {2007},
    pages = {465--469},
}

@article{b727,
	title = {Collaborative Filtering Based on Multi-channel
                  Diffusion},
	author = {Ming-Sheng Shang and Ci-Hang Jin and Tao Zhou and
                  Yi-Cheng Zhang},
        journal = {Physica A},
	volume = {388},
	number = {23},
	year = {2009},
	pages = {4867--4871},
}
                  
@inproceedings{b728,
	title = {Nice Drawings for Planar Bipartite Graphs},
	author = {Ulrich Fößmeier and Michael Kaufmann},
	booktitle = {Proc. Italian Conf. on Algorithms and Complexity},
	year = {1997},
	pages = {122--134},
}

@inproceedings{b729,
	title = {Crossing Minimization Problems of Drawing Bipartite
                  Graphs in Two Clusters},
	author = {Lanbo Zheng and Le Song and Peter Eades},
	booktitle = {Proc. Asia-Pacific Symp. on Inf.
                  Visualisation},
	year = {2005},
	pages = {33--37},
}

@inproceedings{b730,
	title = {Optimizing a Radial Layout of Bipartite Graphs for a
                  Tool Visualizing Security Alerts},
	author = {Dumas, Maxime and McGuffin, Michael J. and Robert,
                  Jean-Marc and Willig, Marie-Claire},
	booktitle = {Proc. Int. Conf. on Graph Drawing},
	year = {2012},
	pages = {203--214},
}

@article{b731,
	title = {Bipartite Producer-Consumer Networks and the Size
                  Distribution of Firms},
	author = {Wang Dahui and Zhou Li and Di Zengru},
        journal = {Physica A},
	volume = {363},
	number = {2},
	year = {2006},
	pages = {359--366},
}

@article{b732,
	title = {Triadic Closure in Two-mode Networks: Redefining the
                  Global and Local Clustering Coefficients},
	author = {Tore Opsahl},
	journal = {Soc. Netw.},
	volume = {34},
	year = {2012},
}

@article{b733,
	title = {An Evolving Model of Online Bipartite Networks},
	author = {Zhang, Chu-xu and Zi-Ke Zhang},
	year = {2012},
	eprint = {arXiv/1209.6217},
}

@article{b734,
	title = {Hidden Variables in Bipartite Networks},
	author = {Maksim Kitsak and Dmitri Krioukov},
	journal = {Phys. Rev. E},
	volume = {84},
	pages = {026114},
	year = {2011},
}

@article{b735,
	title = {Empirical Analysis and Evolving Model of Bipartite
                  Networks},
	author = {Peng Zhang and Menghui Li and J.F.F. Mendes and Zengru
                  Di and Ying Fan},
	year = {2008},
	eprint = {arXiv/0804.3854},
}

@article{b736,
	title = {Random Graph Models of Social Networks},
	author = {M. E. J. Newman and D. J. Watts and S. H. Strogatz},
	journal = {Proc. Natl. Acad. Sci. U.S.A.},
	year = {2002},
	volume = {99},
	pages = {2566--2572},
	notes = {
		both unipartite and bipartite network models;
		can model networks with any given degree distribution;
	}
}

@article{b737,
	title = {Biology Helps to Construct Weighted Scale-free
                  Networks},
	author = {Abolfazl Ramezanpour},
	journal = {Europhys. Lett.},
	volume = {68},
	number = {2},
	pages = {316--322},
	year = {2004},
}

@article{b738,
	title = {A Group-based {Yule} Model for Bipartite Author-Paper
                  Networks},
	author = {Michel L. Goldstein and Steven A. Morris and Gary
                  G. Yen},
	journal = {Phys. Rev. E},
	volume = {71},
	number = {2},
	pages = {026108},
	year = {2005},
}

@article{b739,
	title = {Generation of Complex Bipartite Graphs by Using a
                  Preferential Rewiring Process},
	author = {Jun Ohkubo and Kazuyuki Tanaka and Tsuyoshi
                  Horiguchi},
	journal = {Phys. Rev. E},
	volume = {72},
	number = {3},
	pages = {036120},
	year = {2005},
}

@techreport{b740,
	title = {A Quantitative Measure of Fairness and Discrimination
                  for Resource Allocation in Shared Computer System},
	author = {Raj Jain and D. Chiu and W. Hawe},
	institution = {DEC Research},
	number = {301},
	year = {1984},
}

@article{b741,
	title = {The Information Approach to Demand Analysis},
	author = {Henri Theil},
	journal = {Econometrica},
	volume = {33},
	number = {1},
	year = {1965},
	pages = {67--87},
	notes = {the Theil index},
}

@article{b742,
	title = {On the Measurement of Inequality},
	author = {Atkinson, Anthony B.},
	journal = {J. Economic Theory},
	volume = {2},
	number = {3},
	year = {1970},
	pages = {244--263},
	notes = {The Atkinson index},
}

@article{b743,
    title = {Control Centrality and Hierarchical Structure in Complex
                  Networks},
    author = {Liu, Yang-Yu AND Slotine, Jean-Jacques AND Barabási,
                  Albert-László},
    journal = {PLoS ONE},
    publisher = {Public Library of Science},
    year = {2012},
    volume = {7},
    pages = {e44459},
    number = {9},
}

@article{b744,
	author = {Henry B. Mann},
	title = {Nonparametric Tests against Trend},
	journal = {Econometrica},
	volume = {13},
	number = {3},
	year = {1945},
	pages = {245--259},
}

@book{b745,
	title = {{Google}'s {PageRank} and Beyond},
	author = {Amy N. Langville and Carl D. Meyer},
	publisher = {Princeton Univ. Press},
	year = {2006},
}

@inproceedings{b746,
author = {Lampe, Cliff and Resnick, Paul},
	title = {{Slash(dot)} and Burn: Distributed Moderation in a
                  Large Online Conversation Space},
	booktitle = {Proc. Int. Conf. on Human Factors in Comput. Syst.},
	year = {2004},
	pages = {543--550},
}

@article{b747,
	title = {The Powerful Law of the Power Law and Other Myths in
                  Network Biology},
	author = {Gipsi Lima-Mendez and Jacques Van Helden},
	journal = {Molecular Biosystems},
	year = {2009},
	number = {5},
	volume = {12},
	pages = {1482--1493},
}

@book{b748,
	title = {Graph Theory with Applications},
	year = {1976},
	author = {John Adrian Bondy and U. S. R. Murty},
	publisher = {American Elsevier Pub. Co},
	notes = {König's theorem},
}

@inproceedings{b749,
	title = {A Quantitative Study of Social Organization in Open Source
                  Software Communities},
	author = {Zanetti, Marcelo Serrano and Sarigol, Emre and Scholtes,
                  Ingo and Tessone, Claudio Juan and Schweitzer, Frank},
	publisher = {Schloss Dagstuhl},
	pages = {116--122},
	volume = {28},
	year = {2012},
	booktitle = {Proc. Imperial Coll. Comput. Student Workshop 2012,
                  OASIcs, Jones A.V. (Ed.)},
}

@misc{b750,
	title = {A Generalized Preferential Attachment Model
for Business Firms Growth Rates:
I. Empirical Evidence},
}

@article{b751,
	title = {Empirical Tests of {Zipf}'s Law Mechanism in Open
                  Source {Linux} Distribution},
	author = {T.  Maillard and Didier Sornette and S. Spaeth and Von
                  Krogh, G.},
	journal = {Phys. Rev. Lett.},
	volume = {101},
	pages = {218701},
	year = {2008},
	notes = {has an empirical test of preferential attachment (Slide
                  26 in the slide version},
}

@article{b752,
	title = {A Mathematical Theory of Evolution, Based on the
                  Conclusions of {Dr.} {J.} {C.} {Willis}, {F.R.S.}},
	author = {Yule, G. Udny},
	year = {1925},
	journal = {Philos. Trans. of the Royal Society of London,
                  Ser. B},
	volume = {213},
	pages = {21--87},
}

@book{b753,
	title = {Les Inegalités économiques: Applications aux inégalités
                  des richesses, à la concentration des entreprises, aux
                  populations des villes, aux statistiques des familles,
                  etc., d'une loi nouvelle: la loi de l'effect
                  proportionnel},
	author = {Robert Gibrat},
	publisher = {Sirey},
	year = {1931},
}

@article{b754,
	author = {Herbert A. Simon},
	title = {On a Class of Skew Distribution Functions},
	journal = {Biometrika},
	volume = {42},
	year = {1955},
	pages = {425--440},
}

@article{b755,
	title = {{Gibrat}'s Legacy},
	author = {John Sutton},
	journal = {J. Economic Literature},
	volume = {35},
	year = {1997},
	pages = {40--59},
}

@misc{b756,
	title = {Sublinear but Never Superlinear Preferential Attachment
                  by Local Network Growth},
	author = {Alan Gabel and S. Redner},
	note = {arXiv:1212.0518},
}

@article{b757,
	title = {The {Matthew} Effect in Science},
	author = {Robert K. Merton},
	journal = {Science},
	year = {1968},
	volume = {159},
	number = {3810},
	pages = {56--63},

}

@article{b758,
	title = {A General Theory of Bibliometric and Other Cumulative
                  Advantage Processes},
	author = {Price, Derek de Solla},
	journal = {J. Am. Society of Inf. Sci.},
	volume = {27},
	number = {5},
	pages = {292--306},
	year = {1976},
}

@book{b759,
	title = {The Psychobiology of Language},
	author = {Zipf, George K.},
	year = {1935},
	publisher = {Houghton Mifflin},
	notes = {Zipf's law},
}

@article{b760,
	title = {The Frequency Distribution of Scientific Productivity},
	author = {Lotka, Alfred J.},
	journal = {J. Washington Academy of Sci.},
	year = {1926},
	volume = {16},
	number = {12},
	pages = {317--324},
	notes = {Lotka's law.  Not available as PDF.},
}

@inproceedings{b761,
	title = {Web Dynamics as a Random Walk: How and Why Power Laws
                  Occur},
	author = {Hans Akkermans},
	booktitle = {Proc. Web Sci. Conf.},
	year = {2012},
}

@book{b762,
	title = {Skew Frequency Curves in Biology and Statistics},
	author = {Jacobus Cornelius Kapteyn and van Uven, Marie Johan},
	year = {1916},
	publisher = {Hoitsema Brothers},
	address = {Groningen},
}

@misc{b763,
	title = {Random Networks with Sublinear Preferential Attachment:
                  the Giant Component},
	author = {Steffen Dereich and Peter Mörters},
}

@article{b764,
	title = {Random Networks with Sublinear Preferential Attachment:
                  Degree Evolutions},
	author = {Steffen Dereich and Peter Mörters},
	journal = {Electrical J. Probab.},
	year = {2009},
	volume = {14},
	pages = {1222--1267},
}

@article{b765,
	title = {Random Trees and General Branching Processes},
	author = {Anna Rudas and Bálint Tóth and Benedek Valkó},
	journal = {Random Struct. Algorithms},
	volume = {31},
	number = {2},
	year = {2007},
	pages = {186--202},
}
                  
@article{b766,
	title = {Organization of Growing Random Networks},
	author = {Paul L. Krapivsky and S. Redner},
	journal = {Phys. Rev. E},
	year = {2001},
	volume = {63},
	pages = {066123},
}

@article{b767,
	title = {Measuring Preferential Attachment for Evolving
                  Networks},
	author = {H. Jeong and Z. Néda and A. L. Barabási},
	journal = {Europhys. Lett.},
	year = {2001},
	volume = {61},
	number = {4},
	pages = {567--572}
}

@article{b768,
	title = {Clustering and Preferential Attachment in Growing
                  Networks},
	author = {M. E. J. Newman},
	journal = {Phys. Rev. E},
	year = {2002},
	volume = {67},
	number = {5},
}

@article{b769,
	title = {Scale-free Networks as Preasymptotic Regimes of
                  Superlinear Preferential Attachment},
	author = {Paul L. Krapivsky and Dmitri Krioukov},
	journal = {Phys. Rev. E},
	year = {2008},
	volume = {78},
	pages = {026114},
}

@article{b770,
	title = {Connectivity Transitions in Networks with Super-linear
                  Preferential Attachment},
	author = {Roberto Oliveira and Joel Spencer},
	journal = {Internet Math.},
	year = {2005},
	volume = {2},
	pages = {121--163},
	notes = {
		Superlinear preferential attachment.
		based on a tree model.
	},
}

@article{b771,
	title = {Evolution of the Social Network of Scientific
                  Collaborations},
	author = {Albert-Laszló Barabási and H. Jeong and Z. Neda and E.
                  Ravasz and A. Schubert},
	year = {2002},
	journal = {Physica A},
	volume = {311},
	number = {3--4},
	pages = {590--614},
	notes = {
		also at cond-mat/0104162v1,
		* The scientific collaboration network
		* Preferential attachment
		* Shrinking average separation (i.e., average shortest
                  path distance).  (cf. shrinking diameter)
	}
}

@inproceedings{b772,
	title = {Coevolution of Network Structure and Content},
	author = {Chun-Yuen Teng and Liuling Gong and Avishay Livne and
                  Celso Brunetti and Lada A. Adamic},
	booktitle = {Proc. Web Sci. Conf.},
	year = {2012},
	pages = {288--297},
	notes = {
		Quoting the abstract:
		We find that networks with a higher conductance in link
                  structure exhibit higher information entropy, while
                  unexpected network configurations can be tied to
                  information novelty.
	}
}

@article{b773,
	title = {Evolution of Networks},
	author = {S. N. Dorogovtsev and J. F. F. Mendes},
	year = {2002},
	journal = {Adv. Phys.},
	volume = {51},
	pages = {1079--1187},
	notes = {
		* exact expression for sublinear preferential
                  attachment. (Eq. 94)
	}
}

@article{b774,
	title = {The `New' Science of Networks},
	author = {Duncan J. Watts},
	journal = {Annual Rev. of Sociology},
	volume = {30},
	year = {2004},
	pages = {243--270},
}

@article{b775,
	title = {Network Exchange Patterns in Online Communities},
	author = {S. Faraj and S. L. Johnson},
	journal = {Organization Sci.},
	volume = {22},
	number = {6},
	pages = {1464--1480},
	year = {2010},
}

@article{b776,
	title = {Innovation and Network Structural Dynamics: Study of
                  the Alliance Network of a Major Sector of the
                  Biotechnology Industry},
	author = {B. Gay and B. Dousset},
	year = {2005},
	journal = {Res. Policy},
	volume = {34},
	number = {10},
	pages = {1457--1475},
}

@article{b777,
	title = {The Dynamics of {R\&D} Network in the {IT} Industry},
	author = {N. Hanaki and R. Nakajima and Y. Ogura},
	year = {2010},
	journal = {Res. Policy},
	volume = {39},
	number = {3},
	pages = {386--399},
}

@article{b778,
	title = {The Long-term Dynamics of Co-authorship Scientific
                  Networks: {Iberoamerican} Countries (1973--2010)},
	author = {Guillermo A. Lemarchand},
	year = {2012},
	journal = {Res. Policy},
	volume = {41},
	number = {2},
	pages = {291--305},
}

@article{b779,
	title = {The Structure and Function of Complex Networks},
	author = {Mark E. J. Newman},
	year = {2003},
	journal = {SIAM Rev.},
	volume = {45},
	number = {2},
	pages = {167--256},
}

@article{b780,
	author = {Tremayne, M. and Zheng, N. and Lee, J. K. and Jeong,
                  J.},
	year = {2006},
	title = {Issue Publics on the {Web}: Applying Network Theory to
                  the War Blogosphere},
	journal = {J. Comput.-mediated Communication},
	volume = {12},
	number = {1},
	pages = {290--310},
}

@article{b781,
	title = {Network Structure, Self-organization, and the Growth of
                  International Collaboration in Science},
	author = {Wagner, C. S. and Leydesdorff, L.},
	year = {2005},
	journal = {Res. Policy},
	volume = {34},
	number = {10},
	pages = {1608--1618},
}

@article{b782,
  title={The Emergence of Governance in an Open Source Community},
  author={O'mahony, S. and Ferraro, F.},
  journal={Academy of Manag. J.},
  volume={50},
  number={5},
  pages={1079--1106},
  year={2007},
}

@article{b783,
	title = {Cultural Differences in Collaborative Authoring of
                  {Wikipedia}},
	author = {Ulrike Pfeil and Panayiotis Zaphiris and Chee Siang
                  Ang},
	journal = {J. Comput.-mediated Communication},
	year = {2006},
	volume = {12},
	number = {1},
	pages = {88--113},
}

@article{b784,
	title = {A Social Influence Model of Consumer Participation in
                  Network- and Small-group-based Virtual Communities},
	author = {Utpal M. Dholakiaa and Richard P. Bagozzia and Lisa
                  Klein Pearo},
	year = {2004},
	journal = {Int. J. Res. in Marketing},
	volume = {21},
	number = {3},
	pages = {241--263},
}

@inproceedings{b785,
	author = {Moser, C. and Groenewegen, P. and Huysman, M.},
	year = {2011},
	title = {Social Norms as Governance Mechanisms in Online
                  Professional Communities},
	booktitle = {Proc. Academy of Manag. Meeting},
}

@article{b786,
	title = {Forming Relationship Commitments to Online Communities:
                  The Role of Social Motivations},
	author = {Wang, E. S. T. and Chen, L. S. L.},
	year = {2012},
	journal = {Comput. in Human Behav.},
	volume = {28},
	number = {2},
	pages = {570--575},
}

@article{b787,
	title = {Understanding Online Community User Participation: a
                  Social Influence Perspective},
	author = {Zhou, T.},
	year = {2011},
	journal = {Internet Res.},
	volume = {21},
	number = {1},
	pages = {67--81},
}

@article{b788,
	author = {Dahlander, L. and Frederiksen, L. and Rullani, F.},
	year = {2008},
	title = {Online Communities and Open Innovation: Governance and
                  Symbolic Value Creation},
	journal = {Industry and Innovation},
	volume = {15},
	number = {2},
	pages = {115--123},
}

@article{b789,
	author = {Gulati, R. and Puranam, P. and Tushman, M.},
	year = {2012},
	title = {Meta-organization Design: Rethinking Design in
                  Interorganizational and Community Contexts},
	journal = {Strategic Manag. J.},
	volume = {33},
	pages = {571--586},
}

@article{b790,
	title = {Preferential Attachment in the Growth of Social
                  Networks: The {Internet} Encyclopedia {Wikipedia}},
	author = {A. Capocci and V. D. P. Servedio and F. Colaiori and
                  L. S. Buriol and D. Donato and S. Leonardi and
                  G. Caldarelli},
	journal = {Phys. Rev. E},
	volume = {74},
	number = {3},
	year = {2006},
	pages = {036116},
}

@inproceedings{b791,
	title = {Link Creation and Profile Alignment in the {aNobii}
                  Social Network},
	author = {Luca Maria Aiello and Alain Barrat and Ciro Cattuto
                  and Giancarlo Ruffo and Rossano Schifanella},
	booktitle = {Int. Conf. on Soc. Comput.},
	year = {2010},
	pages = {249--256},
}

@article{b792,
	title = {Node Centrality in Weighted Networks: Generalizing
                  Degree and Shortest Paths}, 
	author = {Tore Opsahl and Filip Agneessens and John Skvoretz},
	year = {2010},
	journal = {Soc. Netw.},
	volume = {32},
	number = {3},
	pages = {245--251},
}

@book{b793,
	title = {Numerical Methods for Large Eigenvalue Problems},
	author = {Yousef Saad},
	year = {2011},
	publisher = {SIAM},
	notes = {
		eigenvalue decomposition,
		arnoldi/lanczos algorithms
	}
}

@misc{b794,
	title = {Emergence of Hierarchy in Directed Online Social
                  Networks},
	author = {Mangesh Gupte and Pravin Shankar and Jing Li and
                  S. Muthukrishnan and Liviu Iftode},
}

@article{b795,
	title = {Basic Notions for the Analysis of Large Two-mode
                  Networks},
	author = {Matthieu Latapy and Clémence Magnien and Nathalie Del
                  Vecchio},
	journal = {Soc. Netw.},
	volume = {30},
	number = {1},
	year = {2008},
	pages = {31--48},
}

@article{b796,
	title = {Network Analysis of 2-mode Data},
	author = {Stephen P. Borgatti and Martin G. Everett},
	journal = {Soc. Netw.},
	volume = {19},
	year = {1997},
	pages = {243--269},
}

@misc{b797,
	title = {Frustration vs. Clusterability in Two-Mode Signed
                  Networks (Signed Bipartite Graphs)},
	author = {Thomas Zaslavsky},
	year = {2010},
	note = {Under revision},
}

@article{b798,
	title = {On a General Class of Models for Interaction},
	author = {David Strauss},
	year = {1986},
}

@article{b799,
	title = {A p* Primer: Logit Models for Social Networks},
	author = {Carolyn J. Anderson and Stanley Wasserman and Bradley
                  Crouch},
	journal = {Soc. Netw.},
	number = {21},
	year = {1999},
	pages = {37--66},
	notes = {
		parameter estimation
	},
}

@article{b800,
	title = {Logit Models and Logistic Regressions for Social
                  Networks: I. An Introduction to Markov Graphs and p*},
	author = {Stanley Wasserman and Philippa Pattison},
}

@misc{b801,
	title = {Correlated Random Networks},
	author = {Johannes Berg and Michael Lässig},
}

@article{b802,
	title = {{Markov} Chain {Monte} {Carlo} Estimation of
                  Exponential Random Graph Models},
	author = {Tom A.B. Snijders},
	journal = {J. Soc. Struct.},
	year = {2002},
	notes = {
		#: triad model.
		#: uses "exponential random graph model" and "p* model"
                  as synonyms.
	},
}

@article{b803,
	title = {{Markov} Graphs},
	author = {Ove Frank and David Strauss},
	journal = {J. Am. Stat. Ass.},
	volume = {81},
	number = {395},
	year = {1986},
	pages = {832--842},
}

@article{b804,
	title = {Pseudolikelihood Estimation for Social Networks},
	author = {David Strauss and Michael Ikeda},
	journal = {J. Am. Stat. Ass.},
	volume = {85},
	number = {409},
	year = {1990},
	pages = {204--212},
}

@inproceedings{b805,
	title = {Link Prediction in Biological Networks using Multi-Mode
                  Exponential Random Graph Models},
	author = {Ali Shojaie},
	notes = {The only computer science paper I could find that uses
                  Exponential Random Graphs or the p* model.},
}
                  
@article{b806,
	title = {A Framework for the Comparison of Maximum
                  Pseudo-likelihood and Maximum Likelihood Estimation of
                  Exponential Family Random Graph Models},
	author = {van Duijn, Marijtje and Krista Gile and Mark
                  Handcock},
	journal = {Soc. Netw.},
	number = {31},
	year = {2009},
	pages = {52--62},
	notes = {
		The paper gives a methodology to compare different
                  methods to estimate the model parameters.  It does not
                  show how to compare different models with each other.
	}
}

@article{b807,
	title = {New Specifications for Exponential Random Graph
                  Models},
	author = {Tom A. B. Snijders and Philippa E. Pattison and Mark
                  S. Handcock},
	journal = {Sociol. Methodol.},
	volume = {36},
	number = {1},
	year = {2006},
	pages = {99--153},
	notes = { Empirically, they analyse graphs with 30 nodes },
}

@misc{b808,
	title = {Inference in Curved Exponential Family Models for
                  Networks},
	author = {David R. Hunter and Mark S. Handcock},
	year = {2005},
	notes = {
		#: year may be 2004.
	}
}

@misc{b809,
	title = {An Introduction to Random Graphs, Dependence Graphs,
                  and {p*}},
	author = {Stanley Wasserman and Garry Robins},
	year = {2005},
}


@article{b810,
	title = {Constrained {Monte} {Carlo} Maximum Likelihood for
                  Dependent Data},
	author = {Charles J. Geyer and Elizabeth A. Thompson},
	journal = {J. Royal Stat. Society.  Series B
                  (Methodological)},
	volume = {54},
	number = {3},
	year = {1992},
	pages = {657--699},
	notes = {
		#: MCMCMLE estimation
	},
}

@article{b811,
	title = {An Exponential Family of Probability Distributions for
                  Directed Graphs},
	author = {Paul W. Holland and Samuel Leinhardt},
	journal = {J. Am. Stat. Ass.},
	volume = {76},
	number = {373},
	year = {1981},
	pages = {33--50},
}

@article{b812,
	title = {Logit models and logistic regressions for networks:
                  II. Multivariate relations},
	author = {Philippa Pattison and Stanley Wasserman},
	journal = {Br. J. Math. and Stat. Psychol.},
	year = {1999},
	volume = {52},
	pages = {169--193},
}

@article{b813,
	title = {Logit Models and Logistic Regressions for Social
                  Networks: III. Valued Relations},
	author = {Garry Robins and Philippa Pattison and Stanley
                  Wasserman},
	journal = {Psychometrika},
	volume = {64},
	number = {3},
	pages = {371--394},
	year = {1999},
}

@misc{b814,
	title = {Goodness of Fit of Social Network Models},
	author = {David R. Hunter and Steven M. Goodreau and Mark
                  S. Handcock},
	year = {2005},
	notes = {
		#: The paper covers networks with up to thousands of
                  nodes.
		#: The software for this paper is statnet.
		#: By "goodness of fit", this paper means that a
                  synthetic network generated from a model based on a
                  real network has similar statistics than the real
                  graph -- even if the statistics are not taken into
                  account in the model.
	}
}

@misc{b815,
	title = {Degeneracy and Inference for Social Network Models},
	author = {Mark S. Handcock},
	year = {2002},
	notes = {
		#: Defines a temporal exponential graph model.
	},
}

@misc{b816,
	title = {Estimating and Understanding Exponential Random Graph
                  Models},
	author = {Sourav Chatterjee and Persi Diaconis},
	year = {2013},
	note = {Submitted to Ann. of Stat.},
	notes = {
		#: many ERGMs are equivalent to the Erdős--Rényi model.
		#: Contains an introduction to graph limits.
	},
}

@misc{b817,
	title = {Link Prediction of Community in Microblog Based on
                  Exponential Random Graph Model},
	author = {Chuang Zhang and Bing Yu Zhai and Ming Wu},
	year = {2013},
}

@article{b818,
	title = {Recent Developments in Exponential Random Graph (p*)
                  Models for Social Networks},
	author = {Gary Robins and Tom Snijders and Peng Wang and Mark
                  Handcock and Philippa Pattison},
	journal = {Soc. Netw.},
	volume = {29},
	year = {2007},
	pages = {192--215},
	_notes = {
		#: Main reference for ERGMs.
	},
}

@article{b819,
	title = {Advances on Exponential Random Graph (p*) Models
                  Applied to a Large Social Network},
	author = {Steven M. Goodreau},
	journal = {Soc. Netw.},
	year = {2007},
	volume = {29},
	number = {2},
	pages = {231--248},
	notes = {
		#: probably the study applying ERGMs to the largest
                  dataset, with 1681 nodes.
	}
}

@inproceedings{b820,
	title = {Supervised Link Prediction Using Multiple Sources},
	author = {Zhengdong Lu and Berkant Savas and Wei Tang and
                  Inderjit S. Dhillon},
	year = {2010},
	booktitle = {Proc. Int. Conf. on Data Min.},
	pages = {923--928},
	notes = {
		#: They do not infer a model from multiple datasets
                  (despite the title), but from a multiplerelational
                  network, in which each subnetwork of one edge type is
                  interpreted as one "network".
	},
}

@inproceedings{b821,
	title = {Mass Preserving Exponential Random Graph Model},
	author = {Lin Yuan and Sergey Kirshner and Robert Givan},
	booktitle = {Proc. Workshop on Algorithmic and Stat.
                  Approaches for Large Soc. Netw.},
	year = {2012},
	notes = {
		Proposes to constrain an ERGM to have a certain
                  proportion of the probability mass near the expected
                  values of the statistics of the observed graph.
                  Mentions that one usually how only a single graph.
	},
}

@inproceedings{b822,
	title = {{Fiedler} Random Fields: A Large-Scale Spectral
                  Approach to Statistical Network Modeling},
	author = {Antonino Freno and Mikaela Keller and Marc Tommasi},
	booktitle = {Advances in Neural Inf. Process. Syst.},
	year = {2012},
	notes = {
		#: states that most network models are based on
                  statistics and that that's bad, and then goes on to
                  define a new statistics, the delta Fiedler function.
	},
}

@misc{b823,
	author = {Alessandro Rinaldo and Sonja Petrović and Stephen
                  E. Fienberg},
	title = {Maximum Likelihood Estimation in Network Models},
	notes = {
		#: The beta model, an ERGM based on the degree
                  distribution.
	},
}

@misc{b824,
	title = {Probability Distributions and Maximum Entropy},
	author = {Keith Conrad},
}

@inproceedings{b825,
	title = {A Random Network Generator with Finely Tunable
                  Clustering Coefficient for Small-world Social
                  Networks},
	author = {Weisen Guo and Steven B. Kraines},
	year = {2009},
	booktitle = {Prof. Int. Conf. on Comput. Aspects of Soc.
                  Netw.},
	pages = {10--17},
	notes = {
		#: Generate random graph with an exact given number of
                  nodes, degree distribution and clustering coefficient.
                  First, generate a random graph with the given number
                  of nodes and degree distribution.  Then rewire edges
                  in a clever way that does not change the degree
                  distribution, but which changes the clustering
                  coefficient.
	}
}

@misc{b826,
	title = {Generating Random Graphs Efficiently},
	author = {Rajeev Raman},
	note = {Tech. Report 369, Univ. of Rochester Comput. Sci.},
	year = {1991},
}

@misc{b827,
	title = {Solution of the 2-Star Model of a Network},
	author = {Juyong Park and M. E. J. Newman},
	year = {2004},
	notes = {
		#: an exact derivation of the ERGM parametrized by the
                  number of edges and number of 2-stars.  Shows
                  theoretically that the model is degenerate for a wide
                  range of parameter values.
	},
}

@misc{b828,
	title = {Solution for the Properties of a Clustered Network},
	author = {Juyong Park and M. E. J. Newman},
	year = {2005},
	notes = {
		#: Mean field approximation for the [m, t] ERGM.
	},
}

@article{b829,
	title = {Phase Transition in the Random Triangle Model},
	author = {Olle Häggström and Johan Jonasson},
	journal = {J. Appl. Probab.},
	volume = {36},
	number = {4},
	year = {1999},
	pages = {1101--1115},
}

@misc{b830,
	title = {Phase Transitions in Exponential Random Graphs},
	author = {Charles Radin and Mei Yin},
	year = {2011},
	note = {Submitted to Ann. of Appl. Probab.},
}

@misc{b831,
	title = {Mixing Time of Exponential Random Graphs},
	author = {Shankar Bhamidi and Guy Bresler and Allan Sly},
	year = {2008},
	notes = {
		#: Many ERGMs are degenerate.
	},
}

@article{b832,
	title = {Statistical Analysis of Non-Lattice Data},
	author = {Julian Besag},
	journal = {The Statistician},
	volume = {24},
	number = {3},
	year = {1975},
	pages = {179--195},
	notes = {
		#: Pseudolikelihood.
	},
}

@misc{b833,
	title = {Discrete Temporal Models of Social Networks},
	author = {Steve Hanneke and Eric Xing},
}

@article{b834,
	title = {Network Transitivity and Matrix Models},
	author = {Z. Burda and J. Jurkiewicz and A. Krzwicki},
	journal = {Phys. Rev. E},
	volume = {69},
	pages = {026106},
	year = {2004},
}

@article{b835,
	title = {Connectivity of Random Nets},
	author = {Ray Solomonoff and Anatol Rapoport},
	journal = {Bull. of Math. Biophys.},
	volume = {13},
	year = {1951},
	pages = {107--117},
	notes = {
		First instance of what we nowadays call the Erdős--Rényi
                  random graph.
	},
}

@article{b836,
	title = {Statistical Mechanics of Networks},
	author = {Juyong Park and M. E. J. Newman},
	journal = {Phys. Rev. E},
	volume = {70},
	pages = {066117},
	year = {2004},
	notes = {
		#: very good summary of the mean field approach.
		#: Gives a good justification for the precision of the
                  mean-field approach in Section B.
	},
}

@article{b837,
	title = {Phase Transitions in Social Networks},
	author = {P. Fronczak and A. Fronczak and J. A. Hołyst},
	journal = {Eur. Phys. J. B},
	volume = {59},
	pages = {133--139},
	year = {2007},
	notes = {
		#: an ERGM with two parameters: the clustering
                  coefficient and a function of the degrees that is
                  maximal when degrees have intermediate degree.
	},
}

@article{b838,
	title = {Homogeneous Complex Networks},
	author = {Leszek Bogacz and Zdzisław Burda and Bartłomiej
                  Wacław},
	journal = {Physica A},
	volume = {366},
	year = {2006},
	pages = {587--607},
	notes = {
		#: ERGMs on the space of graphs with a fixed number of
                  nodes and edges.
		#: use the degree distribution as statistics.
	}
}

@article{b839,
	title = {Statistical Mechanics of Topological Phase Transitions
                  in Networks},
	author = {Palla, Gergely and Derény, Imre and Farkas, Illés and
                  Vicsek, Tamás},
	journal = {Phys. Rev. E},
	volume = {69},
	pages = {046117},
	year = {2004},
}

@misc{b840,
	title = {Likelihood-based Assessment of Graph Evolution Models},
	author = {Richard G. Clegg and Raul Landa and Eleni Mykoniati
                  and Miguel Rio},
	year = {2012},
}

@article{b841,
	title = {Characterizations of a Discrete Normal Distribution},
	author = {Adrienne W. Kemp},
	journal = {J. Stat. Planning and Inference},
	number = {63},
	year = {1997},
	pages = {223--229},
}

@article{b842,
	title = {Note on the Generation of Most Probable Frequency
                  Distributions},
	author = {J. H. C. Lisman and Van Zuylen, M. C. A.},
	journal = {Statistica Neerlandica},
	year = {1972},
	number = {26},
	volume = {1},
	pages = {19--23},
}

@book{b843,
	title = {Introduction to Machine Learning},
	author = {Alex Smola and S. V. N. Vishwanathan},
	publisher = {Cambridge Univ. Press},
	year = {2008},
}

@article{b844,
	title = {Fast Direction-Aware Proximity for Graph Mining},
	author = {Hanghang Tong and Yehuda Koren and Christos
                  Faloutsos},
	notes = {
		#: A directed proximity measure based on a spectral
                  transformation of the "PageRank" matrix, i.e., the
                  stochastic adjacency matrix P [stoch2].
	},
}
                  
@article{b845,
	title = {Evolving Clustered Random Networks},
	author = {Shweta Bansal and
               Shashank Khandelwal and
               Lauren Ancel Meyers},
	journal = {CoRR},
	volume = {abs/0808.0509},
	year = {2008},
}

@article{b846,
	title = {Generating Scale-free Networks with Adjustable
                  Clustering Coefficient Via Random Walks},
	author = {Carlos Herrera and Pedro J. Zufiria},
	notes = {
		#: Preferential attachment is considered, not based on
                  the degree, but on a random walk.  This is a purely
                  local property.
	},
}

@inproceedings{b847,
	title = {R-MAT: A Recursive Model for Graph Mining},
	author = {Deepayan Chakrabarti and Yiping Zhan and Christos
                  Faloutsos},
	notes = {
		#: Precursor to the Kronecker model.
	},
}

@article{b848,
	title = {Characterization of Complex Networks: A Survey of
                  measurements},
	author = {L. da F. Costa and F. A. Rodrigues and G. Travieso and
                  P. R. Villas Boas},
	year = {2008},
}

@article{b849,
	title = {{Kronecker} Graphs: An Approach to Modeling Networks},
	author = {Jure Leskovec and Deepayan Chakrabarti and Jon
                  Kleinberg and Christos Faloutsos and Zoubin
                  Ghahramani},
	journal = {J. Mach. Learn. Res.},
	volume = {11},
	year = {2010},
	pages = {985--1042},
}

@book{b850,
	title = {Networks, Crowds and Markets -- Reasoning about a
                  Highly Connected World},
	author = {Jon Kleinberg and David Easley},
	year = {2010},
	publisher = {Cambridge Univ. Press},
}

@inproceedings{b851,
	title = {Information Retrieval in Folksonomies: Search and
                  Ranking},
	author = {Hotho, Andreas and Jäschke, Robert and Schmitz,
                  Christoph and Stumme, Gerd},
	booktitle = {Proc. Eur. Conf. Semant. Web: Res. and Appl.},
	year = {2006},
	pages = {411--426},
}

@inproceedings{b852,
	title = {Automatic Extraction of Relevant Nodes in Biochemical
                  Networks},
	booktitle = {Atelier apprentissage et bioinformatique, CAp 2005,
                  Conférence d'apprentissage},
	year = {2005},
	pages = {21--31},
	author = {Vast, S. and Pierre Dupont and Yves Deville},
	notes = {
		Find a subgraph of a given graph that summarizes the
                  relationship between two nodes, e.g. shortest paths
                  and related nodes and edges.
	},
}

@article{b853,
	title = {Moment-based Estimation of Stochastic {Kronecker} Graph
                  Parameters},
	author = {David Gleich and Art Owen},
	year = {2012},
	journal = {Internet Math.},
	volume = {8},
	number = {3},
	pages = {232--256},
}

@article{b854,
	title = {Mixing Patterns in Networks},
	author = {Mark E. J. Newman},
	journal = {Phys. Rev. E},
	volume = {67},
	pages = {026126},
	year = {2003},
	notes = {
		#: Eq. (2): measure of bipartivity. (But the paper does
                  not give the significance text.)
		#: Definition of homophily.
	},
}

@article{b855,
	title = {Measuring and Testing Dependence by Correlation of
                  Distances},
	author = {Gábor J. Székely and Maria L. Rizzo and Nail
                  K. Bakirov},
	journal = {Ann. of Stat.},
	year = {2007},
	volume = {35},
	number = {6},
	pages = {2769--2794},
}

@inproceedings{b856,
	title = {Learning to Discover Social Circles in Ego Networks},
	author = {Leskovec, Jure and McAuley, Julian J.},
	booktitle = {Advances in Neural Inf. Process. Syst.},
	pages = {539--547},
	year = {2012},
}

@book{b857,
	title = {Introduction to Data Mining},
	author = {Tan, Pang-Ning and Michael Steinbach and Vipin Kumar},
	year = {2005},
	publisher = {Addison-Wesley},
	_notes = {Definition of the Jaccard coefficient},
}

@article{b858,
	title = {Spectral Distances of Graphs Based on Their Different
                  Matrix Representations},
	author = {Irena Jovanović and Zoran Stanić},
	journal = {Filomat},
	volume = {28},
	year = {2014},
	pages = {723--734},
}

@article{b859,
	title={Topic and Role Discovery in Social Networks with
                  Experiments on {Enron} and Academic Email},
	author={McCallum, Andrew and Wang, Xuerui and Corrada-Emmanuel,
                  Andrés},
	journal = {J. Artif. Intell. Res.},
	volume = {30},
	pages = {249--272},
	year = {2007},
}

@article{b860,
	title = {Principal Component Analysis},
	author = {Hervé Abdi and Lynne J. Williams},
	journal = {Wiley Interdiscip. Rev.: Comput. Stat.},
	volume = {2},
	number = {4},
	_doi = {10.1002/wics.101},
	pages = {433--459},
	year = {2010},
	_notes = {
		#: main reference for Principal Component Analysis
                  (PCA).
	},
}

@inproceedings{b861,
	title = {Sampling from Large Graphs},
	author = {Jure Leskovec and Christos Faloutsos},
 	booktitle = {Proc. Int. Conf. on Knowl. Discov. and Data Min.},
	year = {2006},
	pages = {631--636},
}

@article{b862,
	title = {Attitudes and Cognitive Organization},
	author = {Fritz Heider},
	year = {1946},
	journal = {J. Psychol.},
	volume = {21},
	pages = {107--112},
}

@misc{b863,
	title = {The Similarity between Stochastic {Kronecker} and
                  {Chung}--{Lu} Graph Models},
	author = {Ali Pinar and C. Seshadhri and Tamara G. Kolda},
}

@article{b864,
	title = {Weighted Spectral Distribution for Internet Topology
                  Analysis: Theory and Applications},
	author = {Damien Fay},
	journal = {IEEE/ACM Trans. on Netw.},
	year = {2010},
	volume = {18},
	number = {1},
	pages = {164--176},
}

@article{b865,
	title = {Community Structure and Scale-free Collections of
                  {Erdős}--{Rényi} Graphs},
	author = {C. Seshadhri and Tamara G. Kolda and Ali Pinar},
	journal = {Phys. Rev. E},
	year = {2012},
	volume = {85},
	number = {5},
	pages = {056109},
	notes = {
		#: The real BTER reference.
	},
}

@article{b866,
	title = {Patterns of Link Reciprocity in Directed Networks},
	author = {Diego Garlaschelli and Maria I. Loffredo},
	journal = {Phys. Rev. Lett.},
	volume = {93},
	number = {26},
	pages = {268701},
	year = {2004},
}

@article{b867,
	title = {Multirelational Organization of Large-scale Social
                  Networks in an Online World},
	author = {Michael Szell and Renaud Lambiotte and Stefan
                  Thurner},
	journal = {Proc. Natl. Acad. Sci. U.S.A.},
	volume = {107},
	number = {31},
	pages = {13636--13641},
	year = {2010},
}

@article{b868,
	title = {Computing Global Structural Balance in Large-scale
                  Signed Social Networks},
	author = {Giuseppe Facchetti and Giovanni Iacono and Claudio
                  Altafini},
	year = {2011},
	journal = {PNAS},
	volume = {108},
	number = {52},
	pages = {20953--20958},
}

@article{b869,
	title = {Graphical Representation of Asymmetric Matrices},
	author = {A. G. Constantine and J. C. Gower},
	journal = {J. Royal Stat. Soc., Series C (Appl. Stat.)},
	volume = {27},
	number = {3},
	year = {1978},
	pages = {297--304},
}

@article{b870,
	title = {Graph Drawing by Force-Directed Placement},
	author = {Fruchterman, Thomas M. J. and Reingold, Edward M.},
	journal = {Software: Pract. and Exp.},
	volume = {21},
	number = {11},
	pages = {1129--1164},
	year = {1991},
	publisher = {Wiley},
	notes = {
		#: The Fruchterman--Reingold algorithm for graph drawing.  
		#: We use this as a standard algorithm in KONECT and in
                  several papers. 
	}
}

@article{b871,
	title = {Community Detection in Graphs},
	author = {Santo Fortunato},
	year = {2010},
	_note = {Review paper},
}

@misc{b872,
	title = {A Course on Quantum Techniques for Stochastic
                  Mechanics},
	author = {John C. Baez and Jacob D. Biamonte},
}

@misc{b873,
	title = {Modeling Cohesiveness and Enmity for Signed Social
                  Communities},
	author = {Pengkui Luo and Zhi-Li Zhang},
	note = {Tech. Report TR 13-029, Univ. of Minnesota},
}

@article{b874,
	title = {Classes of Small-World Networks},
	author = {L. A. N. Amaral and A. Scala and M. Barthélémy and
                  H. E. Stanley},
	journal = {Proc. Natl. Acad. Sci. U.S.A.},
	year = {2000}, 
	volume = {97},
	number = {21},
	pages = {11149--11152},
}

@article{b875,
	title = {Spectral Theory for Dynamics on Graphs Containing
                  Attractive and Repulsive Interactions},    
	author = {Jared C. Bronski and Lee DeVille},
	journal = {J. Appl. Math.},
	volume = {74},
	number = {1}, 
	pages = {83--105},
	year = {2014},
}

@article{b876,
	title = {Graph Mining: Laws, Generators, and Algorithms},
	author = {Deepayan Chakrabarti and Christos Faloutsos},
	journal = {ACM Comput. Surv.}, 
	volume = {38}, 
	year = {2006}, 
}

@article{b877,
	title = {Efficient Behavior of Small-World Networks},
	author = {Vito Latora and Massimo Marchiori},
	journal = {Phys. Rev. Lett.},
	volume = {87},
	number = {19},
	year = {2001},
}

@article{b878,
	title = {Quantifying Structure in Networks},
	author = {E. Olbrich and T. Kahle and N. Bertschinger and N. Ay
                  and J. Jost},
	journal = {Eur. Phys. J. B},
	year = {2010},
	volume = {77},
	pages = {239},
}

@book{b879,
	title = {The Art of Computer Programming},
	author = {Donald Knuth}, 
}

@article{b880,
	title = {Mean First-Passage Time for Random Walks on Undirected
                  Networks},
	author = {Zhongzhi Zhang and Alafate Julaiti and Baoyu Hou and
                  Hongjuan Zhang and Guanrong Chen},
	journal = {Eur. Phys. J. B},
	year = {2011},
	volume = {84},
	number = {4},
	pages = {691--697},
}

@book{b881,
	title = {The {C} Programming Language},
	author = {Brian W. Kernighan and Dennis M. Richie},
}

@misc{b882,
	title = {An Exact Method for Computing the Frustration Index in
                  Signed Networks using Binary Programming},    
	author = {Samin Aref and Andrew J. Mason and Mark C. Wilson},
	year = {2017},
	notes = {They compute the frustration index exactly, i.e., the
                  discrete (non-relaxed) version.  The consider issues
                  like NP-completeness, etc.}, 
}

@misc{b883,
	title = {Hubiness, Length, Crossings and Their Relationships in Dependency Trees},
	author = {Ramon {Ferrer-i-Cancho}},
	year = {2013},
}

@article{b884,
	title = {Fair Topologies: Community Structures and Network Hubs Drive Emergence of Fairness Norms},
	author = {Mohsen Mosleh and Babak Heydari},
	year = {2017},
	journal = {Scientific Reports},
	volume = {7},
}

@article{b885,
	title = {Overview of Metrics and Their Correlation Patterns for Multiple-Metric Topology Analysis on Heterogeneous Graph Ensembles},
	author = {Gergana Bounova and Olivier de Weck},
	journal = {Phys. Rev. E},
	volume = {85},
	pages = {016117},
	year = {2012},
}

@article{b886,
	title = {Mean-field Theory for Scale-Free Random Networks},
	author = {Albert-L\'aszl\'o Barab\'asi and R\'eka Albert and Hawoong Jeong},
	year = {1999},
	note = {preprint},
}

@article{b887,
	title = {Random Graphs as Models of Networks},
	author = {M. E. J. Newman},
	note = {SFI working paper},
	year = {2002},
	_note = {
		#: Probability generating function of the degree distribution.
	},
}

@misc{b888,
	title = {Scale-free Networks Are Rare},
	author = {Anna Broido and Aaron Clauset},
	year = {2017},
	note = {In review}, 
}

@article{b889,
	title = {Identifying Networks with Common Organizational Principles},
	author = {Anatol E. Wegner and Luis Ospina-Forero and Robert E. Gaunt and Charlotte M. Deane and Gesine Reinert},
	year = {2017},
	note = {Preprint},
}

@inproceedings{b890,
	title = {Motifs in Temporal Networks},
	author = {Ashwin Paranjape and Austin R. Benson and Jure Leskovec},
	booktitle = {Proc. Conf. Web Search and Dat. Min.},
	year = {2017},
	pages = {601--610},
}

@article{b891,
	title = {Fast Unfolding of Communities in Large Networks},
	author = {Vincent D. Blondel and Jean-Loup Guillaume and Renaud Lambiotte and Étienne Lefebvre},
	journal = {J. of Stat. Mech.: Theory and Exp.},
	year =  {2008},
	pages = {P10008},
	volume = {10},
}

@article{b892,
	title = {Mining Open Datasets for Transparency in Taxi Transport in Metropolitan Environments},
	author = {Anastasios Noulas and Vsevolod Salnikov and Renaud Lambiotte and Cecilia Mascolo},
	journal = {Eur. Phys. J. Data Sci.},
	year = {2015},
	volume = {4},
	pages = {23},
}

@article{b893,
	title = {Multirelational Organization of Large-Scale Social Networks in an Online World},
	author = {Michael Szell and Renaud Lambiotte and Stefan Thurner},
	journal = {Proc. Natl. Acad. Sci. U.S.A.},
	year = {2010},
	volume = {107},
	number = {31},
	pages = {13636--13641},
}

@article{b894,
	title = {The Many Facets of Community Detection in Complex Networks},
	author = {Michael T. Schaub and Jean-Charles Delvenne and Martin Rosvall and Renaud Lambiotte},
	journal = {Appl. Netw. Sci.},
	volume = {2},
	number = {1}, 
	pages = {4},
	year = {2017},
}

@article{b895,
	title = {Random Walks, {Markov} Processes and the Multiscale Modular Organization of Complex Networks},
	author = {R. Lambiotte and Jean-Charles Delvenne and M. Barahona},
	journal = {IEEE Trans. on Netw. Sci. and Eng.},
	volume = {1},
	number = {2},
	pages = {76--90},
	year = {2014},
}

@article{b896,
	title = {Memory in Network Flows and Its Effects on Spreading Dynamics and Community Detection},
	author = {Martin Rosvall and Alcides V. Esquivel and Andrea Lancichinetti and Jevin D. West and Renaud Lambiotte},
	journal = {Nature Commun.},
	volume = {5},
	year = {2014},
}

@book{b897,
	title = {A Guide to Temporal Networks},
	author = {Naoki Masuda and Renaud Lambiotte},
	journal = {World Scientific},
	year = {2016},
}

@article{b898,
	title = {Birds of a Feather:  Homophily in Social Networks},
	author = {Miller McPherson and Lynn Smith-Lovin and James M. Cook},
	journal = {Annu. Rev. Sociol.},
	year = {2001},
	volume = {27},
	pages = {415-444},
}

@article{b899,
	title = {Measuring Partial Balance in Signed Networks},
	author = {Samin Aref and Mark C. Wilson},
	year = {2017},
	journal = {J. of Complex Netw.},
}

@article{b900,
	title = {Signless {Laplacians} of Finite Graphs},
	author = {Dragoš Cvetković and Peter Rowlinson and Slobodan K. Simić},
	journal = {Linear Algebra and Its Appl.},
	volume = {423},
	number = {1},
	year = {2007},
	pages = {155--171},
}

@incollection{b901,
	title = {Chapter 2 -- The Rich Legacy of Half a Century of the {Wiener} Index},
	author = {Dennis H. Rouvray},
	editor = {Rouvray, D.H. and King, R.B.},
	booktitle = {Topology in Chemistry},
	publisher = {Woodhead},
	year = {2002},
	pages = {16--37},
	isbn = {978-1-898563-76-1},
}

@book{b902,
	title = {Graph Spectra for Complex Networks},
	author = {Piet Van Mieghem},
	publisher = {Cambridge Univ. Press},
	year = {2011},
}

@article{b903,
	title = {Magnetic Eigenmaps for Community Detection in Directed Networks},
	author = {Michaël Fanuel and Carlos M. Alaíz and Johan A. K. Suykens},
	year = {2016},
}

@article{b904,
	title = {Random Overlapping Communities:  Approximating Motif Densities of Large Graphs},
	author = {Samantha Petti and Santosh Vempala},
	year = {2017},
}

@book{b905,
	title = {Algebraic Topology},
	author = {Allen Hatcher},
	year = {2001},
}

@article{b906,
	title = {Equilateral Point Sets in Elliptic Geometry},
	author = {van Lint, Jacobus Hendricus and Seidel, Johan Jacob},
	journal = {Proc. Koninklijke Nederlandse Akademie van Wetenschappen Series A: Math. Sci.}, 
	volume = {69},
	number = {3},
	pages = {335--348},
	year = {1966},
}

@article{b907,
	title = {Strongly Regular Graphs with $(-1,1,0)$ Adjacency Matrix Having Eigenvalue $3$},
	author = {Seidel, Johan Jacob},
	journal = {Linear Algebra and Its Applications},
	volume = {1},
	year = {1968},
	pages = {281--298},	
}

@article{b908,
	title = {The Main Eigenvalues of the {Seidel} Matrix},
	author = {Houqing Zhou},
	journal = {Mathematica Moravica},
	volume = {12},
	number = {1},
	pages = {111--116},
	year = {2008},
}

@article{b909,
	title = {On Eigenvalues of {Seidel} Matrices and {Haemers'} Conjecture},
	author = {Ebrahim Ghorbani},
	year = {2013},
	journal = {CoRR},
	volume = {abs/1301.0075},
}

@article{b910,
	title = {The Energy of a Graph: Old and New Results},
	author = {Ivan Gutman},
	journal = {Algebraic Comb. and Appl.},
	pages = {196--211},
	year = {2001},
}

@article{b911,
	title = {Eigenvalues of Graphs},
	author = {Lovász, László},
	year = {2007},
}

@article{b912,
	title = {Enumeration of {Seidel} matrices},
	author = {Szöllősi, Ferenc and Östergård, Patric R. J.},
	journal = {Eur. J. of Comb.},
	volume = {69},
	year = {2018},
	pages = {169--184},
}