77 citations · 201 across the 10 of their papers we have counts for
10 papers
Relation between Hitting Times and Probabilities for Imprecise Markov Chains
Marco Sangalli, Erik Quaeghebeur, Thomas Krak
In the present paper, we investigate the relationship between hitting times and hitting probabilities in discrete-time imprecise Markov chains (IMCs). We define lower and upper hit…
E(n)-equivariant Graph Neural Cellular Automata
Gennaro Gala, Daniele Grattarola, Erik Quaeghebeur
Cellular automata (CAs) are notable computational models exhibiting rich dynamics emerging from the local interaction of cells arranged in a regular lattice. Graph CAs (GCAs) gener…
Continuous Mixtures of Tractable Probabilistic Models
Alvaro H. C. Correia, Gennaro Gala, Erik Quaeghebeur +2
Probabilistic models based on continuous latent spaces, such as variational autoencoders, can be understood as uncountable mixture models where components depend continuously on th…
Sensitivity analysis for finite Markov chains in discrete time
Gert de Cooman, Filip Hermans, Erik Quaeghebeur
When the initial and transition probabilities of a finite Markov chain in discrete time are not well known, we should perform a sensitivity analysis. This is done by considering as…
Accept & Reject Statement-Based Uncertainty Models
Erik Quaeghebeur, Gert de Cooman, Filip Hermans
We develop a framework for modelling and reasoning with uncertainty based on accept and reject statements about gambles. It generalises the frameworks found in the literature based…
Characterizing the Set of Coherent Lower Previsions with a Finite Number of Constraints or Vertices
Erik Quaeghebeur
The standard coherence criterion for lower previsions is expressed using an infinite number of linear constraints. For lower previsions that are essentially defined on some finite…