First Hitting Times for Multiple Processes and Targets

Timo Kötzing; Jonathan E. Rowe

First Hitting Times for Multiple Processes and Targets

Timo Kötzing
, Jonathan E. Rowe

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

Given n processes and upper bounds on their respective first hitting times, we give an upper bound on the time until all processes have visited their target states. The first main result requires time homogeneous Markov chains and a runtime bound independent of starting points for each individual process. Our second main result assumes a bound based on the fitness level method. We illustrate our results with various examples.

Original language	English
Title of host publication	Parallel Problem Solving from Nature – PPSN XIX
Subtitle of host publication	19th International Conference, PPSN 2026, Trento, Italy, August 29 - September 2, 2026, Proceedings, Part I
Publisher	Springer, Cham
Number of pages	15
Publication status	Accepted/In press - 27 May 2026
Event	19th International Conference on Parallel Problem Solving from Nature - Trento, Italy Duration: 29 Aug 2026 → 2 Sept 2026 https://ppsn2026.disi.unitn.it/

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer Nature
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	19th International Conference on Parallel Problem Solving from Nature
Abbreviated title	PPSN 2026
Country/Territory	Italy
City	Trento
Period	29/08/26 → 2/09/26
Internet address	https://ppsn2026.disi.unitn.it/

Bibliographical note

Not yet published as of 18/08/2026. Expected publication September 2026.

Embargoed Document

KotzingT2026First_AAM
Accepted author manuscript, 382 KB
Licence: Creative Commons: Attribution (CC BY)
Embargo ends: 15/09/2026 00:00 BST

Cite this

@inproceedings{2fb0f82e471d4fdba6de13b41d30d7b4,

title = "First Hitting Times for Multiple Processes and Targets",

abstract = "Given n processes and upper bounds on their respective first hitting times, we give an upper bound on the time until all processes have visited their target states. The first main result requires time homogeneous Markov chains and a runtime bound independent of starting points for each individual process. Our second main result assumes a bound based on the fitness level method. We illustrate our results with various examples.",

author = "Timo K{\"o}tzing and Rowe, \{Jonathan E.\}",

note = "Not yet published as of 18/08/2026. Expected publication September 2026.; 19th International Conference on Parallel Problem Solving from Nature, PPSN 2026 ; Conference date: 29-08-2026 Through 02-09-2026",

year = "2026",

month = may,

day = "27",

language = "English",

series = "Lecture Notes in Computer Science",

publisher = "Springer, Cham",

booktitle = "Parallel Problem Solving from Nature – PPSN XIX",

url = "https://ppsn2026.disi.unitn.it/",

}

Kötzing, T & Rowe, JE 2026, First Hitting Times for Multiple Processes and Targets. in Parallel Problem Solving from Nature – PPSN XIX: 19th International Conference, PPSN 2026, Trento, Italy, August 29 - September 2, 2026, Proceedings, Part I. Lecture Notes in Computer Science, Springer, Cham, 19th International Conference on Parallel Problem Solving from Nature, Trento, Italy, 29/08/26.

First Hitting Times for Multiple Processes and Targets. / Kötzing, Timo; Rowe, Jonathan E.
Parallel Problem Solving from Nature – PPSN XIX: 19th International Conference, PPSN 2026, Trento, Italy, August 29 - September 2, 2026, Proceedings, Part I. Springer, Cham, 2026. (Lecture Notes in Computer Science).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - First Hitting Times for Multiple Processes and Targets

AU - Kötzing, Timo

AU - Rowe, Jonathan E.

N1 - Not yet published as of 18/08/2026. Expected publication September 2026.

PY - 2026/5/27

Y1 - 2026/5/27

N2 - Given n processes and upper bounds on their respective first hitting times, we give an upper bound on the time until all processes have visited their target states. The first main result requires time homogeneous Markov chains and a runtime bound independent of starting points for each individual process. Our second main result assumes a bound based on the fitness level method. We illustrate our results with various examples.

AB - Given n processes and upper bounds on their respective first hitting times, we give an upper bound on the time until all processes have visited their target states. The first main result requires time homogeneous Markov chains and a runtime bound independent of starting points for each individual process. Our second main result assumes a bound based on the fitness level method. We illustrate our results with various examples.

UR - https://link.springer.com/conference/ppsn

M3 - Conference contribution

T3 - Lecture Notes in Computer Science

BT - Parallel Problem Solving from Nature – PPSN XIX

PB - Springer, Cham

T2 - 19th International Conference on Parallel Problem Solving from Nature

Y2 - 29 August 2026 through 2 September 2026

ER -

First Hitting Times for Multiple Processes and Targets

Abstract

Publication series

Conference

Bibliographical note

Embargoed Document

Fingerprint

Cite this