Related papers: Emergent correlations in the selected link-times a…
Random walks on discrete lattices are fundamental models that form the basis for our understanding of transport and diffusion processes. For a single random walker on complex networks, many properties such as the mean first passage time and…
The article covers the one-dimensional Kardar-Parisi-Zhang equation, weak drive limit, universality, directed polymers in a random medium, replica solutions, statistical mechanics of line ensembles, and its generalization to several…
The one-point distribution of the height for the continuum Kardar-Parisi-Zhang (KPZ) equation is determined numerically using the mapping to the directed polymer in a random potential at high temperature. Using an importance sampling…
The emergence of heavy-tailed statistics in complex systems is conventionally attributed to non-local stochastic jumps or non-Markovian memory. Here, we present a one-dimensional random walk where power-law behaviors arise instead from a…
We study the optimal distance in networks, $\ell_{\scriptsize opt}$, defined as the length of the path minimizing the total weight, in the presence of disorder. Disorder is introduced by assigning random weights to the links or nodes. For…
The one-point distribution of the height for the continuum Kardar-Parisi-Zhang (KPZ) equation is determined numerically using the mapping to the directed polymer in a random potential at high temperature. Using an importance sampling…
We study discrete KPZ growth models deposited on square lattice substrates, whose (average) lateral size enlarges as $L= L_0 + \omega t^{\gamma}$. Our numerical simulations reveal that the competition between the substrate expansion and the…
Obtaining the exact multi-time correlations for one-dimensional growth models described by the Kardar-Parisi-Zhang (KPZ) universality class is presently an outstanding open problem. Here, we study the joint probability distribution function…
We consider last passage percolation on $\mathbb Z^2$ with general weight distributions, which is expected to be a member of the Kardar-Parisi-Zhang (KPZ) universality class. In this model, an oriented path between given endpoints which…
Supplementing a lattice with long-range connections effectively models small-world networks characterized by a high local and global interconnectedness observed in systems ranging from society to the brain. If the links have a wiring cost…
This paper is concerned with the limiting spectral behaviors of large dimensional Kendall's rank correlation matrices generated by samples with independent and continuous components. We do not require the components to be identically…
Integrable spin chains with a continuous non-Abelian symmetry, such as the one-dimensional isotropic Heisenberg model, show superdiffusive transport with little theoretical understanding. Although recent studies reported a surprising…
Recently, In [Phys. Rev. Lett. 104, 018701 (2010)] the authors studied a spatial network which is constructed from a regular lattice by adding long-range edges (shortcuts) with probability $P_{ij}\sim r_{ij}^{-\alpha}$, where $r_{ij}$ is…
Considering the optimal alignment of two i.i.d. random sequences of length $n$, we show that when the scoring function is chosen randomly, almost surely the empirical distribution of aligned letter pairs in all optimal alignments converges…
We study the splitting of regular square lattices subject to stochastic intermittent flows. Various flow patterns are produced by different groupings of the nodes, based on their random alternation between two possible states. The resulting…
We consider a stochastic directed graph on the integers whereby a directed edge between $i$ and a larger integer $j$ exists with probability $p_{j-i}$ depending solely on the distance between the two integers. Under broad conditions, we…
Spreading according to simple rules (e.g. of fire or diseases), and shortest-path distances are studied on d-dimensional systems with a small density p per site of long-range connections (``Small-World'' lattices). The volume V(t) covered…
We consider a directed graph on the 2-dimensional integer lattice, placing a directed edge from vertex $(i_1,i_2)$ to $(j_1,j_2)$, whenever $i_1 \le j_1$, $i_2 \le j_2$, with probability $p$, independently for each such pair of vertices.…
High-dimensional sample correlation matrices are a crucial class of random matrices in multivariate statistical analysis. The central limit theorem (CLT) provides a theoretical foundation for statistical inference. In this paper, assuming…
In this paper we study the Motter-Lai model of cascading failures induced by overloads in both isotropic and anisotropic spatial networks, generated by placing nodes in a square lattice and using various distributions of link lengths and…