Totally asymmetric simple exclusion process on networks.

We study the totally asymmetric simple exclusion process (TASEP) on complex networks, as a paradigmatic model for transport subject to excluded volume interactions. Building on TASEP phenomenology on a single segment and borrowing ideas from random networks we investigate the effect of connectivity on transport. In particular, we argue that the presence of disorder in the topology of vertices crucially modifies the transport features of a network: irregular networks involve homogeneous segments and have a bimodal distribution of edge densities, whereas regular networks are dominated by shocks leading to a unimodal density distribution. The proposed numerical approach of solving for mean-field transport on networks provides a general framework for studying TASEP on large networks, and is expected to generalize to other transport processes.

[1]  P. K. Mohanty,et al.  Asymmetric simple exclusion process on a Cayley tree , 2010, 1003.3313.

[2]  A. Pipkin,et al.  Kinetics of biopolymerization on nucleic acid templates , 1968, Biopolymers.

[3]  Eytan Domany,et al.  An exact solution of a one-dimensional asymmetric exclusion model with open boundaries , 1992 .

[4]  Book Review: Nonequilibrium Statistical Mechanics in One Dimension , 1999 .

[5]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[6]  G. Schütz,et al.  Phase diagram of one-dimensional driven lattice gases with open boundaries , 1998 .

[7]  M. .. Moore.  Exactly Solved Models in Statistical Mechanics , 1983 .

[8]  T. Liggett,et al.  Stochastic Interacting Systems: Contact, Voter and Exclusion Processes , 1999 .

[9]  D. Helbing.  Traffic and related self-driven many-particle systems , 2000, cond-mat/0012229.

[10]  Katsuhiro Nishinari,et al.  Physics of Transport and Traffic Phenomena in Biology: from molecular motors and cells to organisms , 2005 .

[11]  K. N. Dollman,et al.  - 1 , 1743 .

[12]  Béla Bollobás,et al.  Random Graphs: Notation , 2001 .

[13]  Norbert Kern,et al.  Understanding totally asymmetric simple-exclusion-process transport on networks: generic analysis via effective rates and explicit vertices. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[14]  R. Stinchcombe.  Flow on regular and disordered networks , 2005 .

[15]  Rui Jiang,et al.  Theoretical investigation of synchronous totally asymmetric exclusion processes on lattices with multiple-input-single-output junctions. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[16]  Alessandro Vespignani,et al.  Dynamical Processes on Complex Networks , 2008 .

[17]  Nina Pesheva,et al.  Totally asymmetric exclusion process on chains with a double-chain section in the middle: computer simulations and a simple theory. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[18]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[19]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[20]  Anatoly B. Kolomeisky,et al.  Theoretical investigation of totally asymmetric exclusion processes on lattices with junctions , 2005 .

[21]  L. Santen,et al.  Active transport and cluster formation on 2D networks , 2009, The European physical journal. E, Soft matter.

[22]  Shlomo Havlin,et al.  Anomalous transport in scale-free networks. , 2005, Physical review letters.

[23]  N. Kern,et al.  HEX-TASEP: dynamics of pinned domains for TASEP transport on a periodic lattice of hexagonal topology , 2008 .