We introduce and explore the asymmetric inclusion process (ASIP), an exactly solvable bosonic counterpart of the fermionic asymmetric exclusion process (ASEP). In both processes, random events cause particles to propagate unidirectionally along a one-dimensional lattice of n sites. In the ASEP, particles are subject to exclusion interactions, whereas in the ASIP, particles are subject to inclus...

The capacity of human sensory systems for transmitting information has been approximated in the past by using statistical estimators. However, a substantial margin of error remained. The problem is that the error can be reduced to a negligible level only by increasing the number of human trials or tests to the order of about 10(4). Since a human subject can perform at peak only in the order of ...

Labor force participation rates of married women have increased substantially since 1950s; and the educational gender gaps for cohorts born after 1950 have also witnessed a shrinkage and, in fact, a reversal. In this paper, we advance a novel connection between the two trends: the decrease in the maternal time input in the children’s education as a result of the increase in maternal employment ...

A total dominating set of a graph G with no isolated vertices is subset S the vertex such that every adjacent to in S. The domination number minimum cardinality set. In this paper, we study middle graphs. Indeed, obtain tight bounds for terms order graph. We also compute some known families graphs explicitly. Moreover, Nordhaus-Gaddum-like relations are presented

Let $G = (V, E)$ be a simple graph of order $n$. The total dominating set is a subset $D$ of $V$ that every vertex of $V$ is adjacent to some vertices of $D$. The total domination number of $G$ is equal to minimum cardinality of total dominating set in $G$ and denoted by $gamma_t(G)$. The total domination polynomial of $G$ is the polynomial $D_t(G,x)=sum d_t(G,i)$, where $d_t(G,i)$ is the numbe...