Related papers: Steady state distributions in generalized exclusio…
We study the dynamics of randomly connected networks composed of binary Boolean elements and those composed of binary majority vote elements. We elucidate their differences in both sparsely and densely connected cases. The quickness of…
We study the asymmetric exclusion process on a regular Cayley tree with arbitrary co-ordination number. In this model particles can enter the system only at the parent site and exit from one of the sites at the last level. In the bulk they…
We consider the asymmetric simple exclusion process (TASEP) on open network consisting of three consecutively coupled macroscopic chain segments with a shortcut between the tail of the first segment and the head of the third one. The model…
The sum-product or belief propagation (BP) algorithm is a widely-used message-passing algorithm for computing marginal distributions in graphical models with discrete variables. At the core of the BP message updates, when applied to a…
In this paper we consider two models in the Kardar-Parisi-Zhang (KPZ) universality class, the asymmetric simple exclusion process (ASEP) and the stochastic six-vertex model. We introduce a new class of initial data (which we call {\itshape…
We introduce an extension of the M/M/1 queueing process with a spatial structure and excluded- volume effect. The rule of particle hopping is the same as for the totally asymmetric simple exclusion process (TASEP). A stationary-state…
We consider a family of totally asymmetric simple exclusion processes (TASEPs), consisting of particles on a lattice that require binding by a "token" in various physical configurations to advance over the lattice. Using a combination of…
We consider a multi-species generalization of the totally asymmetric simple exclusion process (TASEP) with the simple hopping rule: for x and yth-class particles (x<y), the transition xy -> yx occurs with a rate independent from the values…
This paper studies the quasi-stationary distributions for a single death process (or downwardly skip-free process) with killing defined on the non-negative integers, corresponding to a non-conservative transition rate matrix. The set…
We introduce a novel training principle for probabilistic models that is an alternative to maximum likelihood. The proposed Generative Stochastic Networks (GSN) framework is based on learning the transition operator of a Markov chain whose…
The totally asymmetric exclusion process (TASEP) with periodic boundaries is considered as traffic flow model. The large-L approximation of the stationary state is used for the derivation of the time-headway distribution (an important…
We introduce a multi-species generalization of the symmetric simple exclusion process with open boundaries. This model possesses the property of being integrable and appears as physically relevant because the boundary conditions can be…
Boolean networks are conventionally used to represent and simulate gene regulatory networks. In the analysis of the dynamic of a Boolean network, the attractors are the objects of a special attention. In this work, we propose a novel…
We introduce the binomial line process (BLP), a novel spatial stochastic model for the characterization of streets in the statistical evaluation of wireless and vehicular networks. Existing stochastic geometry models for streets, e.g.,…
As one of the paradigmatic models of non-equilibrium systems, the asymmetric simple exclusion process (ASEP) has been widely used to study many physical, chemical, and biological systems. The ASEP shows a range of nontrivial macroscopic…
The recently measured yeast transcriptional network is analyzed in terms of simplified Boolean network models, with the aim of determining feasible rule structures, given the requirement of stable solutions of the generated Boolean…
In this paper we study analytically a simple one dimensional model of mass transport. We introduce a parameter $p$ that interpolates between continuous time dynamics ($p\to 0$ limit) and discrete parallel update dynamics ($p=1$). For each…
The totally asymmetric simple exclusion process (TASEP) is a basic model of statistical mechanics that has found numerous applications. We consider the case of TASEP with a finite chain where particles may enter from the left and leave to…
The Asymmetric Simple Exclusion Process is one of the most extensively studied models in non-equilibrium statistical mechanics. The macroscopic particle current produced in its steady state is directly related to the breaking of detailed…
In this paper, a mathematical framework for the analysis of average symbol error probability (ASEP) in millimeter wave (mmWave) cellular networks with Poisson Point Process (PPP) distributed base stations (BSs) is developed using tools from…