相关论文: Stochastically Perturbed Chains of Variable Memory

Epigenetic cell memory, the inheritance of gene expression patterns across subsequent cell divisions, is a critical property of multi-cellular organisms. In recent work [10], a subset of the authors observed in a simulation study how the…

Likelihood-free inference involves inferring parameter values given observed data and a simulator model. The simulator is computer code which takes parameters, performs stochastic calculations, and outputs simulated data. In this work, we…

Word embeddings are the interface between the world of discrete units of text processing and the continuous, differentiable world of neural networks. In this work, we examine various random and pretrained initialization methods for…

The study of concurrent persistent programs has seen a surge of activity in recent years due to the introduction of non-volatile random access memories (NVRAM), yielding many models and correctness notions that are difficult to compare. In…

In this article, we propose a variational inference formulation of auto-associative memories, allowing us to combine perceptual inference and memory retrieval into the same mathematical framework. In this formulation, the prior probability…

We consider the Constrained-degree percolation model in random environment on the square lattice. In this model, each vertex $v$ has an independent random constraint ${\kappa}_v$ which takes the value $j\in \{0,1,2,3\}$ with probability…

This paper considers the problem of sequentially detecting a change in the joint distribution of multiple data sources under a sampling constraint. Specifically, the channels or sources generate observations that are independent over time,…

Consider a system of $K$ particles moving on the vertex set of a finite connected graph with at most one particle per vertex. If there is one, the particle at $x$ chooses one of the $\hbox{deg} (x)$ neighbors of its location uniformly at…

We introduce a multi-coin discrete quantum random walk where the amplitude for a coin flip depends upon previous tosses. Although the corresponding classical random walk is unbiased, a bias can be introduced into the quantum walk by varying…

The problem of lossless fixed-rate streaming coding of discrete memoryless sources with side information at the decoder is studied. A random time-varying tree-code is used to sequentially bin strings and a Stack Algorithm with a variable…

Stochastic dominance is a crucial tool for the analysis of choice under risk. It is typically analyzed as a property of two gambles that are taken in isolation. We study how additional independent sources of risk (e.g. uninsurable labor…

At low temperatures, weakly coupled spin chains develop a magnetic order that reflects the character of gapless spin fluctuations along the chains. Using nuclear magnetic resonance, we identify and characterize two ordered states in the…

We present general principles underlying analysis of the dependence of random variables (outputs) on deterministic conditions (inputs). Random outputs recorded under mutually exclusive input values are labeled by these values and considered…

In this manuscript, we study stochastic comparisons of the second-order statistics from dependent or independent observations with modified proportional hazard rates models. First, we establish the usual stochastic order of the second-order…

We give a physical description in terms of percolation theory of the phase transition that occurs when the disorder increases in the random antiferromagnetic spin-1 chain between a gapless phase with topological order and a random singlet…

We study competing first passage percolation on graphs generated by the configuration model with infinite-mean degrees. Initially, two uniformly chosen vertices are infected with type 1 and type 2 infection, respectively, and the infection…

We describe a new algorithm for the perfect simulation of variable length Markov chains and random systems with perfect connections. This algorithm, which generalizes Propp and Wilson's simulation scheme, is based on the idea of coupling…

We ask under what conditions a finite brickwork circuit of random gates retains local information about the initial state. To answer this question we measure the averaged Frobenius distance between the reduced states obtained by evolving…

Semantic memory is the subsystem of human memory that stores knowledge of concepts or meanings, as opposed to life specific experiences. The organization of concepts within semantic memory can be understood as a semantic network, where the…

We investigate the quantum versions of a one-dimensional random walk, whose corresponding Markov Chain is of order 2. This corresponds to the walk having a memory of up to two previous steps. We derive the amplitudes and probabilities for…