Search

We study the rotor-router walk with the clockwise ordering of outgoing edges on the semi-infinite cylinder. Imposing uniform conditions on the boundary of the cylinder, we consider growth of the cluster of visited sites and its internal structure. The average width of the surface region of the cluster evolves with time to the stationary value by a scaling law whose parameters are close to the standard KPZ exponents. We introduce characteristic labels corresponding to closed clockwise contours formed by rotors and show that the sequence of labels has in average an ordered helix structure., Comment: 17 pages, 6 figures

We introduce the concept of metaasabiya, the second non-material resource, to the asabiya theory of historical dynamics. We find that the resulting three variable dynamical system has peculiar features such as repelling or attracting axes and spiralling orbits in the phase space. Depending on the initial state, the system can go through series of oscillatory rises and falls, mimicking the geopolitical evolution of real-world polities. These distinctive features, absent in conventional Lotka-Volterra type biological systems, reveal the hidden richness inherent in the asabiya theory., Comment: LaTeX 14 pages, 9 sets of figures. Revised version. See http://researchmap.jp/jorf7q88x-13620/#_13620 for less technical presentation (in Japanese)

We study the rotor-router walk on the infinite square lattice with the outgoing edges at each lattice site ordered clockwise. In the previous paper [J.Phys.A: Math. Theor. 48, 285203 (2015)], we have considered the loops created by rotors and labeled sites where the loops become closed. The sequence of labels in the rotor-router walk was conjectured to form a spiral structure obeying asymptotically an Archimedean property. In the present paper, we select a subset of labels called "nodes" and consider spirals formed by nodes. The new spirals are directly related to tree-like structures which represent the evolution of the cluster of vertices visited by the walk. We show that the average number of visits to the origin $\left$ by the moment $t\gg 1$ is $\left = 4 \left + O(1)$ where $\left$ is the average number of rotations of the spiral., Comment: 15 pages, 7 figures

The gossip problem (telephone problem) is an information dissemination problem in which each of $n$ nodes of a communication network has a unique piece of information that must be transmitted to all the other nodes using two-way communications (telephone calls) between the pairs of nodes. During a call between the given two nodes, they exchange the whole information known to them at that moment. In this paper we investigate the $k$-fault-tolerant gossip problem, which is a generalization of the gossip problem, where at most $k$ arbitrary faults of calls are allowed. The problem is to find the minimal number of calls $\tau(n,k)$ needed to guarantee the $k$-fault-tolerance. We construct two classes of $k$-fault-tolerant gossip schemes (sequences of calls) and found two upper bounds of $\tau(n,k)$, which improve the previously known results. The first upper bound for general even $n$ is $\tau(n,k) \leq 1/2 n \lceil\log_2 n\rceil + 1/2 n k$. This result is used to obtain the upper bound for general odd $n$. From the expressions for the second upper bound it follows that $\tau(n,k) \leq 2/3 n k + O(n)$ for large $n$. Assuming that the calls can take place simultaneously, it is also of interest to find $k$-fault-tolerant gossip schemes, which can spread the full information in minimal time. For even $n$ we showed that the minimal time is $T(n,k)=\lceil\log_2 n\rceil + k$., Comment: 19 pages, 5 figures

The rotor-router model on a graph describes a discrete-time walk accompanied by the deterministic evolution of configurations of rotors randomly placed on vertices of the graph. We prove the following property: if at some moment of time, the rotors form a closed clockwise contour on the planar graph, then the clockwise rotations of rotors generate a walk which enters into the contour at some vertex $v$, performs a number of steps inside the contour so that the contour formed by rotors becomes anti-clockwise, and then leaves the contour at the same vertex $v$. This property generalizes the previously proved theorem for the case when the rotor configuration inside the contour is a cycle-rooted spanning tree, and all rotors inside the contour perform a full rotation. We use the proven property for an analysis of the sub-diffusive behavior of the rotor-router walk., Comment: 15 pages, 5 figures

We consider the Abelian sandpile model (ASM) on the large square lattice with a single dissipative site (sink). Particles are added by one per unit time at random sites and the resulting density of particles is calculated as a function of time. We observe different scenarios of evolution depending on the value of initial uniform density (height) $h_0=0,1,2,3$. During the first stage of the evolution, the density of particles increases linearly. Reaching a critical density $\rho_c(h_0)$, the system changes its behavior sharply and relaxes exponentially to the stationary state of the ASM with $\rho_s=25/8$. We found numerically that $\rho_c(0)=\rho_s$ and $\rho_c(h_0>0) \neq \rho_s$. Our observations suggest that the equality $\rho_c=\rho_s$ holds for more general initial conditions with non-positive heights. In parallel with the ASM, we consider the conservative fixed-energy Abelian sandpile model (FES). The extensive Monte-Carlo simulations for $h_0=0,1,2,3$ have confirmed that in the limit of large lattices $\rho_c(h_0)$ coincides with the threshold density $\rho_{th}(h_0)$ of FES. Therefore, $\rho_{th}(h_0)$ can be identified with $\rho_s$ if the FES starts its evolution with non-positive uniform height $h_0 \leq 0$., Comment: 6 pages, 8 figures

We introduce a double-stranded Kronig-Penney model and analyze its transport properties. The asymmetric fluxes between two strands with suddenly alternating localization patterns are found as the energy is varied. The zero-size limit of the internal lines connecting two strands is examined using quantum graph vertices with four edges. We also consider a two-dimensional Kronig-Penney lattice with two types of alternating layers with $\delta$ and $\delta'$ connections, and show that the existence of energy bands in which the quantum flux can flow only in selected directions., Comment: 14 pages, 13 figures

We use the transfer matrix formalism for dimers proposed by Lieb, and generalize it to address the corresponding problem for arrow configurations (or trees) associated to dimer configurations through Temperley's correspondence. On a cylinder, the arrow configurations can be partitioned into sectors according to the number of non-contractible loops they contain. We show how Lieb's transfer matrix can be adapted in order to disentangle the various sectors and to compute the corresponding partition functions. In order to address the issue of Jordan cells, we introduce a new, extended transfer matrix, which not only keeps track of the positions of the dimers, but also propagates colors along the branches of the associated trees. We argue that this new matrix contains Jordan cells., Comment: 29 pages, 7 figures

We study a set of scattering matrices of quantum graphs containing minimal number of passbands, i.e., maximal number of zero elements. The cases of even and odd vertex degree are considered. Using a solution of inverse scattering problem, we reconstruct boundary conditions of scale-invariant vertex couplings. Potential-controlled universal flat filtering properties are found for considered types of vertex couplings. Obtained boundary conditions are approximated by simple graphs carrying only $\delta$ potentials and inner magnetic field., Comment: 14 Pages, 4 figures, New references added

A recurrent state of the rotor-routing process on a finite sink-free graph can be represented by a unicycle that is a connected spanning subgraph containing a unique directed cycle. We distinguish between short cycles of length 2 called "dimers" and longer ones called "contours". Then the rotor-router walk performing an Euler tour on the graph generates a sequence of dimers and contours which exhibits both random and regular properties. Imposing initial conditions randomly chosen from the uniform distribution we calculate expected numbers of dimers and contours and correlation between them at two successive moments of time in the sequence. On the other hand, we prove that the excess of the number of contours over dimers is an invariant depending on planarity of the subgraph but not on initial conditions. In addition, we analyze the mean-square displacement of the rotor-router walker in the recurrent state., Comment: 17 pages, 4 figures. J. Stat. Mech. (2014)

The two-dimensional dense O(n) loop model for $n=1$ is equivalent to the bond percolation and for $n=0$ to the dense polymers or spanning trees. We consider the boundary correlations on the half space and calculate the probability $P_b$ that a cluster of bonds has a single common point with the boundary. In the limit $n\rightarrow 0$, we find an analytical expression for $P_b$ using the generalized Kirchhoff theorem., Comment: 23 pages, 14 figures

We study the joint exit probabilities of particles in the totally asymmetric simple exclusion process (TASEP) from space-time sets of given form. We extend previous results on the space-time correlation functions of the TASEP, which correspond to exits from the sets bounded by straight vertical or horizontal lines. In particular, our approach allows us to remove ordering of time moments used in previous studies so that only a natural space-like ordering of particle coordinates remains. We consider sequences of general staircase-like boundaries going from the northeast to southwest in the space-time plane. The exit probabilities from the given sets are derived in the form of Fredholm determinant defined on the boundaries of the sets. In the scaling limit, the staircase-like boundaries are treated as approximations of continuous differentiable curves. The exit probabilities with respect to points of these curves belonging to arbitrary space-like path are shown to converge to the universal Airy$_2$ process., Comment: 46 pages, 7 figures

Given a spanning forest on a large square lattice, we consider by combinatorial methods a correlation function of $k$ paths ($k$ is odd) along branches of trees or, equivalently, $k$ loop--erased random walks. Starting and ending points of the paths are grouped in a fashion a $k$--leg watermelon. For large distance $r$ between groups of starting and ending points, the ratio of the number of watermelon configurations to the total number of spanning trees behaves as $r^{-\nu} \log r$ with $\nu = (k^2-1)/2$. Considering the spanning forest stretched along the meridian of this watermelon, we see that the two--dimensional $k$--leg loop--erased watermelon exponent $\nu$ is converting into the scaling exponent for the reunion probability (at a given point) of $k$ (1+1)--dimensional vicious walkers, $\tilde{\nu} = k^2/2$. Also, we express the conjectures about the possible relation to integrable systems., Comment: 27 pages, 6 figures

We consider the totally asymmetric exclusion process in discrete time with generalized updating rules. We introduce a control parameter into the interaction between particles. Two particular values of the parameter correspond to known parallel and sequential updates. In the whole range of its values the interaction varies from repulsive to attractive. In the latter case the particle flow demonstrates an apparent jamming tendency not typical for the known updates. We solve the master equation for $N$ particles on the infinite lattice by the Bethe ansatz. The non-stationary solution for arbitrary initial conditions is obtained in a closed determinant form., Comment: 11 pages, 3 figures

Single site height probabilities in the Abelian sandpile model, and the corresponding mean height $$, are directly related to the probability $P_{\rm ret}$ that a loop erased random walk passes through a nearest neighbour of the starting site (return probability). The exact values of these quantities on the square lattice have been conjectured, in particular $ = 25/8$ and $P_{\rm ret} = 5/16$. We provide a rigourous proof of this conjecture by using a {\it local} monomer-dimer formulation of these questions., Comment: 12 pages, 11 figures

We consider the equiprobable distribution of spanning trees on the square lattice. All bonds of each tree can be oriented uniquely with respect to an arbitrary chosen site called the root. The problem of predecessors is finding the probability that a path along the oriented bonds passes sequentially fixed sites $i$ and $j$. The conformal field theory for the Potts model predicts the fractal dimension of the path to be 5/4. Using this result, we show that the probability in the predecessors problem for two sites separated by large distance $r$ decreases as $P(r) \sim r^{-3/4}$. If sites $i$ and $j$ are nearest neighbors on the square lattice, the probability $P(1)=5/16$ can be found from the analytical theory developed for the sandpile model. The known equivalence between the loop erased random walk (LERW) and the directed path on the spanning tree says that $P(1)$ is the probability for the LERW started at $i$ to reach the neighboring site $j$. By analogy with the self-avoiding walk, $P(1)$ can be called the return probability. Extensive Monte-Carlo simulations confirm the theoretical predictions., Comment: 7 pages, 2 figures

We present the detailed calculations of the asymptotics of two-site correlation functions for height variables in the two-dimensional Abelian sandpile model. By using combinatorial methods for the enumeration of spanning trees, we extend the well-known result for the correlation $\sigma_{1,1} \simeq 1/r^4$ of minimal heights $h_1=h_2=1$ to $\sigma_{1,h} = P_{1,h}-P_1P_h$ for height values $h=2,3,4$. These results confirm the dominant logarithmic behaviour $\sigma_{1,h} \simeq (c_h\log r + d_h)/r^4 + {\cal O}(r^{-5})$ for large $r$, predicted by logarithmic conformal field theory based on field identifications obtained previously. We obtain, from our lattice calculations, the explicit values for the coefficients $c_h$ and $d_h$ (the latter are new)., Comment: 28 pages

We consider the totally asymmetric simple exclusion process (TASEP) in discrete time with the sublattice parallel dynamics describing particles moving to the right on the one-dimensional infinite chain with equal hoping probabilities. Using sequentially two mappings, we show that the model is equivalent to the TASEP with the backward-ordered sequential update in the case when particles start and finish their motion not simultaneously. The Green functions are obtained exactly in a determinant form for different initial and final conditions., Comment: 11 pages, 4 figures

We present a detailed asymptotic analysis of correlation functions for the two component spanning tree on the two-dimensional lattice when one component contains three paths connecting vicinities of two fixed lattice sites at large distance $s$ apart. We extend the known result for correlations on the plane to the case of the upper half-plane with closed and open boundary conditions. We found asymptotics of correlations for distance $r$ from the boundary to one of the fixed lattice sites for the cases $r\gg s \gg 1$ and $s \gg r \gg 1$., Comment: 16 pages, 5 figures

Following the recent proposal made by Bouttier et al [Phys. Rev. E 76, 041140 (2007)], we study analytically the mobility properties of a single vacancy in the close-packed dimer model on the square lattice. Using the spanning web representation, we find determinantal expressions for various observable quantities. In the limiting case of large lattices, they can be reduced to the calculation of Toeplitz determinants and minors thereof. The probability for the vacancy to be strictly jammed and other diffusion characteristics are computed exactly., Comment: 19 pages, 6 figures

We compute the correlations of two height variables in the two-dimensional Abelian sandpile model. We extend the known result for two minimal heights to the case when one of the heights is bigger than one. We find that the most dominant correlation log r/r^4 exactly fits the prediction obtained within the logarithmic conformal approach., Comment: 5 pages

We consider the totally asymmetric exclusion process on a ring in discrete time with the backward-ordered sequential update and particle-dependent hopping probabilities. Using a combinatorial treatment of the Bethe ansatz, we derive the determinant expression for the non-stationary probability of transitions between particle configurations. In the continuous-time limit, we find a generalization of the recent result, obtained by A. R\'akos and G.M. Sch\"utz for infinite lattice, to the case of ring geometry., Comment: 4 pages, RevTeX4, 2 EPS figures

The totally asymmetric simple exclusion process in discrete time is considered on finite rings with fixed number of particles. A translation-invariant version of the backward-ordered sequential update is defined for periodic boundary conditions. We prove that the so defined update leads to a stationary state in which all possible particle configurations have equal probabilities. Using the exact analytical expression for the propagator, we find the generating function for the conditional probabilities, average velocity and diffusion constant at all stages of evolution. An exact and explicit expression for the stationary velocity of TASEP on rings of arbitrary size and particle filling is derived. The evolution of small systems towards a steady state is clearly demonstrated. Considering the generating function as a partition function of a thermodynamic system, we study its zeros in planes of complex fugacities. At long enough times, the patterns of zeroes for rings with increasing size provide evidence for a transition of the associated two-dimensional lattice paths model into a clustered phase at low fugacities., Comment: 9 pages 5 figures accepted for publication in Physica A