Related papers: Perturbing the Shortest Path on a Critical Directe…
We report an empirical power law for the reduction of network permeability in statistically homogeneous spatial networks upon removal of a single edge. We characterize this power law for plexus-like microvascular sinusoidal networks from…
Motivated by the diffusion-reaction kinetics on interstellar dust grains, we study a first-passage problem of mortal random walkers in a confined two-dimensional geometry. We provide an exact expression for the encounter probability of two…
A sorting network is a shortest path from $12 \cdots n$ to $n \cdots 2 1$ in the Cayley graph of the symmetric group generated by adjacent transpositions. For a uniform random sorting network, we prove that in the global limit, particle…
We study the effect of a single excluded site on the diffusion of a particle undergoing random walk in a d-dimensional lattice. The determination of the characteristic function allows to find explicitly the asymptotical behaviour of…
We investigate the connectivity properties of square lattices with nearest-neighbor interactions, where some sites have a reduced coordination number, meaning that certain sites can only connect through three or two adjacent sites. This…
We continue our investigation of the phenomenological implications of the "deformed" commutation relations [x_i,p_j]=i hbar[(1 + beta p^2) delta_{ij} + beta' p_i p_j]. These commutation relations are motivated by the fact that they lead to…
We study directed last-passage percolation on the planar square lattice whose weights have general distributions, or equivalently, queues in series with general service distributions. Each row of the last passage model has its own randomly…
Motivated by a biased diffusion of molecular motors with the bias dependent on the state of the substrate, we investigate a random walk on a one-dimensional lattice that contains weak links (called "bridges'') which are affected by the…
In long-range percolation on $\mathbb{Z}^d$, points $x$ and $y$ are connected by an edge with probability $1-\exp(-\beta\|x-y\|^{-d-\alpha})$, where $\alpha>0$ is fixed and $\beta \geq 0$ is a parameter. As $d$ and $\alpha$ vary, the model…
We study bond percolation on the square lattice with one-dimensional inhomogeneities. Inhomogeneities are introduced in the following way: A vertical column on the square lattice is the set of vertical edges that project to the same vertex…
We consider directed last-passage percolation on the random graph G = (V,E) where V = Z and each edge (i,j), for i < j, is present in E independently with some probability 0 < p <= 1. To every present edge (i,j) we attach i.i.d. random…
We argue that the elastic backbone (EB) (union of shortest paths) on a cylindrical system, recently studied by Sampaio Filho et al. [Phys. Rev. Lett. 120, 175701 (2018)], is in fact the backbone of two-dimensional directed percolation (DP).…
We use recently developed primitive path analysis (PPA) methods to study the effect of equilibration on entanglement density in model polymeric systems. Values of N_e for two commonly used equilibration methods differ by a factor of two or…
In first-passage percolation (FPP), one assigns i.i.d.~weights to the edges of the cubic lattice $\mathbb{Z}^d$ and analyzes the induced weighted graph metric. If $T(x,y)$ is the distance between vertices $x$ and $y$, then a primary…
The phenomenon of percolation is one of the core topics in statistical mechanics. It allows one to study the phase transition known in real physical systems only in a purely geometrical way. In this paper, we determine thresholds $p_c$ for…
We consider a constrained version of the shortest path problem on the complete graphs whose edges have independent random lengths and costs. We establish the asymptotic value of the minimum length as a function of the cost-budget within a…
How local cracks can contribute to the global cracks landscape is a goal of several scientific topics, for example, how bottlenecks can impact the robustness of traffic into a city? In one direction, cracks from cascading failures into…
The Newman-Watts model is given by taking a cycle graph of n vertices and then adding each possible edge $(i,j), |i-j|\neq 1 \mod n$ with probability $\rho/n$ for some $\rho>0$ constant. In this paper we add i.i.d. exponential edge weights…
Directed paths have been used extensively in the scientific literature as a model of a linear polymer. Such paths models in particular the conformational entropy of a linear polymer and the effects it has on the free energy. These directed…
We study directed last passage percolation on the first quadrant of the planar square lattice whose weights have general distributions, or equivalently, ./G/1 queues in series. The service time distributions of the servers vary randomly…