Umeå University's logo

umu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Form and function of complex networks
Umeå University, Faculty of Science and Technology, Department of Physics.ORCID iD: 0000-0003-2156-1096
2004 (English)Doctoral thesis, comprehensive summary (Other academic)Alternative title
Form och funktion i komplexa nätverk (Swedish)
Abstract [en]

Networks are all around us, all the time. From the biochemistry of our cells to the web of friendships across the planet. From the circuitry of modern electronics to chains of historical events. A network is the result of the forces that shaped it. Thus the principles of network formation can be, to some extent, deciphered from the network itself. All such information comprises the structure of the network. The study of network structure is the core of modern network science. This thesis centres around three aspects of network structure: What kinds of network structures are there and how can they be measured? How can we build models for network formation that give the structure of networks in the real world? How does the network structure affect dynamical systems confined to the networks? These questions are discussed using a variety of statistical, analytical and modelling techniques developed by physicists, mathematicians, biologists, chemists, psychologists, sociologists and anthropologists. My own research touches all three questions. In this thesis I present works trying to answer: What is the best way to protect a network against sinister attacks? How do groups form in friendship networks? Where do traffic jams appear in a communication network? How is cellular metabolism organised? How do Swedes flirt on the Internet? . . . and many other questions.

Place, publisher, year, edition, pages
Umeå: Umeå universitet , 2004. , p. 104
Keywords [en]
Theoretical physics, complex networks, complexity, small-world networks, scale-free networks, graph theory
Keywords [sv]
Teoretisk fysik
National Category
Physical Sciences
Research subject
Theoretical Physics
Identifiers
URN: urn:nbn:se:umu:diva-222ISBN: 91-7305-629-4 (print)OAI: oai:DiVA.org:umu-222DiVA, id: diva2:142716
Public defence
2004-05-07, N430, Naturvetarhuset, Umeå Universitet, Umeå, 14:00
Opponent
Supervisors
Available from: 2004-03-26 Created: 2004-03-26 Last updated: 2018-06-09Bibliographically approved
List of papers
1. Subnetwork hierarchies of biochemical pathways
Open this publication in new window or tab >>Subnetwork hierarchies of biochemical pathways
2003 (English)In: Bioinformatics, ISSN 1367-4803, E-ISSN 1367-4811, Vol. 19, no 4, p. 532-538Article in journal (Refereed) Published
Abstract [en]

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.

Identifiers
urn:nbn:se:umu:diva-3821 (URN)10.1093/bioinformatics/btg033 (DOI)
Available from: 2004-03-26 Created: 2004-03-26 Last updated: 2018-06-09Bibliographically approved
2. Network Bipartivity
Open this publication in new window or tab >>Network Bipartivity
2003 In: Physical Review E, ISSN 1063-651X, Vol. 68, no 5, p. 056107-Article in journal (Refereed) Published
Identifiers
urn:nbn:se:umu:diva-3822 (URN)
Available from: 2004-03-26 Created: 2004-03-26Bibliographically approved
3. Structure and time evolution of an Internet dating community
Open this publication in new window or tab >>Structure and time evolution of an Internet dating community
2004 (English)In: Social Networks, ISSN 0378-8733, E-ISSN 1879-2111, Vol. 26, no 2, p. 155-174Article in journal (Refereed) Published
Abstract [en]

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.

Place, publisher, year, edition, pages
Elsevier, 2004
Keywords
Internet community, time evolution, communication, complex networks
National Category
Social Sciences Interdisciplinary
Identifiers
urn:nbn:se:umu:diva-3823 (URN)10.1016/j.socnet.2004.01.007 (DOI)000221286300004 ()2-s2.0-1842661569 (Scopus ID)
Note

Previously included in thesis in manuscript form. 

Available from: 2004-03-26 Created: 2004-03-26 Last updated: 2022-03-11Bibliographically approved
4. Network dynamics of ongoing social relationships
Open this publication in new window or tab >>Network dynamics of ongoing social relationships
2003 In: Europhysics Letters, ISSN 0295-5075, Vol. 64, no 3, p. 427-433Article in journal (Refereed) Published
Identifiers
urn:nbn:se:umu:diva-3824 (URN)
Available from: 2004-03-26 Created: 2004-03-26Bibliographically approved
5. Growing scale-free networks with tunable clustering
Open this publication in new window or tab >>Growing scale-free networks with tunable clustering
2002 In: Physical Review E, ISSN 1063-651X, Vol. 65, no 2, p. 026107-Article in journal (Refereed) Published
Identifiers
urn:nbn:se:umu:diva-3825 (URN)
Available from: 2004-03-26 Created: 2004-03-26Bibliographically approved
6. Networking the seceder model: group formation in social and economic systems
Open this publication in new window or tab >>Networking the seceder model: group formation in social and economic systems
2004 (English)In: Physical Review E. Statistical, Nonlinear, and Soft Matter Physics: Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics, ISSN 1063-651X, E-ISSN 1095-3787, Vol. 70, no 3, p. 036108-Article in journal (Refereed) Published
Abstract [en]

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.

National Category
Physical Sciences
Identifiers
urn:nbn:se:umu:diva-5186 (URN)10.1103/PhysRevE.70.036108 (DOI)2-s2.0-42749102413 (Scopus ID)
Available from: 2006-05-12 Created: 2006-05-12 Last updated: 2023-03-23Bibliographically approved
7. Attack vulnerability of complex networks
Open this publication in new window or tab >>Attack vulnerability of complex networks
2002 In: Physical Review E, ISSN 1063-651X, Vol. 65, no 5, p. 056109-Article in journal (Refereed) Published
Identifiers
urn:nbn:se:umu:diva-3827 (URN)
Available from: 2004-03-26 Created: 2004-03-26Bibliographically approved
8. Efficient local strategies for vaccination and network attack
Open this publication in new window or tab >>Efficient local strategies for vaccination and network attack
2004 (English)In: Europhysics letters, ISSN 0295-5075, E-ISSN 1286-4854, Vol. 68, no 6, p. 908-914Article in journal (Refereed) Published
Abstract [en]

We study how a fraction of a population should be vaccinated to most efficiently stop epidemics. Our starting point is that only local information -about the neighborhood of specific vertices- is usable in practice. For this reason we consider only local vaccination strategies. The efficiency of the vaccination strategies is investigated with both static and dynamic measures. We test the strategies on real-world networks and model networks with real-world characteristics. 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 the most links out of the neighborhood.

Place, publisher, year, edition, pages
Institute of Physics (IOP), 2004
National Category
Physical Sciences
Identifiers
urn:nbn:se:umu:diva-3828 (URN)10.1209/epl/i2004-10286-2 (DOI)000226508000023 ()2-s2.0-10944269222 (Scopus ID)
Note

Originally published in thesis in manuscript form.

Available from: 2004-03-26 Created: 2004-03-26 Last updated: 2022-03-25Bibliographically approved
9. Vertex overload breakdown in evolving networks
Open this publication in new window or tab >>Vertex overload breakdown in evolving networks
2002 In: Physical Review E, ISSN 1063-651X, Vol. 65, no 6, p. 066109-Article in journal (Refereed) Published
Identifiers
urn:nbn:se:umu:diva-3829 (URN)
Available from: 2004-03-26 Created: 2004-03-26Bibliographically approved
10. Edge overload breakdown in evolving networks
Open this publication in new window or tab >>Edge overload breakdown in evolving networks
2002 In: Physical Review E, ISSN 1063-651X, Vol. 66, no 3, p. 036119-Article in journal (Refereed) Published
Identifiers
urn:nbn:se:umu:diva-3830 (URN)
Available from: 2004-03-26 Created: 2004-03-26Bibliographically approved
11. XY model in small-world networks
Open this publication in new window or tab >>XY model in small-world networks
Show others...
2001 In: Physical Review E, ISSN 1063-651X, Vol. 64, no 5, p. 056135-Article in journal (Refereed) Published
Identifiers
urn:nbn:se:umu:diva-3831 (URN)
Available from: 2004-03-26 Created: 2004-03-26Bibliographically approved
12. Dynamic critical behavior of the XY model in small-world networks
Open this publication in new window or tab >>Dynamic critical behavior of the XY model in small-world networks
2003 (English)In: Physical Review E. Statistical, Nonlinear, and Soft Matter Physics: Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics, ISSN 1063-651X, E-ISSN 1095-3787, Vol. 67, no 3, p. 036118-Article in journal (Refereed) Published
Abstract [en]

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.

Place, publisher, year, edition, pages
American Physical Society, 2003
National Category
Physical Sciences
Identifiers
urn:nbn:se:umu:diva-2145 (URN)10.1103/PhysRevE.67.036118 (DOI)2-s2.0-85037232477 (Scopus ID)
Available from: 2003-09-15 Created: 2003-09-15 Last updated: 2023-03-23Bibliographically approved
13. Congestion and centrality in traffic flow on complex networks
Open this publication in new window or tab >>Congestion and centrality in traffic flow on complex networks
2003 In: Advances in Complex Systems, ISSN 0219-5259, Vol. 6, no 2, p. 163-176Article in journal (Refereed) Published
Identifiers
urn:nbn:se:umu:diva-3833 (URN)
Available from: 2004-03-26 Created: 2004-03-26Bibliographically approved
14. Dynamic instabilities induced by asymmetric influence: Prisoners' dilemma game in small-world networks
Open this publication in new window or tab >>Dynamic instabilities induced by asymmetric influence: Prisoners' dilemma game in small-world networks
Show others...
2002 In: Physical Review E, ISSN 1063-651X, Vol. 66, no 2, p. 021907-Article in journal (Refereed) Published
Identifiers
urn:nbn:se:umu:diva-3834 (URN)
Available from: 2004-03-26 Created: 2004-03-26Bibliographically approved
15. Prisoners' dilemma in real-world acquaintance networks: Spikes and quasiequilibria induced by the interplay between structure and dynamics
Open this publication in new window or tab >>Prisoners' dilemma in real-world acquaintance networks: Spikes and quasiequilibria induced by the interplay between structure and dynamics
2003 In: Physical Review E, ISSN 1063-651X, Vol. 68, no 3, p. 030901-Article in journal (Refereed) Published
Identifiers
urn:nbn:se:umu:diva-3835 (URN)
Available from: 2004-03-26 Created: 2004-03-26Bibliographically approved

Open Access in DiVA

fulltext(889 kB)5399 downloads
File information
File name FULLTEXT01.pdfFile size 889 kBChecksum SHA-1
05a7d2ddbcc9ae5a935f6ec2469947b62ea49ea627cdd11581d29eeb2f9ab73fd3dae0fe
Type fulltextMimetype application/pdf

Authority records

Holme, Petter

Search in DiVA

By author/editor
Holme, Petter
By organisation
Department of Physics
Physical Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 5399 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 4615 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf