Searcharxiv⌕ Search

arXiv subjects

V. B. Priezzhev

Publications and source records attributed to V. B. Priezzhev.

At least 19 recordsLinked to original sources

A model of irreversible jam formation in dense traffic

We study an one-dimensional stochastic model of vehicular traffic on open segments of a single-lane road of finite size $L$. The vehicles obey a stochastic discrete-time dynamics which is a limiting case of the generalized Totally Asymmetric Simple Exclusion Process. This dynamics has been previously used by Bunzarova and Pesheva [Phys. Rev. E 95, 052105 (2017)] for an one-dimensional model of irreversible aggregation. The model was shown to have three stationary phases: a many-particle one, MP, a phase with completely filled configuration, CF, and a boundary perturbed MP+CF phase, depending on the values of the particle injection ($α$), ejection ($β$) and hopping ($p$) probabilities. Here we extend the results for the stationary properties of the MP+CF phase, by deriving exact expressions for the local density at the first site of the chain and the probability P(1) of a completely jammed configuration. The unusual phase transition, characterized by jumps in both the bulk density and the current (in the thermodynamic limit), as $α$ crosses the boundary $α=p$ from the MP to the CF phase, is explained by the finite-size behavior of P(1). By using a random walk theory, we find that, when $α$ approaches from below the boundary $α=p$, three different regimes appear, as the size $L\rightarrow \infty$: (i) the lifetime of the gap between the rightmost clusters is of the order $O(L)$ in the MP phase; (ii) small jams, separated by gaps with lifetime $O(1)$, exist in the MP+CF phase close to the left chain boundary; and (iii) when $β=p$, the jams are divided by gaps with lifetime of the order $O(L^{1/2})$. These results are supported by extensive Monte Carlo calculations.

cond-mat.stat-mech↗

Perfect boundaries in rotor-router aggregation on cylinders

We study a rotor-router version of the internal diffusion-limited aggregation introduced by J.Propp. The existing estimations of boundary fluctuations of the aggregation cluster show that they grow not faster than $O(\log r)$ with the cluster radius $r$. We consider the rotor-router internal DLA on the semi-infinite cylinder and prove a constant width of boundary fluctuations not depending on the radius of the cylinder.

math.CO↗

Rotor-Router Walk on a Semi-infinite Cylinder

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.

cond-mat.stat-mech↗

Spiral Structures in the Rotor-Router Walk

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.

math.PR↗

A Loop Reversibility and Subdiffusion of the Rotor-Router Walk

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.

math-ph↗

Emergence of jams in the generalized totally asymmetric simple exclusion process

The generalized totally asymmetric exclusion process (TASEP) [J. Stat. Mech. P05014 (2012)] is an integrable generalization of the TASEP equipped with an interaction, which enhances the clustering of particles. The process interpolates between two extremal cases: the TASEP with parallel update and the process with all particles irreversibly merging into a single cluster moving as an isolated particle. We are interested in the large time behavior of this process on a ring in the whole range of the parameter $λ$ controlling the interaction. We study the stationary state correlations, the cluster size distribution and the large-time fluctuations of integrated particle current. When $λ$ is finite, we find the usual TASEP-like behavior: The correlation length is finite; there are only clusters of finite size in the stationary state and current fluctuations belong to the Kardar-Parisi-Zhang universality class. When $λ$ grows with the system size so does the correlation length. We find a nontrivial transition regime with clusters of all sizes on the lattice. We identify a crossover parameter and derive the large deviation function for particle current, which interpolates between the case considered by Derrida-Lebowitz and a single particle diffusion.

math-ph↗

Non-contractible loops in the dense O(n) loop model on the cylinder

A lattice model of critical dense polymers $O(0)$ is considered for the finite cylinder geometry. Due to the presence of non-contractible loops with a fixed fugacity $ξ$, the model is a generalization of the critical dense polymers solved by Pearce, Rasmussen and Villani. We found the free energy for any height $N$ and circumference $L$ of the cylinder. The density $ρ$ of non-contractible loops is found for $N \rightarrow \infty$ and large $L$. The results are compared with those obtained for the anisotropic quantum chain with twisted boundary conditions. Using the latter method we obtained $ρ$ for any $O(n)$ model and an arbitrary fugacity.

cond-mat.stat-mech↗

Transfer matrix for spanning trees, webs and colored forests

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.

cond-mat.stat-mech↗

Euler tours and unicycles in the rotor-router model

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.

math.CO↗

Correlations in the $n\rightarrow 0$ limit of the dense O(n) loop model

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.

cond-mat.stat-mech↗

Universal exit probabilities in the TASEP

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.

cond-mat.stat-mech↗

From elongated spanning trees to vicious random walks

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^{-ν} \log r$ with $ν= (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 $ν$ is converting into the scaling exponent for the reunion probability (at a given point) of $k$ (1+1)--dimensional vicious walkers, $\tildeν = k^2/2$. Also, we express the conjectures about the possible relation to integrable systems.

cond-mat.stat-mech↗

The totally asymmetric exclusion process with generalized update

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.

cond-mat.stat-mech↗

Return probability for the loop-erased random walk and mean height in sandpile : a proof

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.

cond-mat.stat-mech↗

Numerical Study of the Correspondence Between the Dissipative and Fixed Energy Abelian Sandpile Models

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 $ρ_c(h_0)$, the system changes its behavior sharply and relaxes exponentially to the stationary state of the ASM with $ρ_s=25/8$. We found numerically that $ρ_c(0)=ρ_s$ and $ρ_c(h_0>0) \neq ρ_s$. Our observations suggest that the equality $ρ_c=ρ_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 $ρ_c(h_0)$ coincides with the threshold density $ρ_{th}(h_0)$ of FES. Therefore, $ρ_{th}(h_0)$ can be identified with $ρ_s$ if the FES starts its evolution with non-positive uniform height $h_0 \leq 0$.

cond-mat.soft↗

Generalized Green Functions and current correlations in the TASEP

We study correlation functions of the totally asymmetric simple exclusion process (TASEP) in discrete time with backward sequential update. We prove a determinantal formula for the generalized Green function which describes transitions between positions of particles at different individual time moments. In particular, the generalized Green function defines a probability measure at staircase lines on the space-time plane. The marginals of this measure are the TASEP correlation functions in the space-time region not covered by the standard Green function approach. As an example, we calculate the current correlation function that is the joint probability distribution of times taken by selected particles to travel given distance. An asymptotic analysis shows that current fluctuations converge to the ${Airy}_2$ process.

math-ph↗

The problem of predecessors on spanning trees

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.

cond-mat.stat-mech↗

Logarithmic two-point correlators in the Abelian sandpile model

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 $σ_{1,1} \simeq 1/r^4$ of minimal heights $h_1=h_2=1$ to $σ_{1,h} = P_{1,h}-P_1P_h$ for height values $h=2,3,4$. These results confirm the dominant logarithmic behaviour $σ_{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).

cond-mat.stat-mech↗