#### Filter Results:

- Full text PDF available (5)

#### Publication Year

2005

2012

- This year (0)
- Last 5 years (1)
- Last 10 years (8)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

#### Organism

Learn More

- Furqan Ahmed, Olav Tirkkonen, Matti Peltomäki, Juha-Matti Koljonen, Chia-Hao Yu, Mikko Alava
- J. Electrical and Computer Engineering
- 2010

- Matti Peltomäki, Mikko Alava
- Physical review. E, Statistical, nonlinear, and…
- 2008

Cyclic dominance of three species is a commonly occurring interaction dynamics, often denoted the rock-paper-scissors (RPS) game. Such a type of interactions is known to promote species coexistence. Here, we generalize recent results of Reichenbach [Nature (London) 448, 1046 (2007)] of a four-state variant of the RPS game. We show that spiral formation… (More)

- Matti Peltomäki, Juha-Matti Koljonen, Olav Tirkkonen, Mikko Alava
- IEEE Trans. Vehicular Technology
- 2012

We consider power saving in a cellular network. Subject to constraints generated by network planning and dynamic Radio Resource Management algorithms, there is room for reducing Base Station (BS) transmit powers. We suggest that power is reduced in a way that does not move cell boundaries significantly. For this, there is a power difference constraint dmax… (More)

- Matti Peltomäki, Martin Rost, Mikko Alava
- Physical review. E, Statistical, nonlinear, and…
- 2008

Interacting populations often create complicated spatiotemporal behavior, and understanding it is a basic problem in the dynamics of spatial systems. We study the two-species case by simulations of a host-parasitoid model. In the case of coexistence, there are spatial patterns leading to noise-sustained oscillations. We introduce a measure for the patterns,… (More)

- Matti Peltomäki, Ville Vuorinen, Mikko Alava, Martin Rost
- Physical review. E, Statistical, nonlinear, and…
- 2005

The behavior of two interacting populations "hosts" and "parasites" is investigated on Cayley trees and scale-free networks. In the former case analytical and numerical arguments elucidate a phase diagram for the susceptible-infected-susceptible model, whose most interesting feature is the absence of a tricritical point as a function of the two independent… (More)

- Matti Peltomäki
- 2007

The vertex cover is a subset Vvc ⊂ V of vertices of a graph G(V,E) such that it contains at least one endpoint of each vertex e ∈ E. Solving for the minimum vertex cover, i.e. one with the smallest number of vertices, is in general an NP-complete problem. However, in practice many relatively simple algorithms are able to produce optimum or nearly-optimum… (More)

- Juha-Matti Koljonen, Matti Peltomäki, Mikko Alava, Olav Tirkkonen
- IWCMC
- 2009

We consider distributed channel allocation on planar conflict graphs describing interference couplings of wireless networks. We observe that the corresponding graph colouring problem is riddled by topologic defects that are annihilated when they meet the network boundary, or possibly another defect. Greedy algorithms lead to random walk -like motion of… (More)

- ‹
- 1
- ›