PubMed Health⌕ Search

Biomedical subjects

Petter Holme

Publications and source records attributed to Petter Holme.

16 recordsLinked to original sources

Detecting degree symmetries in networks.

The surrounding of a vertex in a network can be more or less symmetric. We derive measures of a specific kind of symmetry of a vertex which we call degree symmetry--the property that many paths going out from a vertex have overlapping degree sequences. These measures are evaluated on artificial and real networks. Specifically we consider vertices in the human metabolic network. We also measure the average degree-symmetry coefficient for different classes of real-world network. We find that most studied examples are weakly positively degree symmetric. The exceptions are an airport network (having a negative degree-symmetry coefficient) and one-mode projections of social affiliation networks that are rather strongly degree symmetric.

Algorithms↗

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.

Journal Article↗

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.

Animals↗

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. Among other things we conclude that geographically embedded transportation networks have a strong core-periphery structure. We proceed to study radial statistics of the core, i.e., properties of the 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 nontrivial network processes.

Journal Article↗

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

We propose a general method to predict functions of vertices where (i) the wiring of the network is somehow related to the vertex functionality and (ii) 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 are tested on model networks where 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.

Animals↗

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 tends to decrease the reachability, and that the order of the contacts really does make sense for dynamical spreading processes.

Journal Article↗

Networking the seceder model: Group formation in social and economic systems.

The seceder model illustrates how the desire to be different from 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 of our model closely match empirical social networks. Statistics for the dynamics of group formation are also given. Extensions of the model to networks of companies are also discussed.

Journal Article↗

Network bipartivity.

Systems with two types of agents with a preference for heterophilous interaction produce 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, and the other computationally less complex, but also less intuitive-are examined on model networks that continuously interpolate 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.

Journal Article↗

Prisoners' dilemma in real-world acquaintance networks: spikes and quasiequilibria 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 quasistable levels. A statistical characterization of the quasistable 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 similar complex time evolution of the cooperation level.

Journal Article↗

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 greater, similar 0.03.

Journal Article↗

Subnetwork hierarchies of biochemical pathways.

MOTIVATION: The vastness and complexity of the biochemical networks that have been mapped out by modern genomics calls for decomposition into subnetworks. Such networks can have inherent non-local features that require the global structure to be taken into account in the decomposition procedure. Furthermore, basic questions such as to what extent the network (graph theoretically) can be said to be built by distinct subnetworks are little studied. RESULTS: We present a method to decompose biochemical networks into subnetworks based on the global geometry of the network. This method enables us to analyze the full hierarchical organization of biochemical networks and is applied to 43 organisms from the WIT database. Two types of biochemical networks are considered: metabolic networks and whole-cellular networks (also including for example information processes). Conceptual and quantitative ways of describing the hierarchical ordering are discussed. The general picture of the metabolic networks arising from our study is that of a few core-clusters centred around the most highly connected substances enclosed by other substances in outer shells, and a few other well-defined subnetworks. AVAILABILITY: An implementation of our algorithm and other programs for analyzing the data is available from http://www.tp.umu.se/forskning/networks/meta/ SUPPLEMENTARY INFORMATION: Supplementary material is available at http://www.tp.umu.se/forskning/networks/meta/

Algorithms↗

Edge overload breakdown in evolving networks.

We investigate growing networks based on Barabási and Albert's algorithm for generating scale-free networks, but with edges sensitive to overload breakdown. The load is defined through edge betweenness centrality. We focus on the situation where the average number of connections per vertex is, like the number of vertices, linearly increasing in time. After an initial stage of growth, the network undergoes avalanching breakdowns to a fragmented state from which it never recovers. This breakdown is much less violent if the growth is by random rather than by preferential attachment (as defines the Barabási and Albert model). We briefly discuss the case where the average number of connections per vertex is constant. In this case no breakdown avalanches occur. Implications to the growth of real-world communication networks are discussed.

Journal Article↗

Dynamic instabilities induced by asymmetric influence: prisoners' dilemma game in small-world networks.

A two-dimensional small-world-type network, subject to spatial prisoners' dilemma dynamics and containing an influential node defined as a special node, with a finite density of directed random links to the other nodes in the network, is numerically investigated. It is shown that the degree of cooperation does not remain at a steady state level but displays a punctuated equilibrium-type behavior manifested by the existence of sudden breakdowns of cooperation. The breakdown of cooperation is linked to an imitation of a successful selfish strategy of the influential node. It is also found that while the breakdown of cooperation occurs suddenly, its recovery requires longer time. This recovery time may, depending on the degree of steady state cooperation, either increase or decrease with an increasing number of long-range connections.

Behavior↗

Vertex overload breakdown in evolving networks.

We study evolving networks based on the Barabási-Albert scale-free network model with vertices sensitive to overload breakdown. The load of a vertex is defined as the betweenness centrality of the vertex. Two cases of load limitation are considered, corresponding to the fact that the average number of connections per vertex is increasing with the network's size ("extrinsic communication activity"), or that it is constant ("intrinsic communication activity"). Avalanchelike breakdowns for both load limitations are observed. In order to avoid such avalanches we argue that the capacity of the vertices has to grow with the size of the system. An interesting irregular dynamics of the formation of the giant component (for the intrinsic communication activity case) is also studied. Implications on the growth of the Internet are discussed.

Journal Article↗

Attack vulnerability of complex networks.

We study the response of complex networks subject to attacks on vertices and edges. Several existing complex network models as well as real-world networks of scientific collaborations and Internet traffic are numerically investigated, and the network performance is quantitatively measured by the average inverse geodesic length and the size of the largest connected subgraph. For each case of attacks on vertices and edges, four different attacking strategies are used: removals by the descending order of the degree and the betweenness centrality, calculated for either the initial network or the current network during the removal procedure. It is found that the removals by the recalculated degrees and betweenness centralities are often more harmful than the attack strategies based on the initial network, suggesting that the network structure changes as important vertices or edges are removed. Furthermore, the correlation between the betweenness centrality and the degree in complex networks is studied.

Journal Article↗

Growing scale-free networks with tunable clustering.

We extend the standard scale-free network model to include a "triad formation step." We analyze the geometric properties of networks generated by this algorithm both analytically and by numerical calculations, and find that our model possesses the same characteristics as the standard scale-free networks such as the power-law degree distribution and the small average geodesic length, but with the high clustering at the same time. In our model, the clustering coefficient is also shown to be tunable simply by changing a control parameter---the average number of triad formation trials per time step.

Journal Article↗