Search arXivSearch

arXiv · 1806.04126

Effect of walking-distance on a queuing system of totally asymmetric simple exclusion process equipped with functions of site assignments

Abstract

This paper proposes a totally asymmetric simple exclusion process on a traveling lane, which is equipped with a queueing system and functions of site assignments along the parking lane. In the proposed system, new particles arrive at the rear of the queue existing at the leftmost site of the system. A particle at the head of the queue selects one of the empty sites in the parking lane and reserves it for stopping at once during its travel. The arriving time and staying time in the parking sites follow half-normal distributions. The random selections of empty sites are controlled by the bias of the exponential function. Our simulation results show the unique shape of site usage distributions. In addition, the number of reserved sites is found to increase with an S-shape curve as the bias to the rightmost site increases. To describe this phenomena, we propose an approximation model, which is derived from the birth-death process and extreme order statistics. A queueing model that takes the effect of distance from the leftmost site of the traveling lane into consideration is further proposed. Our approximation model properly describes the distributions of site usage, and the proposed queueing model shows good agreement with the simulation results.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Satori Tsuzuki, Daichi Yanagisawa, Katsuhiro Nishinari. 2018-07-23. Effect of walking-distance on a queuing system of totally asymmetric simple exclusion process equipped with functions of site assignments. https://doi.org/10.1103/physreve.98.042102

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Dimension-dependent continuum limits in tissue mechanics

Continuum descriptions of epithelial tissue mechanics can replace expensive individual-based simulations with tractable macroscopic models, yet the link between cell-scale forces and tissue-scale transport remains poorly understood. We show that dimensionality controls this link: long-time mechanical relaxation rates reveal generalized porous-media-type nonlinear transport phenomena, $D(ρ)\proptoρ^γ$. Exponents in nonlinear diffusivities are fixed by microscopic mechanics and dimensionality, providing a novel physical mechanism for emergent macroscopic transport phenomena.

nlin.CG

Gliders on Aperiodic Monotilings: Cellular Automata on the Hat and Spectre

The hat and spectre monotiles, discovered in 2023, tile the plane only aperiodically; no cellular automaton dynamics on these tilings has previously been reported. Cellular automata are studied here on patches generated by finite-state transducers, so that every experiment regenerates deterministically from a small record. Within edge-adjacency semi-totalistic rules, exhaustive and evolutionary searches find only mortal travelers: gliders are absent. Guided by a reproduction of the known Penrose-tiling glider, the rule space is extended to vertex neighborhoods and to priority-table rules whose non-quiescent states are visible to neighbors. Evolutionary search then discovers gliders on both monotilings; tracked by a sliding window that regenerates the patch along the flight, they travel one million rings at constant speed and heading. All headings are quantized, to millidegrees, onto a six-spoke compass - the fast axes of the tiling's graph metric. An ablation shows both rule-space extensions are individually necessary. All results replay exactly in an accompanying interactive essay.

nlin.CG

Diagonal Bases and Diagonal Periods of Elementary Cellular Automata

Which cellular-automaton diagonal families form bases in every finite window? For canonical polynomial lifts of elementary rules, two truth-table bits determine triangularity, and units on the matrix diagonal determine invertibility. Exactly 24 rules give universal binary bases; all remain universal over every modulus. Among triangular binary coordinate maps, the Pascal transform is uniquely characterized by converting OR convolution into pointwise multiplication, while increment becomes strict prefix summation. Explicit inverses and coordinate comparisons distinguish sparsity from evaluation cost. A Rule 30 polynomial construction gives Fibonacci bounds on interpolation order and prime-modulus periods. Exact additive periods anchor a finite census modulo two and three. These results separate all-window basis classification from optimization of a representation and from period patterns observed in finite windows.

nlin.CG