English
Related papers

Related papers: Discrete Capacity and Higher-order Differences of …

200 papers

This paper will provide several classes of strictly stationary, countable-state, irreducible, aperiodic Markov chains that are reversible and have finite second moments, such that the central limit theorem fails to hold. The main purpose is…

Probability · Mathematics 2026-03-11 Richard C. Bradley

Markov chains for probability distributions related to matrix product states and 1D Hamiltonians are introduced. With appropriate 'inverse temperature' schedules, these chains can be combined into a random approximation scheme for ground…

Strongly Correlated Electrons · Physics 2014-05-14 S. Iblisdir

Markov Chains with variable length are useful stochastic models for data compression that avoid the curse of dimensionality faced by that full Markov Chains. In this paper we introduce a Variable Length Markov Chain whose transition…

Methodology · Statistics 2020-01-01 Adriano Zanin Zambom , Seonjin Kim , Nancy Lopes Garcia

This paper examines the impact of discrete marginal distributions on copula-based Markov chains. We present results on mixing and parameter estimation for a copula-based Markov chain model with Bernoulli($p$) marginal distribution and…

Statistics Theory · Mathematics 2025-09-16 Mathias N. Muia , Martial Longla

We consider a class of piecewise-deterministic Markov processes where the state evolves according to a linear dynamical system. This continuous time evolution is interspersed by discrete events that occur at random times and change (reset)…

Systems and Control · Computer Science 2017-11-15 Mohammad Soltani , Abhyudai Singh

We apply the method of differential inequalities for the computation of upper bounds for the rate of convergence to the limiting regime for one specific class of (in)homogeneous continuous-time Markov chains. To obtain these estimates, we…

Probability · Mathematics 2021-05-13 Alexander Zeifman , Yacov Satin , Alexander Sipin

We consider a new class of non Markovian processes with a countable number of interacting components. At each time unit, each component can take two values, indicating if it has a spike or not at this precise moment. The system evolves as…

Probability · Mathematics 2015-06-12 Antonio Galves , Eva Löcherbach

We study the so-called pinning model, which describes the behavior of a Markov chain interacting with a distinguished state. The interaction depends on an external source of randomness, called disorder, which can attract or repel the Markov…

Probability · Mathematics 2023-02-27 Niccolo Torri

Hyperuniform states of matter exhibit unusual suppression of density fluctuations at large scales, contrasting sharply with typical disordered configurations. Various types of hyperuniformity emerge in multicomponent disordered systems,…

Statistical Mechanics · Physics 2025-01-14 Hiroshi Frusawa

We consider a model of a discrete time "interacting particle system" on the integer line where infinitely many changes are allowed at each instance of time. We describe the model using chameleons of two different colours, {\it viz}., red…

Probability · Mathematics 2009-07-23 Antar Bandyopadhyay , Rahul Roy , Anish Sarkar

We consider Markov chains which are polynomially mixing, in a weak sense expressed in terms of the space of functions on which the mixing speed is controlled. In this context, we prove polynomial large and moderate deviations inequalities.…

Probability · Mathematics 2016-07-22 J Dedecker , Sébastien Gouëzel , F Merlevède

Binary decision diagrams can compactly represent vast sets of states, mitigating the state space explosion problem in model checking. Probabilistic systems, however, require multi-terminal diagrams storing rational numbers. They are…

Logic in Computer Science · Computer Science 2020-01-14 Ernst Moritz Hahn , Arnd Hartmanns

We consider an infinite spin chain as a bipartite system consisting of the left and right half-chain and analyze entanglement properties of pure states with respect to this splitting. In this context we show that the amount of entanglement…

Mathematical Physics · Physics 2009-11-11 M. Keyl , T. Matsui , D. Schlingemann , R. F. Werner

In this work, we study the effects of finite buffers on the throughput and delay of line networks with erasure links. We identify the calculation of performance parameters such as throughput and delay to be equivalent to determining the…

Information Theory · Computer Science 2011-03-09 Badri N. Vellambi , Nima Torabkhani , Faramarz Fekri

We study the channel capacity of a general discrete energy harvesting channel with a finite battery. Contrary to traditional communication systems, the transmitter of such a channel is powered by a device that harvests energy from a random…

Information Theory · Computer Science 2016-06-30 Wei Mao , Babak Hassibi

We characterize the capacity for the discrete-time arbitrarily varying channel with discrete inputs, outputs, and states when (a) the encoder and decoder do not share common randomness, (b) the input and state are subject to cost…

Information Theory · Computer Science 2022-05-16 Yihan Zhang , Sidharth Jaggi , Michael Langberg , Anand D. Sarwate

In this paper we propose a time discretization of a system of two parabolic equations describing diffusion-driven atom rearrangement in crystalline matter. The equations express the balances of microforces and microenergy; the two phase…

Analysis of PDEs · Mathematics 2019-02-20 Pierluigi Colli , Gianni Gilardi , Pavel Krejčí , Paolo Podio-Guidugli , Jürgen Sprekels

We consider a simple discrete-time Markov chain with values in $[0,\infty)^{Z^d}$. The Markov chain describes various interesting examples such as oriented percolation, directed polymers in random environment, time discretizations of binary…

Probability · Mathematics 2009-06-26 Nobuo Yoshida

We consider capacity of discrete-time channels with feedback for the general case where the feedback is a time-invariant deterministic function of the output samples. Under the assumption that the channel states take values in a finite…

Information Theory · Computer Science 2009-09-29 Haim Permuter , Tsachy Weissman , Andrea Goldsmith

We examine two analytical characterisation of the metastable behavior of a Markov chain. The first one expressed in terms of its transition probabilities, and the second one in terms of its large deviations rate functional. Consider a…

Probability · Mathematics 2022-07-07 L. Bertini , D. Gabrielli , C. Landim