Related papers: The Distribution Function of the Longest Head Run
Current concepts of neural networks have emerged over two centuries of progress beginning with the neural doctrine to the idea of neural cell assemblies. Presently the model of neural networks involves distributed neural circuits of nodes,…
The asymptotic behavior of the quantum walk on the line is investigated focusing on the probability distribution of chirality independently of position. The long-time limit of this distribution is shown to exist and to depend on the initial…
Continuous time random walks are non-Markovian stochastic processes, which are only partly characterized by single-time probability distributions. We derive a closed evolution equation for joint two-point probability density functions of a…
Continuous Time Markov Chains, Hawkes processes and many other interesting processes can be described as solution of stochastic differential equations driven by Poisson measures. Previous works, using the Stein's method, give the…
We revisit the source coding problem for a Markov chain under the assumption that the transmission times and how fast the Markov chain transitions its state happen at the same time-scale. Specifically, we assume that the transmission of…
Markov chains are convenient means of generating realizations of networks with a given (joint or otherwise) degree distribution, since they simply require a procedure for rewiring edges. The major challenge is to find the right number of…
The payoff in the Chow-Robbins coin-tossing game is the proportion of heads when you stop. Knowing when to stop to maximize expectation was addressed by Chow and Robbins(1965), who proved there exist integers ${k_n}$ such that it is optimal…
A nonnegative coarse Ricci curvature for a Markov chain and the existence of an attractive point implies the concentration of the invariant probability measure around this point. The mass outside balls centered at the attractive point, as a…
We consider a Markov control model in discrete time with countable both state space and action space. Using the value function of a suitable long-run average reward problem, we study various reachability/controllability problems. First, we…
The aim of this article is to prove that diffusion processes in $\mathbb{R}^d$ with a drift can be approximated by suitable Markov chains on $n^{-1}\mathbb{Z}^d$. Moreover, we investigate sufficient conditions on the conductances which…
This paper focuses on a class of continuous-time controlled Markov chains with time-inconsistent and distribution-dependent cost functional (in some appropriate sense). A new definition of time-inconsistent distribution-dependent…
This paper considers the queueing performance of a system that transmits coded data over a time-varying erasure channel. In our model, the queue length and channel state together form a Markov chain that depends on the system parameters.…
Consider $n$ independent, biased coins, each with a known probability of heads. Presented with an ordering of these coins, flip (i.e., toss) each coin once, in that order, until we have observed both a *head* and a *tail*, or flipped all…
This paper gives a method for computing distributions associated with patterns in the state sequence of a hidden Markov model, conditional on observing all or part of the observation sequence. Probabilities are computed for very general…
By using the matrix formulation of the two-step approach to the distributions of runs, a recursive relation and an explicit expression are derived for the generating function of the joint distribution of rises and falls for multivariate…
We solve the problem of optimal stopping of a Brownian motion subject to the constraint that the stopping time's distribution is a given measure consisting of finitely-many atoms. In particular, we show that this problem can be converted to…
Move-to-front rule is a heuristic updating a list of n items according to requests. Items are required with unknown probabilities (or popularities). The induced Markov chain is known to be ergodic. One main problem is the study of the…
We propose distribution-free runs-based control charts for detecting location shifts. Using the fact that given the number of total successes, the outcomes of a sequence of Bernoulli trials are random permutations, we are able to control…
The noncentral $t$-distribution is a generalization of the Student's $t$-distribution. In this paper we suggest an alternative approach for computing the cumulative distribution function (CDF) of the noncentral $t$-distribution which is…
An irreducible stochastic matrix with rational entries has a stationary distribution given by a vector of rational numbers. We give an upper bound on the lowest common denominator of the entries of this vector. Bounds of this kind are used…