Joost Berkhout

Joost Berkhout

Auto-generated profile, based on publicly available information

Joost Berkhout

Centrum Wiskunde & Informatica (CWI), Amsterdam, The Netherlands

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

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

Representative Publications

View All Publications
1 May 2019 in Operations Research
Verified
Journal Article
Closed access
JBJoost Berkhout
Joost Berkhout
BHBernd F. Heidergott
Bernd F. Heidergott
There is a growing interest in the analysis of networks found in the World Wide Web and in social networks. A common feature of these networks is that the finite-state Markov chain modeling the influence relation between nodes typically has several (nearly) ergodic classes. This paper introduces a new decomposition algorithm for Markov chains that allows to split the graph of the Markov chain into subgraphs such that the connectivity of the chain—measured by the Kemeny constant—is maximally decreased. In other words, we show how the structure dormant in a nearly decomposable chain can be brought to light. We present applications to influence ranking in social networks, decomposition of a social network into subnetworks, and cluster analysis.

4 January 2023 in Computers & Operations Research
Verified
Journal Article
Open access
NDN.A. Dieleman
N.A. Dieleman
JBJ. Berkhout
J. Berkhout
BHB. Heidergott
B. Heidergott

22 October 2024 in Computers & Industrial Engineering
Verified
Journal Article
Open access
YCYoram Clapper
Yoram Clapper
JBJoost Berkhout
Joost Berkhout
RBRene Bekker
Rene Bekker

17 August 2017 in Queueing Systems
Verified
Journal Article
Open access
PDF file
JSJennifer Sommer
Jennifer Sommer
JBJoost Berkhout
Joost Berkhout
HDHans Daduna
Hans Daduna
BHBernd Heidergott
Bernd Heidergott
Jackson networks are versatile models for analyzing complex networks. In this paper we study generalized Jackson networks with single-server stations, where nodes may have an infinite supply of work. We allow simultaneous breakdown of servers and consider group repair strategies. We establish the existence of a steady-state distribution of the queue-length vector at stable nodes for different types of failure regimes. In steady state the distribution of the failure/repair regime and of the queue-length vector at stable nodes decouples in a product-form way. We provide closed-form solutions for the classical performance measures such as throughput or mean sojourn time at a station.

27 May 2017 in Discrete Event Dynamic Systems
Verified
Journal Article
Closed access
PDF file
JBJoost Berkhout
Joost Berkhout
BHBernd F. Heidergott
Bernd F. Heidergott

1 May 2016
Verified
Conference Paper
Closed access
JBJoost Berkhout
Joost Berkhout
This paper extends the random surfer approach of Google's PageRank algorithm to general finite Markov chains that may consist of several ergodic classes and possible transient states. We will introduce the new concept of an extended ergodic projector of a Markov chain and we will show how the extended ergodic projector allows for intuitive better ranking of transient states. Numerical examples are provided to illustrate the effect of this new ranking approach.