1 citations · 1 across the 2 of their papers we have counts for
4 papers
Feature-Based Network Construction: From Sampling to What-if Analysis
Christian Franssen, Joost Berkhout, Bernd Heidergott
Networks are characterized by structural features, such as degree distribution, triangular closures, and assortativity. This paper addresses the problem of reconstructing instances…
A Pseudo-Gradient Approach for Model-free Markov Chain Optimization
Nanne A. Dieleman, Joost Berkhout, Bernd Heidergott
We develop a first-order (pseudo-)gradient approach for optimizing functions over the stationary distribution of discrete-time Markov chains (DTMC). We give insights into why solvi…
A Critical Account of Perturbation Analysis of Markov Chains
Karim Abbas, Joost Berkhout, Bernd Heidergott
Perturbation analysis of Markov chains provides bounds on the effect that a change in a Markov transition matrix has on the corresponding stationary distribution. This paper compar…
Differentiation via Logarithmic Expansions
Michael C. Fu, Bernd Heidergott, Haralambie Leahu +1
In this note, we introduce a new finite difference approximation called the Black-Box Logarithmic Expansion Numerical Derivative (BLEND) algorithm, which is based on a formal logar…