Evolution of Coordination in Social Networks: A Numerical Study

Coordination games are important to explain efficient and desirable social behavior. Here we study these games by extensive numerical simulation on networked social structures using an evolutionary approach. We show that local network effects may promote selection of efficient equilibria in both pure and general coordination games and may explain social polarization. These results are put into perspective with respect to known theoretical results. The main insight we obtain is that clustering, and especially community structure in social networks has a positive role in promoting socially efficient outcomes.

Deciphering the global organization of clustering in real complex networks

We uncover the global organization of clustering in real complex networks. To this end, we ask whether triangles in real networks organize as in maximally random graphs with given degree and clustering distributions, or as in maximally ordered graph models where triangles are forced into modules. The answer comes by way of exploring m-core landscapes, where the m-core is defined, akin to the k-core, as the maximal subgraph with edges participating in at least m triangles. This property defines a set of nested subgraphs that, contrarily to k-cores, is able to distinguish between hierarchical and modular architectures. We find that the clustering organization in real networks is neither completely random nor ordered although, surprisingly, it is more random than modular. This supports the idea that the structure of real networks may in fact be the outcome of self-organized processes based on local optimization rules, in contrast to global optimization principles.

Efficiency of informational transfer in regular and complex networks

We analyze the process of informational exchange through complex networks by measuring network efficiencies. Aiming to study nonclustered systems, we propose a modification of this measure on the local level. We apply this method to an extension of the class of small worlds that includes declustered networks and show that they are locally quite efficient, although their clustering coefficient is practically zero. Unweighted systems with small-world and scale-free topologies are shown to be both globally and locally efficient. Our method is also applied to characterize weighted networks. In particular we examine the properties of underground transportation systems of Madrid and Barcelona and reinterpret the results obtained for the Boston subway network.

A Secure Cooperative Sensing Protocol for Cognitive Radio Networks

Cognitive radio networks sense spectrum occupancyand manage themselves to operate in unused bands without disturbing licensed users. Spectrum sensing is more accurate if jointly performed by several reliable nodes. Even though cooperative sensing is an active area of research, the secureauthentication of local sensing reports remains unsolved, thus empowering false results. This paper presents a distributed protocol based on digital signatures and hash functions, and ananalysis of its security features. The system allows determining a final sensing decision from multiple sources in a quick and secure way.

Local and Regional Scale Determinants of Biodiversity Patterns in Boreal Agricultural Landscapes

This thesis examines the local and regional scale determinants of biodiversity patterns using existing species and environmental data. The research focuses on agricultural environments that have experienced rapid declines of biodiversity during past decades. Existing digital databases provide vast opportunities for habitat mapping, predictive mapping of species occurrences and richness and understanding the speciesenvironment relationships. The applicability of these databases depends on the required accuracy and quality of the data needed to answer the landscape ecological and biogeographical questions in hand. Patterns of biodiversity arise from confounded effects of different factors, such as climate, land cover and geographical location. Complementary statistical approaches that can show the relative effects of different factors are needed in biodiversity analyses in addition to classical multivariate models. Better understanding of the key factors underlying the variation in diversity requires the analyses of multiple taxonomic groups from different perspectives, such as richness, occurrence, threat status and population trends. The geographical coincidence of species richness of different taxonomic groups can be rather limited. This implies that multiple geographical regions should be taken into account in order to preserve various groups of species. Boreal agricultural biodiversity and in particular, distribution and richness of threatened species is strongly associated with various grasslands. Further, heterogeneous agricultural landscapes characterized by moderate field size, forest patches and non-crop agricultural habitats enhance the biodiversity of rural environments. From the landscape ecological perspective, the major threats to Finnish agricultural biodiversity are the decline of connected grassland habitat networks, and general homogenization of landscape structure resulting from both intensification and marginalization of agriculture. The maintenance of key habitats, such as meadows and pastures is an essential task in conservation of agricultural biodiversity. Furthermore, a larger landscape context should be incorporated in conservation planning and decision making processes in order to respond to the needs of different species and to maintain heterogeneous rural landscapes and viable agricultural diversity in the future.

Local Services in a Fourth Generation Mobile Network

Neljännen sukupolven mobiiliverkot kokoaa kaikki tietoliikenneverkot ja palvelut Internetin ympärille. Tämä mullistus muuttaa vanhat vertikaaliset tietoliikenneverkot joissa yhden tietoliikenneverkon palvelut ovat saatavissa vain kyseisen verkon päätelaitteille horisontaaliseksi malliksi jossa päätelaitteet käyttävät omaa verkkoansa pääsynä Internetin palveluihin. Tämä diplomityö esittelee idean paikallisista palveluista neljännen sukupolven mobiiliverkossa. Neljännen sukupolven mobiiliverkko yhdistää perinteiset televerkkojen palvelut ja Internet palvelut sekä mahdollistaa uuden tyyppisten palveluiden luonnin. TCP/IP protokollien ja Internetin evoluutio on esitelty. Laajakaistaiset, lyhyen kantaman radiotekniikat joita käytetään langattomana yhteytenä Internetiin on käsitelty. Evoluutio kohti neljännen sukupolven mobiiliverkkoja on kuvattu esittelemällä vanhat, nykyiset ja tulevat mobiiliverkot sekä niiden palvelut. Ennustukset palveluiden ja markkinoiden tulevaisuuden kehityksestä on käsitelty. Neljännen sukupolven mobiiliverkon arkkitehtuuri mahdollistaa paikalliset palvelut jotka ovat saatavilla vain yhdessä paikallisessa 4G verkossa. Paikalliset palvelut voidaan muunnella jokaiselle käyttäjälle erikseen käyttäen profiili-informaatiota ja paikkatietoa. Työssä on pohdittu paikallisten palveluiden käyttökelpoisuutta ja mahdollisuuksia käyttäen Lappeenrannan teknillisen korkeakoulun 4G projektin palvelupilotin tuloksia.

Innovative milieu, micro firms and local development in Barcelona

Peer-reviewed

Towards open access networks – prototyping with the Lappeenranta model

The provision of Internet access to large numbers has traditionally been under the control of operators, who have built closed access networks for connecting customers. As the access network (i.e. the last mile to the customer) is generally the most expensive part of the network because of the vast amount of cable required, many operators have been reluctant to build access networks in rural areas. There are problems also in urban areas, as incumbent operators may use various tactics to make it difficult for competitors to enter the market. Open access networking, where the goal is to connect multiple operators and other types of service providers to a shared network, changes the way in which networks are used. This change in network structure dismantles vertical integration in service provision and enables true competition as no service provider can prevent others fromcompeting in the open access network. This thesis describes the development from traditional closed access networks towards open access networking and analyses different types of open access solution. The thesis introduces a new open access network approach (The Lappeenranta Model) in greater detail. The Lappeenranta Model is compared to other types of open access networks. The thesis shows that end users and service providers see local open access and services as beneficial. In addition, the thesis discusses open access networking in a multidisciplinary fashion, focusing on the real-world challenges of open access networks.

Consumo y convergencia mediática de la prensa local en Cataluña

Los nuevos hábitos de consumo de medios en el marco de la convergencia digital están propiciando un cambio en las estrategias de los medios de comunicación. Mientras unos usuarios siguen prefiriendo la radio, la televisión y la prensa tradicional para informarse otros participan de la experiencia digital en internet (blogs, redes sociales...) y dispositivos móviles, etc. En este panorama es complicado precisar dónde nace y termina el contenido o hasta qué punto es la participación del usuario quien (re) construye la información; así los contenidos mutan y se diluyen en varios soportes. En este contexto, la prensa local también vive las consecuencias del nuevo paradigma y asume los retos del reacomodo del sector ante la nueva realidad. Esta comunicación presenta las conclusiones del estudio cualitativo con entrevistas en profundidad a los responsables de medios locales en Cataluña sobre sus usuarios, contenidos y soportes en el marco de la convergencia digital.

Aligning Regional Repository Networks

Presentation at Open Repositories 2014, Helsinki, Finland, June 9-13, 2014

Niagara alternative food projects : networks, discourses and nature /

This thesis undertakes an exploration of the nature of alternative food projects in Niagara. A review of various theoretical approaches to the study of food and agriculture, suggests that actor-network theory offers the most useful lens through which to understand these projects. In particular, actor-network theory facilitates non-dualistic theorisations of power and scale and a commitment to the inclusion of non-humans in the 'social' sciences. The research is based on 19 in-depth interviews with actors involved in various urban and rural projects including community supported agriculture, community gardens, chefs using local seasonal food, a winery that grows organically, the good food box, a value-added small business, and organic producers. The analysis consists of four themes. The first analytical section pays special attention to the prominence of agri-tourism in Niagara, and examines the ways in which the projects in the sample interact with agri-tourist networks. In the second section the discussion focuses on the discourses and practices of resistance among Niagara alternative food actors. The participants' interviews suggest there are more discourses of resistance toward agri-tourist than toward dominant food networks. The third section questions commodity chain theorisations of alternative food projects. In particular, this section shows how the inclusion of non-human actors in an analysis confounds conceptualisations of 'short' and 'local' chains. The final analytical section assesses relations of power in Niagara alternative food projects. Three important conclusions arise from this research. First, Niagara alternative food projects cannot be conceptualised as operating at the 'local' scale. Broadening the scope of analysis to include non-human actors, it becomes apparent that these projects actually draw on a variety of extra-local actors. They are at once local and global. Second, the projects in this sample are simultaneously part of alternative, dominant and agri-tourist networks. While Niagara alternative food projects do perform many of the roles characteristic of alternative food systems, they are also involved in practices of development, business, and class distinction. Thus, alternative food networks should not be understood as separate from and in direct opposition to dominant food networks. Despite the second conclusion, this research determines that Niagara alternative food projects have made significant strides in the reworking of power. The projects represented in this thesis do engage in resistant practices and are associated with increased levels ofjustice.

Scales, networks and uncertainty : an examination of environmental policy-making in Ontario

Through a case-study analysis of Ontario's ethanol policy, this thesis addresses a number of themes that are consequential to policy and policy-making: spatiality, democracy and uncertainty. First, I address the 'spatial debate' in Geography pertaining to the relevance and affordances of a 'scalar' versus a 'flat' ontoepistemology. I argue that policy is guided by prior arrangements, but is by no means inevitable or predetermined. As such, scale and network are pragmatic geographical concepts that can effectively address the issue of the spatiality of policy and policy-making. Second, I discuss the democratic nature of policy-making in Ontario through an examination of the spaces of engagement that facilitate deliberative democracy. I analyze to what extent these spaces fit into Ontario's environmental policy-making process, and to what extent they were used by various stakeholders. Last, I take seriously the fact that uncertainty and unavoidable injustice are central to policy, and examine the ways in which this uncertainty shaped the specifics of Ontario's ethanol policy. Ultimately, this thesis is an exercise in understanding sub-national environmental policy-making in Canada, with an emphasis on how policy-makers tackle the issues they are faced with in the context of environmental change, political-economic integration, local priorities, individual goals, and irreducible uncertainty.

Heuristics for the Critical Node Detection Problem in Large Complex Networks

Complex networks have recently attracted a significant amount of research attention due to their ability to model real world phenomena. One important problem often encountered is to limit diffusive processes spread over the network, for example mitigating pandemic disease or computer virus spread. A number of problem formulations have been proposed that aim to solve such problems based on desired network characteristics, such as maintaining the largest network component after node removal. The recently formulated critical node detection problem aims to remove a small subset of vertices from the network such that the residual network has minimum pairwise connectivity. Unfortunately, the problem is NP-hard and also the number of constraints is cubic in number of vertices, making very large scale problems impossible to solve with traditional mathematical programming techniques. Even many approximation algorithm strategies such as dynamic programming, evolutionary algorithms, etc. all are unusable for networks that contain thousands to millions of vertices. A computationally efficient and simple approach is required in such circumstances, but none currently exist. In this thesis, such an algorithm is proposed. The methodology is based on a depth-first search traversal of the network, and a specially designed ranking function that considers information local to each vertex. Due to the variety of network structures, a number of characteristics must be taken into consideration and combined into a single rank that measures the utility of removing each vertex. Since removing a vertex in sequential fashion impacts the network structure, an efficient post-processing algorithm is also proposed to quickly re-rank vertices. Experiments on a range of common complex network models with varying number of vertices are considered, in addition to real world networks. The proposed algorithm, DFSH, is shown to be highly competitive and often outperforms existing strategies such as Google PageRank for minimizing pairwise connectivity.

La production de connaissances dans le cluster montréalais de l’aérospatiale. Le cas d’un réseau local d’innovation

L’importance que revêt la localisation des entreprises dans le fonctionnement et la compétitivité de celles-ci amène à porter l’attention sur la problématique des clusters et l’influence qu’ils peuvent avoir sur la production de connaissances. À travers une perspective théorique qui repose sur la prise en compte des travaux portant sur les districts industriels et ceux plus récents, sur les clusters, nous mettons en évidence une évolution conceptuelle du phénomène de la localisation des entreprises. La place qu’occupe la production de connaissances constitue désormais un élément central des travaux récents qui portent sur les districts et les clusters industriels. Notre examen des dynamiques de fonctionnement de ces systèmes permet d’affirmer que la production de connaissances est une caractéristique centrale des clusters ainsi que leur principal avantage compétitif. Étroitement liée aux réseaux inter-organisationnels, la production de connaissances n’est pas un phénomène naturel, elle découle des mécanismes intrinsèques aux clusters, qu’on cherche à mettre en évidence. Pour ce faire, notre méthodologie qui emprunte les principaux repères de l’analyse stratégique des organisations conduit à l’étude du fonctionnement concret d’un réseau local d’innovation, constitué d’entreprises et d’institutions locales présentes dans le cluster montréalais de l’aérospatiale. Un réseau constitué par l’intermédiaire du Consortium de Recherche et d’Innovation en Aérospatiale du Québec, une institution centrale dans le fonctionnement de ce cluster.

Belief Propagation and Revision in Networks with Loops

Local belief propagation rules of the sort proposed by Pearl(1988) are guaranteed to converge to the optimal beliefs for singly connected networks. Recently, a number of researchers have empirically demonstrated good performance of these same algorithms on networks with loops, but a theoretical understanding of this performance has yet to be achieved. Here we lay the foundation for an understanding of belief propagation in networks with loops. For networks with a single loop, we derive ananalytical relationship between the steady state beliefs in the loopy network and the true posterior probability. Using this relationship we show a category of networks for which the MAP estimate obtained by belief update and by belief revision can be proven to be optimal (although the beliefs will be incorrect). We show how nodes can use local information in the messages they receive in order to correct the steady state beliefs. Furthermore we prove that for all networks with a single loop, the MAP estimate obtained by belief revisionat convergence is guaranteed to give the globally optimal sequence of states. The result is independent of the length of the cycle and the size of the statespace. For networks with multiple loops, we introduce the concept of a "balanced network" and show simulati.