Konstantin Klemm

Konstantin Klemm

Auto-generated profile, based on publicly available information

Konstantin Klemm

Center for Chaos and Turbulence Studies, Niels Bohr Institute, Blegdamsvej 17, DK-2100 Copenhagen Ø, Denmark

Research Focus & Metrics

Academic Career Length

26Years (2001-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
21 February 2002 in Physical Review E
Verified
Journal Article
Closed access
PDF file
KKKonstantin Klemm
Konstantin Klemm
VEVíctor M. Eguíluz
Víctor M. Eguíluz
We propose a model for growing networks based on a finite memory of the nodes. The model shows stylized features of real-world networks: power-law distribution of degree, linear preferential attachment of new links, and a negative correlation between the age of a node and its link attachment rate. Notably, the degree distribution is conserved even though only the most recently grown part of the network is considered. As the network grows, the clustering reaches an asymptotic value larger than that for regular lattices of the same average connectivity and similar to the one observed in the networks of movie actors, coauthorship in science, and word synonyms. These highly clustered scale-free networks indicate that memory effects are crucial for a correct description of the dynamics of growing networks.

8 May 2002 in Physical Review E
Verified
Journal Article
Closed access
PDF file
KKKonstantin Klemm
Konstantin Klemm
VEVíctor M. Eguíluz
Víctor M. Eguíluz
In the context of growing networks, we introduce a simple dynamical model that unifies the generic features of real networks: scale-free distribution of degree and the small-world effect. While the average shortest path length increases logarithmically as in random networks, the clustering coefficient assumes a large value independent of system size. We derive analytical expressions for the clustering coefficient in two limiting cases: random [C∼(lnN)2/N] and highly clustered (C=5/6) scale-free networks.

26 February 2003 in Physical Review E
Verified
Journal Article
Closed access
PDF file
KKKonstantin Klemm
Konstantin Klemm
VEVíctor M. Eguíluz
Víctor M. Eguíluz
RTRaul Toral
Raul Toral
Maxi San MiguelMaxi San Miguel
Maxi San Miguel
We analyze the nonequilibrium order-disorder transition of Axelrod’s model of social interaction in several complex networks. In a small-world network, we find a transition between an ordered homogeneous state and a disordered state. The transition point is shifted by the degree of spatial disorder of the underlying network, the network disorder favoring ordered configurations. In random scale-free networks the transition is only observed for finite size systems, showing system size scaling, while in the thermodynamic limit only ordered configurations are always obtained. Thus, in the thermodynamic limit the transition disappears. However, in structured scale-free networks, the phase transition between an ordered and a disordered phase is restored.

8 October 2002 in arXiv
Verified
Preprint
Open access
PDF file
KKKonstantin Klemm
Konstantin Klemm
VEVictor M. Eguiluz
Victor M. Eguiluz
RTRaul Toral
Raul Toral
MMMaxi San Miguel
Maxi San Miguel
We study the one-dimensional version of Axelrod's model of cultural transmission from the point of view of optimization dynamics. We show the existence of a Lyapunov potential for the dynamics. The global minimum of the potential, or optimum state, is the monocultural uniform state, which is reached for an initial diversity of the population below a critical value. Above this value, the dynamics settles in a multicultural or polarized state. These multicultural attractors are not local minima of the potential, so that any small perturbation initiates the search for the optimum state. Cultural drift is modelled by such perturbations acting at a finite rate. If the noise rate is small, the system reaches the optimum monocultural state. However, if the noise rate is above a critical value, that depends on the system size, noise sustains a polarized dynamical state.

30 July 2001 in arXiv
Verified
Preprint
Open access
PDF file
KKKonstantin Klemm
Konstantin Klemm
VEVictor M. Eguiluz
Victor M. Eguiluz
We propose a model for growing networks based on a finite memory of the nodes. The model shows stylized features of real-world networks: power law distribution of degree, linear preferential attachment of new links and a negative correlation between the age of a node and its link attachment rate. Notably, the degree distribution is conserved even though only the most recently grown part of the network is considered. This feature is relevant because real-world networks truncated in the same way exhibit a power-law distribution in the degree. As the network grows, the clustering reaches an asymptotic value larger than for regular lattices of the same average connectivity. These high-clustering scale-free networks indicate that memory effects could be crucial for a correct description of the dynamics of growing networks.

30 July 2001 in arXiv
Verified
Preprint
Open access
PDF file
KKKonstantin Klemm
Konstantin Klemm
VEVictor M. Eguiluz
Victor M. Eguiluz
In the context of growing networks, we introduce a simple dynamical model that unifies the generic features of real networks: scale-free distribution of degree and the small world effect. While the average shortest path length increases logartihmically as in random networks, the clustering coefficient assumes a large value independent of system size. We derive expressions for the clustering coefficient in two limiting cases: random (C ~ (ln N)^2 / N) and highly clustered (C = 5/6) scale-free networks.