No Arabic abstract
We calculate exponential growth constants describing the asymptotic behavior of several quantities enumerating classes of orientations of arrow variables on the bonds of several types of directed lattice strip graphs $G$ of finite width and arbitrarily great length, in the infinite-length limit, denoted {G}. Specifically, we calculate the exponential growth constants for (i) acyclic orientations, $alpha({G})$, (ii) acyclic orientations with a single source vertex, $alpha_0({G})$, and (iii) totally cyclic orientations, $beta({G})$. We consider several lattices, including square (sq), triangular (tri), and honeycomb (hc). From our calculations, we infer lower and upper bounds on these exponential growth constants for the respective infinite lattices. To our knowledge, these are the best current bounds on these quantities. Since our lower and upper bounds are quite close to each other, we can infer very accurate approximate values for the exponential growth constants, with fractional uncertainties ranging from $O(10^{-4})$ to $O(10^{-2})$. Further, we present exact values of $alpha(tri)$, $alpha_0(tri)$, and $beta(hc)$ and use them to show that our lower and upper bounds on these quantities are very close to these exact values, even for modest strip widths. Results are also given for a nonplanar lattice denoted $sq_d$. We show that $alpha({G})$, $alpha_0({G})$, and $beta({G})$ are monotonically increasing functions of vertex degree for these lattices. We also study the asymptotic behavior of the ratios of the quantities (i)-(iii) divided by the total number of edge orientations as the number of vertices goes to infinity. A comparison is given of these exponential growth constants with the corresponding exponential growth constant $tau({G})$ for spanning trees. Our results are in agreement with inequalities following from the Merino-Welsh and Conde-Merino conjectures.
We study Kleinberg navigation (the search of a target in a d-dimensional lattice, where each site is connected to one other random site at distance r, with probability proportional to r^{-a}) by means of an exact master equation for the process. We show that the asymptotic scaling behavior for the delivery time T to a target at distance L scales as (ln L)^2 when a=d, and otherwise as L^x, with x=(d-a)/(d+1-a) for a<d, x=a-d for d<a<d+1, and x=1 for a>d+1. These values of x exceed the rigorous lower-bounds established by Kleinberg. We also address the situation where there is a finite probability for the message to get lost along its way and find short delivery times (conditioned upon arrival) for a wide range of as.
The Minimum Path Cover problem on directed acyclic graphs (DAGs) is a classical problem that provides a clear and simple mathematical formulation for several applications in different areas and that has an efficient algorithmic solution. In this paper, we study the computational complexity of two constrained variants of Minimum Path Cover motivated by the recent introduction of next-generation sequencing technologies in bioinformatics. The first problem (MinPCRP), given a DAG and a set of pairs of vertices, asks for a minimum cardinality set of paths covering all the vertices such that both vertices of each pair belong to the same path. For this problem, we show that, while it is NP-hard to compute if there exists a solution consisting of at most three paths, it is possible to decide in polynomial time whether a solution consisting of at most two paths exists. The second problem (MaxRPSP), given a DAG and a set of pairs of vertices, asks for a path containing the maximum number of the given pairs of vertices. We show its NP-hardness and also its W[1]-hardness when parametrized by the number of covered pairs. On the positive side, we give a fixed-parameter algorithm when the parameter is the maximum overlapping degree, a natural parameter in the bioinformatics applications of the problem.
The number of independent sets is equivalent to the partition function of the hard-core lattice gas model with nearest-neighbor exclusion and unit activity. We study the number of independent sets $m_{d,b}(n)$ on the generalized Sierpinski gasket $SG_{d,b}(n)$ at stage $n$ with dimension $d$ equal to two, three and four for $b=2$, and layer $b$ equal to three for $d=2$. The upper and lower bounds for the asymptotic growth constant, defined as $z_{SG_{d,b}}=lim_{v to infty} ln m_{d,b}(n)/v$ where $v$ is the number of vertices, on these Sierpinski gaskets are derived in terms of the results at a certain stage. The numerical values of these $z_{SG_{d,b}}$ are evaluated with more than a hundred significant figures accurate. We also conjecture the upper and lower bounds for the asymptotic growth constant $z_{SG_{d,2}}$ with general $d$.
Many interesting phenomena in nature are described by stochastic processes with irreversible dynamics. To model these phenomena, we focus on a master equation or a Fokker-Planck equation with rates which violate detailed balance. When the system settles in a stationary state, it will be a nonequilibrium steady state (NESS), with time independent probability distribution as well as persistent probability current loops. The observable consequences of the latter are explored. In particular, cyclic behavior of some form must be present: some are prominent and manifest, while others are more obscure and subtle. We present a theoretical framework to analyze such properties, introducing the notion of probability angular momentum and its distribution. Using several examples, we illustrate the manifest and subtle categories and how best to distinguish between them. These techniques can be applied to reveal the NESS nature of a wide range of systems in a large variety of areas. We illustrate with one application: variability of ocean heat content in our climate system.
We study a model of self propelled particles exhibiting run and tumble dynamics on lattice. This non-Brownian diffusion is characterised by a random walk with a finite persistence length between changes of direction, and is inspired by the motion of bacteria such as E. coli. By defining a class of models with multiple species of particle and transmutation between species we can recreate such dynamics. These models admit exact analytical results whilst also forming a counterpart to previous continuum models of run and tumble dynamics. We solve the externally driven non-interacting and zero-rang