arXiv subjects

Petter Holme

Publications and source records attributed to Petter Holme.

At least 145 records · Page 8Linked to original sources

arXiv2005

Dynamics of networking agents competing for high centrality and low degree

We model a system of networking agents that seek to optimize their centrality in the network while keeping their cost, the number of connections they are participating in, low. Unlike other game-theory based models for network evolution, the success of the agents is related only to their position in the network. The agents use strategies based on local information to improve their chance of success. Both the evolution of strategies and network structure are investigated. We find a dramatic time evolution with cascades of strategy change accompanied by a change in network structure. On average the network self-organizes to a state close to the transition between a fragmented state and a state with a giant component. Furthermore, with increasing system size both the average degree and the level of fragmentation decreases. We also observe that the network keeps on actively evolving, although it does not have to, thus suggesting a Red Queen-like situation where agents have to keep on networking and responding to the moves of the others in order to stay successful.

q-bio.PE↗

arXiv2005

Vertex similarity in networks

We consider methods for quantifying the similarity of vertices in networks. We propose a measure of similarity based on the concept that two vertices are similar if their immediate neighbors in the network are themselves similar. This leads to a self-consistent matrix formulation of similarity that can be evaluated iteratively using only a knowledge of the adjacency matrix of the network. We test our similarity measure on computer-generated networks for which the expected results are known, and on a number of real-world networks.

physics.soc-ph↗

arXiv2005

Core-periphery organization of complex networks

Networks may, or may not, be wired to have a core that is both itself densely connected and central in terms of graph distance. In this study we propose a coefficient to measure if the network has such a clear-cut core-periphery dichotomy. We measure this coefficient for a number of real-world and model networks and find that different classes of networks have their characteristic values. For example do geographical networks have a strong core-periphery structure, while the core-periphery structure of social networks (despite their positive degree-degree correlations) is rather weak. We proceed to study radial statistics of the core, i.e. properties of the n-neighborhoods of the core vertices for increasing n. We find that almost all networks have unexpectedly many edges within n-neighborhoods at a certain distance from the core suggesting an effective radius for non-trivial network processes.

physics.soc-ph↗

arXiv2005

The contact network of patients in a regional healthcare system

Yet in spite of advances in hospital treatment, hospitals continue to be a breeding ground for several airborne diseases and for diseases that are transmitted through close contacts like SARS, methicillin-resistant Staphylococcus aureus (MRSA), norovirus infections and tuberculosis (TB). Here we extract contact networks for up to 295,108 inpatients for durations up to two years from a database used for administrating a local public healthcare system serving a population of 1.9 million individuals. Structural and dynamical properties of the network of importance for the transmission of contagious diseases are then analyzed by methods from network epidemiology. The contact networks are found to be very much determined by an extreme (age independent) variation in duration of hospital stays and the hospital structure. We find that that the structure of contacts between in-patients exhibit structural properties, such as a high level of transitivity, assortativity and variation in number of contacts, that are likely to be of importance for the transmission of less contagious diseases. If these properties are considered when designing prevention programs the risk for and the effect of epidemic outbreaks may be decreased.

q-bio.OT↗

arXiv2005

A network-based threshold model for the spreading of fads in society and markets

We investigate the behavior of a threshold model for the spreading of fads and similar phenomena in society. The model is giving the fad dynamics and is intended to be confined to an underlying network structure. We investigate the whole parameter space of the fad dynamics on three types of network models. The dynamics we discover is rich and highly dependent on the underlying network structure. For some range of the parameter space, for all types of substrate networks, there are a great variety of sizes and life-lengths of the fads -- what one see in real-world social and economical systems.

physics.soc-ph↗

arXiv2005

Modelling the dynamics of youth subcultures

What are the dynamics behind youth subcultures such as punk, hippie, or hip-hop cultures? How does the global dynamics of these subcultures relate to the individual's search for a personal identity? We propose a simple dynamical model to address these questions and find that only a few assumptions of the individual's behaviour are necessary to regenerate known features of youth culture.

physics.soc-ph↗

arXiv2005

Attractiveness and activity in Internet communities

Datasets of online communication often take the form of contact sequences -- ordered lists contacts (where a contact is defined as a triple of a sender, a recipient and a time). We propose measures of attractiveness and activity for such data sets and analyze these quantities for anonymized contact sequences from an Internet dating community. For this data set the attractiveness and activity measures show broad power-law like distributions. Our attractiveness and activity measures are more strongly correlated in the real-world data than in our reference model. Effects that indirectly can make active users more attractive are discussed.

physics.soc-ph↗

arXiv2005

Role-similarity based functional prediction in networked systems: Application to the yeast proteome

We propose a general method to predict functions of vertices where: 1. The wiring of the network is somehow related to the vertex functionality. 2. A fraction of the vertices are functionally classified. The method is influenced by role-similarity measures of social network analysis. The two versions of our prediction scheme is tested on model networks were the functions of the vertices are designed to match their network surroundings. We also apply these methods to the proteome of the yeast Saccharomyces cerevisiae and find the results compatible with more specialized methods.

q-bio.MN↗

arXiv2004

Korean university life in a network perspective: Dynamics of a large affiliation network

We investigate course registration data of 18 semesters at a Korean University to portray the time evolution of students' positions in the network of fellow students. Apart from being a study of the social positions of students, the present work is also an example of how large-scale, time resolved, affiliation networks can be analyzed. For example we discuss the proper definitions of weights, and propose a redefined weighted clustering coefficient. Among other things, we find that the students enter the network at the center and are gradually diffusing towards the periphery. On the other hand, the ties to the classmates of the first semester (still present at the university) will, on average, become stronger as time progresses.

cond-mat.other↗

arXiv2004

Network reachability of real-world contact sequences

We use real-world contact sequences, time-ordered lists of contacts from one person to another, to study how fast information or disease can spread across network of contacts. Specifically we measure the reachability time -- the average shortest time for a series of contacts to spread information between a reachable pair of vertices (a pair where a chain of contacts exists leading from one person to the other) -- and the reachability ratio -- the fraction of reachable vertex pairs. These measures are studied using conditional uniform graph tests. We conclude, among other things, that the network reachability depends much on a core where the path lengths are short and communication frequent, that clustering of the contacts of an edge in time tend to decrease the reachability, and that the order of the contacts really do make sense for dynamical spreading processes.

cond-mat.other↗

arXiv2004

Efficient local strategies for vaccination and network attack

We study how a fraction of a population should be vaccinated to most efficiently top epidemics. We argue that only local information (about the neighborhood of specific vertices) is usable in practice, and hence we consider only local vaccination strategies. The efficiency of the vaccination strategies is investigated with both static and dynamical measures. Among other things we find that the most efficient strategy for many real-world situations is to iteratively vaccinate the neighbor of the previous vaccinee that has most links out of the neighborhood.

q-bio.PE↗

arXiv2003

The networked seceder model: Group formation in social and economic systems

The seceder model illustrates how the desire to be different than the average can lead to formation of groups in a population. We turn the original, agent based, seceder model into a model of network evolution. We find that the structural characteristics our model closely matches empirical social networks. Statistics for the dynamics of group formation are also given. Extensions of the model to networks of companies are also discussed.

cond-mat.dis-nn↗

arXiv2003

Structure and Time-Evolution of an Internet Dating Community

We present statistics for the structure and time-evolution of a network constructed from user activity in an Internet community. The vastness and precise time resolution of an Internet community offers unique possibilities to monitor social network formation and dynamics. Time evolution of well-known quantities, such as clustering, mixing (degree-degree correlations), average geodesic length, degree, and reciprocity is studied. In contrast to earlier analyses of scientific collaboration networks, mixing by degree between vertices is found to be disassortative. Furthermore, both the evolutionary trajectories of the average geodesic length and of the clustering coefficients are found to have minima.

cond-mat.dis-nn↗

arXiv2003

Discovery and analysis of biochemical subnetwork hierarchies

The representation of a biochemical network as a graph is the coarsest level of description in cellular biochemistry. By studying the network structure one can draw conclusions on the large scale organisation of the biochemical processes. We describe methods how one can extract hierarchies of subnetworks, how these can be interpreted and further deconstructed to find autonomous subnetworks. The large-scale organisation we find is characterised by a tightly connected core surrounded by increasingly loosely connected substrates.

q-bio.MN↗

arXiv2003

Network dynamics of ongoing social relationships

Many recent large-scale studies of interaction networks have focused on networks of accumulated contacts. In this paper we explore social networks of ongoing relationships with an emphasis on dynamical aspects. We find a distribution of response times (times between consecutive contacts of different direction between two actors) that has a power-law shape over a large range. We also argue that the distribution of relationship duration (the time between the first and last contacts between actors) is exponentially decaying. Methods to reanalyze the data to compensate for the finite sampling time are proposed. We find that the degree distribution for networks of ongoing contacts fits better to a power-law than the degree distribution of the network of accumulated contacts do. We see that the clustering and assortative mixing coefficients are of the same order for networks of ongoing and accumulated contacts, and that the structural fluctuations of the former are rather large.

cond-mat.dis-nn↗

arXiv2003

Prisoners' dilemma in real-world acquaintance networks: Spikes and quasi-equilibria induced by the interplay between structure and dynamics

We study Nowak and May's spatial prisoners' dilemma game driven by mutations (random choices of suboptimal strategies) on empirical social networks. The time evolution of the cooperation level is highly complex containing spikes and steps between quasi-stable levels. A statistical characterization of the quasi-stable states and a study of the mechanisms behind the steps are given. We argue that the crucial structural ingredients causing the observed behavior is an inhomogeneous degree distribution and that the connections within vertices of highest degree are rather sparse. Based on these observations we construct model networks with a similarly complex time-evolution of the cooperation level.

cond-mat.dis-nn↗

arXiv2003

On network bipartivity

Systems with two types of agents with a preference for heterophilous interaction produces networks that are more or less close to bipartite. We propose two measures quantifying the notion of bipartivity. The two measures--one well-known and natural, but computationally intractable; one computationally less complex, but also less intuitive--are examined on model networks that continuously interpolates between bipartite graphs and graphs with many odd circuits. We find that the bipartivity measures increase as we tune the control parameters of the test networks to intuitively increase the bipartivity, and thus conclude that the measures are quite relevant. We also measure and discuss the values of our bipartivity measures for empirical social networks (constructed from professional collaborations, Internet communities and field surveys). Here we find, as expected, that networks arising from romantic online interaction have high, and professional collaboration networks have low bipartivity values. In some other cases, probably due to low average degree of the network, the bipartivity measures cannot distinguish between romantic and friendship oriented interaction.

cond-mat.dis-nn↗

arXiv2003

Dynamic critical behavior of the XY model in small-world networks

The critical behavior of the XY model on small-world network is investigated by means of dynamic Monte Carlo simulations. We use the short-time relaxation scheme, i.e., the critical behavior is studied from the nonequilibrium relaxation to equilibrium. Static and dynamic critical exponents are extracted through the use of the dynamic finite-size scaling analysis. It is concluded that the dynamic universality class at the transition is of the mean-field nature. We also confirm numerically that the value of dynamic critical exponent is independent of the rewiring probability P for P > 0.03.

cond-mat.dis-nn↗