Graph Theory and Social Networks Tutorial

For COMP60

On social networks and game theory, some research problems

Seminar given as part of social networking course, to give a brief overview of some applied examples game theory used in social network simulation

CIP Online Social Networks: week 5 - social capital

Lecture slides for the Curriculum Innovation module Online Social Networks on the topic of social capital.

Las redes sociales como herramienta de participación política en la campaña del Movimiento Cinco Estrellas de Beppe Grillo en Italia. 2012-2013

El interés de este estudio de caso es analizar el rol que desempeñaron las redes sociales en la campaña al parlamento del Movimiento 5 Estrellas en Italia. Esta investigación explica cómo la introducción de nuevas tecnologías en el ámbito político ha configurado un nuevo orden cultural y ha facilitado el acceso de los ciudadanos a la participación en la vida política. A partir del seguimiento del manejo que le dio el movimiento a las redes sociales en la campaña, la percepción del desarrollo de las redes de autores como Ivoskus y Castells y el análisis de contenidos de los medios más relevantes en Italia, la investigación fluye hasta identificar cuáles fueron las características que permitieron que un mecanismo de comunicación, como las redes sociales, pudiera transformarse en una herramienta de participación política.

Social networks and performance in knowledge creation. An application and a methodological proposal

El objetivo de esta tesis es predecir el rendimiento de los estudiantes de doctorado en la Universidad de Girona según características personales (background), actitudinales y de redes sociales de los estudiantes. La población estudiada son estudiantes de tercer y cuarto curso de doctorado y sus directores de tesis doctoral. Para obtener los datos se ha diseño un cuestionario web especificando sus ventajas y teniendo en cuenta algunos problemas tradicionales de no cobertura o no respuesta. El cuestionario web se hizo debido a la complejidad que comportan de las preguntas de red social. El cuestionario electrónico permite, mediante una serie de instrucciones, reducir el tiempo para responder y hacerlo menos cargado. Este cuestionario web, además es auto administrado, lo cual nos permite, según la literatura, unas respuestas mas honestas que cuestionario con encuestador. Se analiza la calidad de las preguntas de red social en cuestionario web para datos egocéntricos. Para eso se calcula la fiabilidad y la validez de este tipo de preguntas, por primera vez a través del modelo Multirasgo Multimétodo (Multitrait Multimethod). Al ser datos egocéntricos, se pueden considerar jerárquicos, y por primera vez se una un modelo Multirasgo Multimétodo Multinivel (multilevel Multitrait Multimethod). Las la fiabilidad y validez se pueden obtener a nivel individual (within group component) o a nivel de grupo (between group component) y se usan para llevar a cabo un meta-análisis con otras universidades europeas para analizar ciertas características de diseño del cuestionario. Estas características analizan si para preguntas de red social hechas en cuestionarios web son más fiables y validas hechas "by questions" o "by alters", si son presentes todas las etiquetas de frecuencia para los ítems o solo la del inicio y final, o si es mejor que el diseño del cuestionario esté en con color o blanco y negro. También se analiza la calidad de la red social en conjunto, en este caso específico son los grupos de investigación de la universidad. Se tratan los problemas de los datos ausentes en las redes completas. Se propone una nueva alternativa a la solución típica de la red egocéntrica o los respondientes proxies. Esta nueva alternativa la hemos nombrado "Nosduocentered Network" (red Nosduocentrada), se basa en dos actores centrales en una red. Estimando modelos de regresión, esta "Nosduocentered network" tiene mas poder predictivo para el rendimiento de los estudiantes de doctorado que la red egocéntrica. Además se corrigen las correlaciones de las variables actitudinales por atenuación debido al pequeño tamaño muestral. Finalmente, se hacen regresiones de los tres tipos de variables (background, actitudinales y de red social) y luego se combinan para analizar cual para predice mejor el rendimiento (según publicaciones académicas) de los estudiantes de doctorado. Los resultados nos llevan a predecir el rendimiento académico de los estudiantes de doctorado depende de variables personales (background) i actitudinales. Asimismo, se comparan los resultados obtenidos con otros estudios publicados.

Inclusion, social networks and resilience: strategies, practices and outcomes for disabled children and their families

This paper explores the strategies of service providers and the benefits reported by disabled children and their parents/carers in three Children's Fund programmes in England. Based on National Evaluation of the Children's Fund research, we discuss how different understandings of ‘inclusion’ informed the diverse strategies and approaches service providers adopted. While disabled children and families perceived the benefits of services predominantly in terms of building individual children's resilience and social networks, the paper highlights the need for holistic approaches which have a broad view of inclusion, support children's networks and tackle disabling barriers within all the spheres of children's lives.

Dynamics of brand competition: Effects of unobserved social networks

Brand competition is modelled using an agent based approach in order to examine the long run dynamics of market structure and brand characteristics. A repeated game is designed where myopic firms choose strategies based on beliefs about their rivals and consumers. Consumers are heterogeneous and can observe neighbour behaviour through social networks. Although firms do not observe them, the social networks have a significant impact on the emerging market structure. Presence of networks tends to polarize market share and leads to higher volatility in brands. Yet convergence in brand characteristics usually happens whenever the market reaches a steady state. Scale-free networks accentuate the polarization and volatility more than small world or random networks. Unilateral innovations are less frequent under social networks.

Social networks and positive and negative affect

We followed 100 university students in the UK for one week, instructing them to record all face-to-face, phone and digital contacts during the day as well as their positive and negative affect. We wanted to see how positive and negative affect spread around a social network while taking into account participants’ socio-demographic data, personality, general health and gratitude scores. We focused on the participants’ connections with those in their class; excluding friends and family outside this group. The data was analysed using actor-based models implemented in SIENA. Results show differences between positive and negative affect dynamics in this environment and an influence of personality traits on the average number and rate of communication.

Social networks: evolving graphs with memory dependent edges

The plethora, and mass take up, of digital communication tech- nologies has resulted in a wealth of interest in social network data collection and analysis in recent years. Within many such networks the interactions are transient: thus those networks evolve over time. In this paper we introduce a class of models for such networks using evolving graphs with memory dependent edges, which may appear and disappear according to their recent history. We consider time discrete and time continuous variants of the model. We consider the long term asymptotic behaviour as a function of parameters controlling the memory dependence. In particular we show that such networks may continue evolving forever, or else may quench and become static (containing immortal and/or extinct edges). This depends on the ex- istence or otherwise of certain infinite products and series involving age dependent model parameters. To test these ideas we show how model parameters may be calibrated based on limited samples of time dependent data, and we apply these concepts to three real networks: summary data on mobile phone use from a developing region; online social-business network data from China; and disaggregated mobile phone communications data from a reality mining experiment in the US. In each case we show that there is evidence for memory dependent dynamics, such as that embodied within the class of models proposed here.

Evolving social networks, attitudes and beliefs and counter terrorism

'The Princeton Companion to Applied Mathematics' is an introduction to applied mathematics for students, teachers, and professionals. This article is for the "Application Areas" part of the book, which comprises articles on connections between applied mathematics and other disciplines.

Bayesian parameter estimation for latent Markov random fields and social networks

Undirected graphical models are widely used in statistics, physics and machine vision. However Bayesian parameter estimation for undirected models is extremely challenging, since evaluation of the posterior typically involves the calculation of an intractable normalising constant. This problem has received much attention, but very little of this has focussed on the important practical case where the data consists of noisy or incomplete observations of the underlying hidden structure. This paper specifically addresses this problem, comparing two alternative methodologies. In the first of these approaches particle Markov chain Monte Carlo (Andrieu et al., 2010) is used to efficiently explore the parameter space, combined with the exchange algorithm (Murray et al., 2006) for avoiding the calculation of the intractable normalising constant (a proof showing that this combination targets the correct distribution in found in a supplementary appendix online). This approach is compared with approximate Bayesian computation (Pritchard et al., 1999). Applications to estimating the parameters of Ising models and exponential random graphs from noisy data are presented. Each algorithm used in the paper targets an approximation to the true posterior due to the use of MCMC to simulate from the latent graphical model, in lieu of being able to do this exactly in general. The supplementary appendix also describes the nature of the resulting approximation.