Related papers: Is negative-weight percolation compatible with SLE…
We investigate non-perturbative supersymmetry breaking in various models of quantum mechanics, including an interesting class of $PT$-invariant models, using lattice path integrals. These theories are discretized on a temporal Euclidean…
Many 2D lattice models of physical phenomena are conjectured to have conformally invariant scaling limits: percolation, Ising model, self-avoiding polymers, ... This has led to numerous exact (but non-rigorous) predictions of their scaling…
Solving optimization problems leads to elegant and practical solutions in a wide variety of real-world applications. In many of those real-world applications, some of the information required to specify the relevant optimization problem is…
The paper studies asymptotics of moving gap solitons in nonlinear periodic structures of finite contrast ("deep grating") within the one dimensional periodic nonlinear Schr\"odinger equation (PNLS). Periodic structures described by a finite…
Through the rotational invariance of the 2-d critical bond percolation exploration path on the square lattice we express Smirnov's edge parafermionic observable as a sum of two new edge observables. With the help of these two new edge…
As an image of the many-to-one map of loop-erasing operation $\LE$ of random walks, a self-avoiding walk (SAW) is obtained. The loop-erased random walk (LERW) model is the statistical ensemble of SAWs such that the weight of each SAW…
Accessibility percolation is a new type of percolation problem inspired by evolutionary biology. To each vertex of a graph a random number is assigned and a path through the graph is called accessible if all numbers along the path are in…
In this article, we investigate both site and bond percolation on a weighted planar stochastic lattice (WPSL) which is a multi-multifractal and whose dual is a scale-free network. The characteristic properties of percolation is that it…
We show that the known matrix representations of the stationary state algebra of the Asymmetric Simple Exclusion Process (ASEP) can be interpreted combinatorially as various weighted lattice paths. This interpretation enables us to use the…
We consider superconductivity and pair density waves (PDWs) arising from off-site pairing in frustrated lattice geometries. We express the pair susceptibility in a generic form that highlights the importance of both the density of states,…
In this study a new type of non-reflective boundary condition (NRBC) for the Lattice Boltzmann Method (LBM) is proposed; the Non-equilibrium Symmetry Boundary Condition (NSBC). The idea behind this boundary condition is to utilize the…
Consider a setting where possibly sensitive information sent over a path in a network is visible to every {neighbor} of the path, i.e., every neighbor of some node on the path, thus including the nodes on the path itself. The exposure of a…
After a short introduction to the nonmesonic weak decay (NMWD) $\Lambda N\go nN$ of $\Lambda$-hypernuclei we discuss the long-standing puzzle on the ratio $\Gamma_n/\Gamma_p$, and some recent experimental evidences that signalized towards…
The statistics of equally weighted random paths (ideal polymer) is studied in $2$ and $3$ dimensional percolating clusters. This is equivalent to diffusion in the presence of a trapping environment. The number of $N$ step walks follows a…
We consider the optimal paths in a $d$-dimensional lattice, where the bonds have isotropically correlated random weights. These paths can be interpreted as the ground state configuration of a simplified polymer model in a random potential.…
Unidirectional and robust transport is generally observed at the edge of two- or three-dimensional quantum Hall and topological insulator systems. A hallmark of these systems is topological protection, i.e. the existence of propagative edge…
Transport in weighted networks is dominated by the minimum spanning tree (MST), the tree connecting all nodes with the minimum total weight. We find that the MST can be partitioned into two distinct components, having significantly…
Stochastic Loewner evolution (SLE) is a differential equation driven by a one-dimensional Brownian motion (BM), whose solution gives a stochastic process of conformal transformation on the upper half complex-plane $\H$. As an evolutionary…
The average node-to-node distance of scale-free graphs depends logarithmically on N, the number of nodes, while the probability distribution function (pdf) of the distances may take various forms. Here we analyze these by considering…
Let $G=(V,E)$ be an $n$-nodes non-negatively real-weighted undirected graph. In this paper we show how to enrich a {\em single-source shortest-path tree} (SPT) of $G$ with a \emph{sparse} set of \emph{auxiliary} edges selected from $E$, in…