English
Related papers

Related papers: Graph-Based Product Form

200 papers

State-space models (SSM) are central to describe time-varying complex systems in countless signal processing applications such as remote sensing, networks, biomedicine, and finance to name a few. Inference and prediction in SSMs are…

Computation · Statistics 2022-10-26 Víctor Elvira , Émilie Chouzenoux

In a recent paper, Shah [arXiv:2502.03073] derived an explicit expression for the distribution of occupancy times for a two-state Markov chain, using a method based on enumerating sample paths. We consider here the more general problem of…

Probability · Mathematics 2025-04-01 Phil Pollett

A discrete-time Markov chain can be transformed into a new Markov chain by looking at its states along iterations of an almost surely finite stopping time. By the optional stopping theorem, any bounded harmonic function with respect to the…

Probability · Mathematics 2022-05-04 Iddo Ben-Ari , Behrang Forghani

This paper considers the problem of defining distributions over graphical structures. We propose an extension of the hyper Markov properties of Dawid and Lauritzen [Ann. Statist. 21 (1993) 1272-1317], which we term structural Markov…

Statistics Theory · Mathematics 2020-04-28 Simon Byrne , A. Philip Dawid

Real causal processes may contain feedback loops and change over time. In this paper, we model cycles and non-stationary distributions using a mixture of directed acyclic graphs (DAGs). We then study the conditional independence (CI)…

Statistics Theory · Mathematics 2019-09-16 Eric V. Strobl

The problem of sampling from the stationary distribution of a Markov chain finds widespread applications in a variety of fields. The time required for a Markov chain to converge to its stationary distribution is known as the classical…

Quantum Physics · Physics 2022-09-14 Shantanav Chakraborty , Kyle Luh , Jérémie Roland

Perfect sampling is a technique that uses coupling arguments to provide a sample from the stationary distribution of a Markov chain in a finite time without ever computing the distribution. This technique is very efficient if all the events…

Discrete Mathematics · Computer Science 2015-03-17 Ana Bušić , Bruno Gaujal , Furcy Pin

Consider a Markov chain with finite state $\{0, 1, ..., d\}$. We give the generation functions (or Laplace transforms) of absorbing (passage) time in the following two situations : (1) the absorbing time of state $d$ when the chain starts…

Probability · Mathematics 2014-12-09 Wenming Hong , Ke Zhou

We develop some sufficient conditions for the stochastic ordering between hitting times, in a fixed state, for two Markov chains. In particular, we focus attention on the so called \emph{skip-free} case. In the analysis of such a case, we…

Probability · Mathematics 2014-03-25 Emilio De Santis , Fabio Spizzichino

In this work we define two kinds of crested product for reversible Markov chains, which naturally appear as a generalization of the case of crossed and nested product, as in association schemes theory, even if we do a construction that…

Probability · Mathematics 2009-03-04 Daniele D'Angeli , Alfredo Donno

Global variational approximation methods in graphical models allow efficient approximate inference of complex posterior distributions by using a simpler model. The choice of the approximating model determines a tradeoff between the…

Artificial Intelligence · Computer Science 2013-01-14 Tal El-Hay , Nir Friedman

Random walks are a fundamental model in applied mathematics and are a common example of a Markov chain. The limiting stationary distribution of the Markov chain represents the fraction of the time spent in each state during the stochastic…

Numerical Analysis · Computer Science 2018-01-08 Austin R. Benson , David F. Gleich , Lek-Heng Lim

Ge and Stefankovic have recently introduced a novel two-variable graph polynomial. When specialised to a bipartite graphs G and evaluated at the point (1/2,1) this polynomial gives the number of independent sets in the graph. Inspired by…

Probability · Mathematics 2012-01-18 Leslie Ann Goldberg , Mark Jerrum

We consider two types of discrete-time Markov chains where the state space is a graded poset and the transitions are taken along the covering relations in the poset. The first type of Markov chain goes only in one direction, either up or…

Probability · Mathematics 2016-08-06 Kimmo Eriksson , Markus Jonsson , Jonas Sjöstrand

We study conditional independence relationships for random networks and their interplay with exchangeability. We show that, for finitely exchangeable network models, the empirical subgraph densities are maximum likelihood estimates of their…

Statistics Theory · Mathematics 2017-11-22 Steffen Lauritzen , Alessandro Rinaldo , Kayvan Sadeghi

Stochastic models of reaction networks are becoming increasingly important in Systems Biology. In these models, the dynamics is generally represented by a continuous-time Markov chain whose states denote the copy-numbers of the constituent…

Probability · Mathematics 2018-02-12 Ankit Gupta , Mustafa Khammash

Time series and signals are attracting more attention across statistics, machine learning and pattern recognition as it appears widely in the industry especially in sensor and IoT related research and applications, but few advances has been…

Machine Learning · Computer Science 2018-08-15 Lu Liu , Zhiguang Wang

Inspired from modern out-of-equilibrium statistical physics models, a matrix product based framework permits the formal definition of random vectors (and random time series) whose desired joint distributions are a priori prescribed. Its key…

Statistical Mechanics · Physics 2012-03-21 Florian Angeletti , Eric Bertin , Patrice Abry

Graphs are commonly used to model various complex systems, including social networks, power grids, transportation networks, and biological systems. In many applications, the connectivity of these networks can be expressed through the Mean…

Optimization and Control · Mathematics 2025-09-03 Christian P. C. Franssen , Alessandro Zocca , Bernd F. Heidergott

To provide a more accurate description of the driving behaviors in vehicle queues, a namely Markov-Gap cellular automata model is proposed in this paper. It views the variation of the gap between two consequent vehicles as a Markov process…

Data Analysis, Statistics and Probability · Physics 2009-04-23 Fa Wang , Li Li , Jianming Hu , Yan Ji , Danya Yao , Yi Zhang , Xuexiang Jin , Yuelong Su , Zheng Wei