References
- AartsELenstraJKLocal Search in Combinatorial Optimization1997
- ChartrandGLesniakLGraphs and Digraphs2004
- ChvátalVRecognizing intersection patternsAnnals of Discrete Mathematics1980824925110.1016/S0167-5060(08)70883-5
- CohenRHavlinSComplex Networks. Structure, Robustness, and Function2010
- Cointet J-P and Roth C (2007). How realistic should knowledge diffusion models be? Journal of Artificial Societies and Social Simulation 10 (3): 5.
- DezaMMDezaEEncyclopedia of Distances2013
- Doerr C and Blenn N (2013). Metric convergence in social network sampling. In: Proceedings of the 5th ACM Workshop on HotPlanet. ACM, New York, pp 45–50.
- FowlerJHChristakisNAEstimating peer effects on health in social networks: A response to Cohen-Cole and Fletcher; and Trogdon, Nonnemaker, and PaisJournal of Health Economics20082751400140510.1016/j.jhealeco.2008.07.001
- FowlerJHDawesCTChristakisNAModel of genetic variation in human social networksProceedings of the National Academy of Sciences of the USA200910661720172410.1073/pnas.0806746106
- FrankOSurvey sampling in graphsJournal of Statistical Planning and Inference19771323526410.1016/0378-3758(77)90011-8
- FrankOSampling and estimation in large social networksSocial Networks1978119110110.1016/0378-8733(78)90015-1
- Frank D, Huang Z and Chyan A (2012). Sampling a large network: How small can my sample be? Project report for the course CS224W (Social and Information Network Analysis), Stanford University, http://snap.stanford.edu/class/cs224w-2012/projects/cs224w-036-final.pdf.
- GloverFKochenbergerGHandbook of Metaheuristics2003
- GoodmanLASnowball samplingAnnals of Mathematical Statistics196132114817010.1214/aoms/1177705148
- Hardiman SJ and Katzir L (2013). Estimating clustering coefficients and size of social networks via random walk. In: Proceedings of the 22nd International Conference on World Wide Web, Int. WWW Conf. Steering Committee, Geneva, Switzerland, pp 539–550.
- Kurant M, Gjoka M, Butts CT and Markopoulou A (2011). Walking on a graph with a magnifying glass: Stratified sampling via weighted random walks. In: Proceedings of the ACM SIGMETRICS Joint International Conference on Measurement and Modeling of Computer Systems, ACM, New York, pp 281–292.
- Leskovec J (2008). Dynamics of large networks. PhD Thesis, School of Computer Science, Carnegie-Mellon University: Pittsburgh, PA.
- Leskovec J and Faloutsos C (2006). Sampling from large graphs. In: Proceedings of the 12th ACM International Conference on Knowledge Discovery and Data Mining, ACM, New York, pp 631–636.
- Leskovec J, Kleinberg J and Faloutsos C (2005). Graphs over time: Densification laws, shrinking diameters and possible explanations. In: Proceedings of the 11th ACM International Conference on Knowledge Discovery and Data Mining, ACM, New York, pp 177–187.
- Lu J and Li D (2012). Sampling online social networks by random walk. In: Proceedings of the First ACM International Workshop on Hot Topics on Interdisciplinary Social Networks Research, ACM, New York, pp 33–40.
- Menges F, Mishra B and Narzisi G (2008). Modeling and simulation of e-mail social networks: A new stochastic agent-based approach. In: Proceedings of the 2008 Winter Simulation Conference, Winter Simulation Conference: Miami, FL.
- Okabayashi S (2011). Parameter estimation in social network models. PhD Thesis, Graduate School, University of Minnesota: Minneapolis.
- Pan W, Dong W, Cebrian M, Kim T, Fowler JH and Pentland A (2012). Modeling dynamical influence in human interaction. IEEE Signal Processing Magazine, March, pp 77–86.
- Pérez-Rosés H, Sebé F and Ribó JM (2014). Endorsement Deduction and Ranking in Social Networks. http://dpcs.uoc.edu/joomla/images/stories/workshop2013-resources/HebertP%C3%A9rez-Ros%C3%A9sFrancescSeb%C3%A9JosepMaRib%C3%B3-EndorsementDeduction.pdf, accessed 4 November 2014.
- Ribeiro B and Towsley D (2010). Estimating and sampling graphs with multidimensional random walks. In: Proceedings of the 10th ACM SIGCOMM Conference on Internet Measurement, ACM, New York, pp 390–403.
- Stocker R, Cornforth D and Bossomaier TRJ (2002). Network structures and agreement in social network simulations. Journal of Artificial Societies and Social Simulation 5 (4): 3.
- Wang T et al (2011). Understanding graph sampling algorithms for social network analysis. In: Proceedings of the 31st International Conference on Distributed Computing Systems Workshops, IEEE: Minneapolis, MN, pp 123–128.
![Supercharge Your Next Research Paper: Research and write your next paper with Jenni AI.]({"type":"image" , "src" : "/sda/112445/Skyscraper-econ.png"})