<reponame>andrazdeluisa/project-ina<filename>report/biblio.bib
@article{bommarito-katz,
  title   = {On the Stability of Community Detection Algorithms on Longitudinal Citation Data},
  journal = {Procedia - Social and Behavioral Sciences},
  volume  = {4},
  pages   = {26 - 37},
  year    = {2010},
  note    = {Applications of Social Network Analysis},
  issn    = {1877-0428},
  doi     = {https://doi.org/10.1016/j.sbspro.2010.07.480},
  url     = {http://www.sciencedirect.com/science/article/pii/S1877042810018549},
  author  = {<NAME> and <NAME> and <NAME>}
}

@article{karrer-levina,
  title     = {Robustness of community structure in networks},
  volume    = {77},
  issn      = {1550-2376},
  url       = {http://dx.doi.org/10.1103/PhysRevE.77.046119},
  doi       = {10.1103/physreve.77.046119},
  number    = {4},
  journal   = {Physical Review E},
  publisher = {American Physical Society (APS)},
  author    = {<NAME> <NAME> and <NAME>.},
  year      = {2008},
  month     = {Apr}
}

@article{Newman_2006,
  title     = {Finding community structure in networks using the eigenvectors of matrices},
  volume    = {74},
  issn      = {1550-2376},
  url       = {http://dx.doi.org/10.1103/PhysRevE.74.036104},
  doi       = {10.1103/physreve.74.036104},
  number    = {3},
  journal   = {Physical Review E},
  publisher = {American Physical Society (APS)},
  author    = {<NAME>.},
  year      = {2006},
  month     = {Sep}
}

@inproceedings{aadithya,
  author    = {Aadithya, <NAME>.
and <NAME>
and Michalak, <NAME>.
and Jennings, <NAME>.},
  editor    = {<NAME>},
  title     = {Efficient Computation of the Shapley Value for Centrality in Networks},
  booktitle = {Internet and Network Economics},
  year      = {2010},
  publisher = {Springer Berlin Heidelberg},
  address   = {Berlin, Heidelberg},
  pages     = {1--13},
  isbn      = {978-3-642-17572-5}
}

@article{fenn-porter,
  author    = { <NAME>  and  <NAME>  and  <NAME>  and  <NAME>  and  <NAME>  and  <NAME>  and  <NAME> },
  title     = {Dynamical clustering of exchange rates},
  journal   = {Quantitative Finance},
  volume    = {12},
  number    = {10},
  pages     = {1493-1520},
  year      = {2012},
  publisher = {Routledge},
  doi       = {10.1080/14697688.2012.668288},
  url       = {https://doi.org/10.1080/14697688.2012.668288},
  eprint    = {https://doi.org/10.1080/14697688.2012.668288}
}

@article{michalak,
  author  = {<NAME>},
  year    = {2014},
  month   = {02},
  pages   = {},
  title   = {Efficient Computation of the Shapley Value for Game-Theoretic Network Centrality},
  volume  = {46},
  journal = {Journal of Artificial Intelligence Research},
  doi     = {10.1613/jair.3806}
}

@article{kannan-vempala,
  author     = {<NAME> <NAME>},
  title      = {On Clusterings: Good, Bad and Spectral},
  year       = {2004},
  issue_date = {May 2004},
  publisher  = {Association for Computing Machinery},
  address    = {New York, NY, USA},
  volume     = {51},
  number     = {3},
  issn       = {0004-5411},
  url        = {https://doi.org/10.1145/990308.990313},
  doi        = {10.1145/990308.990313},
  journal    = {J. ACM},
  month      = may,
  pages      = {497–515},
  numpages   = {19},
  keywords   = {graph algorithms, Clustering, spectral methods}
}
  
@article{narahari,
  author  = {<NAME>},
  year    = {2011},
  month   = {02},
  pages   = {130 - 147},
  title   = {A Shapley Value-Based Approach to Discover Influential Nodes in Social Networks},
  volume  = {8},
  journal = {Automation Science and Engineering, IEEE Transactions on},
  doi     = {10.1109/TASE.2010.2052042}
}

@inproceedings{yang-leskovec,
  author    = {J. {Yang} and J. {Leskovec}},
  booktitle = {2012 IEEE 12th International Conference on Data Mining},
  title     = {Community-Affiliation Graph Model for Overlapping Network Community Detection},
  year      = {2012},
  volume    = {},
  number    = {},
  pages     = {1170-1175}
}

@article{girvan-newman,
  author    = {<NAME>. and Newman, <NAME>.},
  title     = {Community structure in social and biological networks},
  volume    = {99},
  number    = {12},
  pages     = {7821--7826},
  year      = {2002},
  doi       = {10.1073/pnas.122653799},
  publisher = {National Academy of Sciences},
  issn      = {0027-8424},
  url       = {https://www.pnas.org/content/99/12/7821},
  journal   = {Proceedings of the National Academy of Sciences}
}

@article{lfr,
  title     = {Benchmark graphs for testing community detection algorithms},
  author    = {Lancichinetti, Andrea and <NAME> and <NAME>},
  journal   = {Phys. Rev. E},
  volume    = {78},
  issue     = {4},
  pages     = {046110},
  numpages  = {5},
  year      = {2008},
  month     = {Oct},
  publisher = {American Physical Society},
  doi       = {10.1103/PhysRevE.78.046110},
  url       = {https://link.aps.org/doi/10.1103/PhysRevE.78.046110}
}

@techreport{pagerank,
  number      = {1999-66},
  month       = {November},
  author      = {<NAME> and <NAME> and <NAME> and <NAME>},
  note        = {Previous number = SIDL-WP-1999-0120},
  title       = {The PageRank Citation Ranking: Bringing Order to the Web.},
  type        = {Technical Report},
  publisher   = {Stanford InfoLab},
  year        = {1999},
  institution = {Stanford InfoLab},
  url         = {http://ilpubs.stanford.edu:8090/422/},
}

@article{Jensen_2015,
  title     = {Detecting global bridges in networks},
  volume    = {4},
  issn      = {2051-1329},
  url       = {http://dx.doi.org/10.1093/comnet/cnv022},
  doi       = {10.1093/comnet/cnv022},
  number    = {3},
  journal   = {Journal of Complex Networks},
  publisher = {Oxford University Press (OUP)},
  author    = {<NAME> Morini, <NAME> Karsai, <NAME> Venturini, Tommaso and Vespignani, Alessandro and Jacomy, <NAME>, <NAME> and <NAME>},
  year      = {2015},
  month     = {Oct},
  pages     = {319–329}
}

@article{freeman,
  issn      = {00380431},
  url       = {http://www.jstor.org/stable/3033543},
  abstract  = {A Family of new measures of point and graph centrality based on early intuitions of Bavelas (1948) is introduced. These measures define centrality in terms of the degree to which a point falls on the shortest path between others and therefore has a potential for control of communication. They may be used to index centrality in any large or small network of symmetrical relations, whether connected or unconnected.},
  author    = {<NAME>},
  journal   = {Sociometry},
  number    = {1},
  pages     = {35--41},
  publisher = {[American Sociological Association, Sage Publications, Inc.]},
  title     = {A Set of Measures of Centrality Based on Betweenness},
  volume    = {40},
  year      = {1977}
}

@article{coscia-rossetti,
  author     = {<NAME> <NAME> <NAME> <NAME>},
  title      = {Uncovering Hierarchical and Overlapping Communities with a Local-First Approach},
  year       = {2014},
  issue_date = {October 2014},
  publisher  = {Association for Computing Machinery},
  address    = {New York, NY, USA},
  volume     = {9},
  number     = {1},
  issn       = {1556-4681},
  url        = {https://doi.org/10.1145/2629511},
  doi        = {10.1145/2629511},
  journal    = {ACM Trans. Knowl. Discov. Data},
  month      = aug,
  articleno  = {6},
  numpages   = {27},
  keywords   = {Complex networks, community discovery, data mining}
}
  
@inproceedings{demon,
  author    = {<NAME> <NAME> <NAME> <NAME>},
  title     = {DEMON: A Local-First Discovery Method for Overlapping Communities},
  year      = {2012},
  isbn      = {9781450314626},
  publisher = {Association for Computing Machinery},
  address   = {New York, NY, USA},
  url       = {https://doi.org/10.1145/2339530.2339630},
  doi       = {10.1145/2339530.2339630},
  booktitle = {Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining},
  pages     = {615–623},
  numpages  = {9},
  keywords  = {community discovery, complex networks, data mining},
  location  = {Beijing, China},
  series    = {KDD ’12}
}
  
@article{palla-derenyi,
  author  = {<NAME> <NAME> <NAME> <NAME>},
  year    = {2005},
  month   = {07},
  pages   = {814-818},
  title   = {Uncovering the overlapping community structure of complex networks in nature and society},
  volume  = {435},
  journal = {Nature}
}

@misc{leskovec-lang-mahoney,
  title         = {Empirical Comparison of Algorithms for Network Community Detection},
  author        = {<NAME> and <NAME> and <NAME>},
  year          = {2010},
  eprint        = {1004.3539},
  archiveprefix = {arXiv},
  primaryclass  = {cs.DS}
}


@misc{github-network,
  title         = {Multi-scale Attributed Node Embedding},
  author        = {<NAME> and <NAME> and <NAME>},
  year          = {2019},
  eprint        = {1909.13021},
  archiveprefix = {arXiv},
  primaryclass  = {cs.LG}
}

@misc{carissimo,
  title    = {Validation of community robustness},
  journal  = {Computational Statistics & Data Analysis},
  volume   = {120},
  pages    = {1-24},
  year     = {2018},
  doi      = {https://doi.org/10.1016/j.csda.2017.10.006},
  url      = {http://www.sciencedirect.com/science/article/pii/S0167947317302347},
  author   = {<NAME> and <NAME> and <NAME>}
}

@article{wang-yang-fan,
  author  = {<NAME> and <NAME> and <NAME>},
  year    = {2011},
  month   = {11},
  pages   = {e27418},
  title   = {Identifying and Characterizing Nodes Important to Community Structure Using the Spectrum of the Graph},
  volume  = {6},
  journal = {PloS one},
  doi     = {10.1371/journal.pone.0027418}
}

@article{Raghavan-2007,
  title     = {Near linear time algorithm to detect community structures in large-scale networks},
  volume    = {76},
  issn      = {1550-2376},
  url       = {http://dx.doi.org/10.1103/PhysRevE.76.036106},
  doi       = {10.1103/physreve.76.036106},
  number    = {3},
  journal   = {Physical Review E},
  publisher = {American Physical Society (APS)},
  author    = {<NAME> and <NAME> and <NAME>},
  year      = {2007},
  month     = {Sep}
}

@misc{github-graph,
            title={Multi-scale Attributed Node Embedding},
            author={<NAME> and <NAME> and <NAME>},
            year={2019},
            eprint={1909.13021},
            archivePrefix={arXiv},
            primaryClass={cs.LG}
        }

@article{louvain,
	doi = {10.1088/1742-5468/2008/10/p10008},
	url = {https://doi.org/10.1088%2F1742-5468%2F2008%2F10%2Fp10008},
	year = 2008,
	month = {oct},
	publisher = {{IOP} Publishing},
	volume = {2008},
	number = {10},
	pages = {P10008},
	author = {<NAME> and <NAME> and <NAME> and <NAME>},
	title = {Fast unfolding of communities in large networks},
	journal = {Journal of Statistical Mechanics: Theory and Experiment}
}

@misc{infomap,
author = {<NAME> and <NAME> and <NAME>},
title = {The MapEquation software package},
url = {http://www.mapequation.org}
}
