Related papers: Perturbing the Shortest Path on a Critical Directe…
We study the random walk on dynamical percolation of $\mathbb{Z}^d$ (resp., the two-dimensional triangular lattice $\mathcal{T}$), where each edge (resp., each site) can be either open or closed, refreshing its status at rate $\mu\in…
This is a pedagogical review of the subject of linear polymers on deterministic finitely ramified fractals. For these, one can determine the critical properties exactly by real-space renormalization group technique. We show how this is used…
We study a generalization of site percolation on a simple cubic lattice, where not only single sites are removed randomly, but also entire parallel columns of sites. We show that typical clusters near the percolation transition are very…
We study the two most common types of percolation process on a sparse random graph with a given degree sequence. Namely, we examine first a bond percolation process where the edges of the graph are retained with probability p and afterwards…
We study bond percolation on several four-dimensional (4D) lattices, including the simple (hyper) cubic (SC), the SC with combinations of nearest neighbors and second nearest neighbors (SC-NN+2NN), the body-centered cubic (BCC), and the…
The decay of directional correlations in self-avoiding random walks on the square lattice is investigated. Analysis of exact enumerations and Monte Carlo data suggest that the correlation between the directions of the first step and the…
The shortest-path percolation (SPP) model aims at describing the consumption and eventual exhaustion of a network's resources. Starting from a network containing a macroscopic connected component, random pairs of nodes are sequentially…
We analyze the geometry of scaling limits of near-critical 2D percolation, i.e., for $p=p_c+\lambda\delta^{1/\nu}$, with $\nu=4/3$, as the lattice spacing $\delta \to 0$. Our proposed framework extends previous analyses for $p=p_c$, based…
A computational study of sliding blocks on inclined surfaces is presented. Assuming that the friction coefficient $\mu$ is a function of position, the probability $P(\lambda)$ for the block to slide down over a length $\lambda$ is…
Digital twins and other simulators are increasingly used to support routing decisions in large-scale networks. However, simulator outputs often exhibit systematic bias, while ground-truth measurements are costly and scarce. We study a…
We have obtained the universal conductance distribution of two-dimensional disordered systems in the strongly localized limit. This distribution is directly related to the Tracy-Widom distribution, which has recently appeared in many…
Like a free particle, the initial growth of a broad (relative to lattice spacing) wavepacket placed on an ordered lattice is slow (zero initial slope) and becomes linear in $t$ at long time. On a disordered lattice, the growth is inhibited…
We show the existence of a scaling limit for the crossing probabilities on the square lattice in an equilateral triangle for the critical percolation. We also show that Cardy's formula does not hold on the square lattice for the critical…
We study the model of Directed Polymers in Random Environment in 1+1 dimensions, where the distribution at a site has a tail which decays regularly polynomially with power \alpha, where \alpha \in (0,2). After proper scaling of temperature…
Recently Grassberger has shown that the correction to scaling for the conductance of a bond percolation network on a square lattice is a nonmonotonic function of the linear lattice dimension with a minimum at $L = 10$, while this anomalous…
We consider a percolation process in which $k$ points separated by a distance proportional to system size $L$ simultaneously connect together ($k>1$), or a single point at the center of a system connects to the boundary ($k=1$), through…
Computing a shortest path between two nodes in an undirected unweighted graph is among the most basic algorithmic tasks. Breadth first search solves this problem in linear time, which is clearly also a lower bound in the worst case.…
We study quantum interference effects on the transition strength for strongly localized electrons hopping on 2D square and 3D cubic lattices in the presence of a magnetic field B. These effects arise from the interference between phase…
We consider the minimum-weight path between any pair of nodes of the n-vertex complete graph in which the weights of the edges are i.i.d. exponentially distributed random variables. We show that the longest of these minimum-weight paths has…
We investigate site and bond percolation in triangular and square lattices subjected to linear distortion. In contrast to previously studied distortion schemes that preserve lattice geometry, linear distortion dislocates regular lattice…