3 resultados para Social-space dynamics
em Academic Archive On-line (Stockholm University
Resumo:
This article explores transnational experiences within a group of Somali- Swedes, particularly how parents’ transnational practices are transferred to their children and how a transnational social space, built on close relationships on a global scale, is constructed. The readiness to relocate between countries and the implications for the children is illuminated. The onward migration to Egypt is highlighted as an example. According to research on Somalis in diaspora, they explain their propensity to move by claiming to be nomads, but this article indicates that it is also about their desire for better opportunities in combination with the cultural and economic marginalisation experienced in the West.
Resumo:
Two types of mesoscale wind-speed jet and their effects on boundary-layer structure were studied. The first is a coastal jet off the northern California coast, and the second is a katabatic jet over Vatnajökull, Iceland. Coastal regions are highly populated, and studies of coastal meteorology are of general interest for environmental protection, fishing industry, and for air and sea transportation. Not so many people live in direct contact with glaciers but properties of katabatic flows are important for understanding glacier response to climatic changes. Hence, the two jets can potentially influence a vast number of people. Flow response to terrain forcing, transient behavior in time and space, and adherence to simplified theoretical models were examined. The turbulence structure in these stably stratified boundary layers was also investigated. Numerical modeling is the main tool in this thesis; observations are used primarily to ensure a realistic model behavior. Simple shallow-water theory provides a useful framework for analyzing high-velocity flows along mountainous coastlines, but for an unexpected reason. Waves are trapped in the inversion by the curvature of the wind-speed profile, rather than by an infinite stability in the inversion separating two neutral layers, as assumed in the theory. In the absence of blocking terrain, observations of steady-state supercritical flows are not likely, due to the diurnal variation of flow criticality. In many simplified models, non-local processes are neglected. In the flows studied here, we showed that this is not always a valid approximation. Discrepancies between simulated katabatic flow and that predicted by an analytical model are hypothesized to be due to non-local effects, such as surface inhomogeneity and slope geometry, neglected in the theory. On a different scale, a reason for variations in the shape of local similarity scaling functions between studies is suggested to be differences in non-local contributions to the velocity variance budgets.
Resumo:
This thesis presents Bayesian solutions to inference problems for three types of social network data structures: a single observation of a social network, repeated observations on the same social network, and repeated observations on a social network developing through time. A social network is conceived as being a structure consisting of actors and their social interaction with each other. A common conceptualisation of social networks is to let the actors be represented by nodes in a graph with edges between pairs of nodes that are relationally tied to each other according to some definition. Statistical analysis of social networks is to a large extent concerned with modelling of these relational ties, which lends itself to empirical evaluation. The first paper deals with a family of statistical models for social networks called exponential random graphs that takes various structural features of the network into account. In general, the likelihood functions of exponential random graphs are only known up to a constant of proportionality. A procedure for performing Bayesian inference using Markov chain Monte Carlo (MCMC) methods is presented. The algorithm consists of two basic steps, one in which an ordinary Metropolis-Hastings up-dating step is used, and another in which an importance sampling scheme is used to calculate the acceptance probability of the Metropolis-Hastings step. In paper number two a method for modelling reports given by actors (or other informants) on their social interaction with others is investigated in a Bayesian framework. The model contains two basic ingredients: the unknown network structure and functions that link this unknown network structure to the reports given by the actors. These functions take the form of probit link functions. An intrinsic problem is that the model is not identified, meaning that there are combinations of values on the unknown structure and the parameters in the probit link functions that are observationally equivalent. Instead of using restrictions for achieving identification, it is proposed that the different observationally equivalent combinations of parameters and unknown structure be investigated a posteriori. Estimation of parameters is carried out using Gibbs sampling with a switching devise that enables transitions between posterior modal regions. The main goal of the procedures is to provide tools for comparisons of different model specifications. Papers 3 and 4, propose Bayesian methods for longitudinal social networks. The premise of the models investigated is that overall change in social networks occurs as a consequence of sequences of incremental changes. Models for the evolution of social networks using continuos-time Markov chains are meant to capture these dynamics. Paper 3 presents an MCMC algorithm for exploring the posteriors of parameters for such Markov chains. More specifically, the unobserved evolution of the network in-between observations is explicitly modelled thereby avoiding the need to deal with explicit formulas for the transition probabilities. This enables likelihood based parameter inference in a wider class of network evolution models than has been available before. Paper 4 builds on the proposed inference procedure of Paper 3 and demonstrates how to perform model selection for a class of network evolution models.