173,988 research outputs found

    The Web as an Adaptive Network: Coevolution of Web Behavior and Web Structure

    No full text
    Much is known about the complex network structure of the Web, and about behavioral dynamics on the Web. A number of studies address how behaviors on the Web are affected by different network topologies, whilst others address how the behavior of users on the Web alters network topology. These represent complementary directions of influence, but they are generally not combined within any one study. In network science, the study of the coupled interaction between topology and behavior, or state-topology coevolution, is known as 'adaptive networks', and is a rapidly developing area of research. In this paper, we review the case for considering the Web as an adaptive network and several examples of state-topology coevolution on the Web. We also review some abstract results from recent literature in adaptive networks and discuss their implications for Web Science. We conclude that adaptive networks provide a formal framework for characterizing processes acting 'on' and 'of' the Web, and offers potential for identifying general organizing principles that seem otherwise illusive in Web Scienc

    Identifying communities by influence dynamics in social networks

    Full text link
    Communities are not static; they evolve, split and merge, appear and disappear, i.e. they are product of dynamical processes that govern the evolution of the network. A good algorithm for community detection should not only quantify the topology of the network, but incorporate the dynamical processes that take place on the network. We present a novel algorithm for community detection that combines network structure with processes that support creation and/or evolution of communities. The algorithm does not embrace the universal approach but instead tries to focus on social networks and model dynamic social interactions that occur on those networks. It identifies leaders, and communities that form around those leaders. It naturally supports overlapping communities by associating each node with a membership vector that describes node's involvement in each community. This way, in addition to overlapping communities, we can identify nodes that are good followers to their leader, and also nodes with no clear community involvement that serve as a proxy between several communities and are equally as important. We run the algorithm for several real social networks which we believe represent a good fraction of the wide body of social networks and discuss the results including other possible applications.Comment: 10 pages, 6 figure

    Community Detection in Quantum Complex Networks

    Full text link
    Determining community structure is a central topic in the study of complex networks, be it technological, social, biological or chemical, in static or interacting systems. In this paper, we extend the concept of community detection from classical to quantum systems---a crucial missing component of a theory of complex networks based on quantum mechanics. We demonstrate that certain quantum mechanical effects cannot be captured using current classical complex network tools and provide new methods that overcome these problems. Our approaches are based on defining closeness measures between nodes, and then maximizing modularity with hierarchical clustering. Our closeness functions are based on quantum transport probability and state fidelity, two important quantities in quantum information theory. To illustrate the effectiveness of our approach in detecting community structure in quantum systems, we provide several examples, including a naturally occurring light-harvesting complex, LHCII. The prediction of our simplest algorithm, semiclassical in nature, mostly agrees with a proposed partitioning for the LHCII found in quantum chemistry literature, whereas our fully quantum treatment of the problem uncovers a new, consistent, and appropriately quantum community structure.Comment: 16 pages, 4 figures, 1 tabl

    Complex networks analysis in socioeconomic models

    Full text link
    This chapter aims at reviewing complex networks models and methods that were either developed for or applied to socioeconomic issues, and pertinent to the theme of New Economic Geography. After an introduction to the foundations of the field of complex networks, the present summary adds insights on the statistical mechanical approach, and on the most relevant computational aspects for the treatment of these systems. As the most frequently used model for interacting agent-based systems, a brief description of the statistical mechanics of the classical Ising model on regular lattices, together with recent extensions of the same model on small-world Watts-Strogatz and scale-free Albert-Barabasi complex networks is included. Other sections of the chapter are devoted to applications of complex networks to economics, finance, spreading of innovations, and regional trade and developments. The chapter also reviews results involving applications of complex networks to other relevant socioeconomic issues, including results for opinion and citation networks. Finally, some avenues for future research are introduced before summarizing the main conclusions of the chapter.Comment: 39 pages, 185 references, (not final version of) a chapter prepared for Complexity and Geographical Economics - Topics and Tools, P. Commendatore, S.S. Kayam and I. Kubin Eds. (Springer, to be published

    Quantitative Analysis of Bloggers Collective Behavior Powered by Emotions

    Full text link
    Large-scale data resulting from users online interactions provide the ultimate source of information to study emergent social phenomena on the Web. From individual actions of users to observable collective behaviors, different mechanisms involving emotions expressed in the posted text play a role. Here we combine approaches of statistical physics with machine-learning methods of text analysis to study emergence of the emotional behavior among Web users. Mapping the high-resolution data from digg.com onto bipartite network of users and their comments onto posted stories, we identify user communities centered around certain popular posts and determine emotional contents of the related comments by the emotion-classifier developed for this type of texts. Applied over different time periods, this framework reveals strong correlations between the excess of negative emotions and the evolution of communities. We observe avalanches of emotional comments exhibiting significant self-organized critical behavior and temporal correlations. To explore robustness of these critical states, we design a network automaton model on realistic network connections and several control parameters, which can be inferred from the dataset. Dissemination of emotions by a small fraction of very active users appears to critically tune the collective states
    • …
    corecore