相关论文: Stochastic adding machines based on Bratteli diagr…

In this paper we describe a wide class of non-Volterra quadratic stochastic operators using N. Ganikhadjaev's construction of quadratic stochastic operators. By the construction these operators depend on a probability measure $\mu$ being…

Sampling uniform simple graphs with power-law degree distributions with degree exponent $\tau\in(2,3)$ is a non-trivial problem. We propose a method to sample uniform simple graphs that uses a constrained version of the configuration model…

This paper is devoted to the convergence analysis of stochastic approximation algorithms of the form $\theta\_{n+1} = \theta\_n + \gamma\_{n+1} H\_{\theta\_n}(X\_{n+1})$ where $\{\theta\_nn, n \geq 0\}$ is a $R^d$-valued sequence,…

We determine an explicit Gr\"obner basis, consisting of linear forms and determinantal quadrics, for the prime ideal of Raftery's mixture transition distribution model for Markov chains. When the states are binary, the corresponding…

Our main result is the martingale representations for Markov additive processes where the modulator is a Levy process. These processes have three parts: the modulator, the jumps of the ordinate triggered by the modulator, and the…

We study the performance of a stochastic algorithm based on the power method that adaptively learns the large deviation functions characterizing the fluctuations of additive functionals of Markov processes, used in physics to model…

This paper solves exit problems for spectrally negative Markov additive processes and their reflections. A so-called scale matrix, which is a generalization of the scale function of a spectrally negative \levy process, plays a central role…

With the advent of quantum and quantum-inspired machine learning, adapting the structure of learning models to match the structure of target datasets has been shown to be crucial for obtaining high performance. Probabilistic models based on…

Bayesian additive regression trees have seen increased interest in recent years due to their ability to combine machine learning techniques with principled uncertainty quantification. The Bayesian backfitting algorithm used to fit BART…

Questions are posed regarding the influence that the column sums of the transition probabilities of a stochastic matrix (with row sums all one) have on the stationary distribution, the mean first passage times and the Kemeny constant of the…

We show how to exploit symmetries of a graph to efficiently compute the fastest mixing Markov chain on the graph (i.e., find the transition probabilities on the edges to minimize the second-largest eigenvalue modulus of the transition…

The aim of this paper is to study some continuous-time bivariate Markov processes arising from group representation theory. The first component (level) can be either discrete (quasi-birth-and-death processes) or continuous (switching…

Recent developments in string theory have revealed a surprising connection between spectral theory and local mirror symmetry: it has been found that the quantization of mirror curves to toric Calabi-Yau threefolds leads to trace class…

We construct a novel class of stochastic blockmodels using Bayesian nonparametric mixtures. These model allows us to jointly estimate the structure of multiple networks and explicitly compare the community structures underlying them, while…

A general way to construct ladder models with certain Lie algebraic or quantum Lie algebraic symmetries is presented. These symmetric models give rise to series of integrable systems. It is shown that corresponding to these SU(2) symmetric…

In this research paper, weighted / unweighted, directed / undirected graphs are associated with interesting Discrete Time Markov Chains (DTMCs) as well as Continuous Time Markov Chains (CTMCs). The equilibrium / transient behaviour of such…

Reversible Markov chains play a central role in stochastic modelling and in algorithms such as Markov chain Monte Carlo (MCMC). Motivated by the fundamental importance of reversibility in classical settings, this paper develops a…

Model reduction of Markov processes is a basic problem in modeling state-transition systems. Motivated by the state aggregation approach rooted in control theory, we study the statistical state compression of a discrete-state Markov chain…

In this paper we consider Markov chains with transition rates that depend on a small parameter $\varepsilon$. Under a mild assumption on the asymptotics of these transition rates, we describe the behavior of the chain at various…

We construct the first examples of rational functions defined over a non-archimedean field with certain dynamical properties. In particular, we find such functions whose Julia sets, in the Berkovich projective line, are connected but not…