Related papers: Possible Connection between the Optimal Path and F…
The properties of the similarity transformation in percolation theory in the complex plane of the percolation probability are studied. It is shown that the percolation problem on a two-dimensional square lattice reduces to the Mandelbrot…
The probability distribution for the number of top to bottom spanning clusters in Directed percolation in two and three dimensions appears to be universal and is of the form $P(n) \sim \exp(-\alpha n^2)$. We argue that $\alpha$ is a new…
We study the very long-range bond-percolation problem on a linear chain with both sites and bonds dilution. Very long range means that the probability $p_{ij}$ for a connection between two occupied sites $i,j$ at a distance $r_{ij}$ decays…
An explosive percolation transition is the abrupt emergence of a giant cluster at a threshold caused by a suppression of the growth of large clusters. In this paper, we consider the information entropy of the cluster size distribution,…
We consider invasion percolation on a rooted regular tree. For the infinite cluster invaded from the root, we identify the scaling behavior of its $r$-point function for any $r\geq2$ and of its volume both at a given height and below a…
We study the speed of a biased random walk on a percolation cluster on $\Z^d$ in function of the percolation parameter $p$. We obtain a first order expansion of the speed at $p=1$ which proves that percolating slows down the random walk at…
We study the long range percolation model on $\mathbb{Z}$ where sites $i$ and $j$ are connected with probability $\beta |i-j|^{-s}$. Graph distances are now well understood for all exponents $s$ except in the case $s=2$ where the model…
The optimization of the mixing of a passive scalar at finite P\'eclet number $Pe=Uh/\kappa$ (where $U,h$ are characteristic velocity and length scales and $\kappa$ is the scalar diffusivity) is relevant to many significant flow challenges…
We study the transport properties of model networks such as scale-free and Erd\H{o}s-R\'{e}nyi networks as well as a real network. We consider the conductance $G$ between two arbitrarily chosen nodes where each link has the same unit…
We investigate by exact optimization the geometrical properties of three-dimensional elastic line systems with point disorder and hard-core repulsion. The line 'forests' become entangled due to increasing line wandering as the system height…
This work shows how the early stages of perturbation growth in a viscosity-stratified flow are different from those in a constant-viscosity flow, and how nonlinearity is a crucial ingredient. We derive the viscosity-varying adjoint…
A lattice-based model for continuum percolation is applied to the case of randomly located, partially aligned sticks with unequal lengths in 2D which are allowed to cross each other. Results are obtained for the critical number of sticks…
In last passage percolation models, the energy of a path is maximized over all directed paths with given endpoints in a random environment, and the maximizing paths are called geodesics. The geodesics and their energy can be scaled so that…
We consider the percolation problem in the high-temperature Ising model on the two-dimensional square lattice at/near critical external fields. We show that all scaling relations, except a single hyperscaling relation, hold under the power…
Tracer-diffusion of small molecules through dense systems of chain polymers is studied within an athermal lattice model, where hard core interactions are taken into account by means of the site exclusion principle. An approximate mapping of…
Transportation and distribution networks are a class of spatial networks that have been of interest in recent years. These networks are often characterized by the presence of complex structures such as central loops paired with peripheral…
Recent research highlighted the scaling property of human and animal mobility. An interesting issue is that the exponents of scaling law for animals and humans in different situations are quite different. This paper proposes a general…
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…
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…
We study numerically the distributions of the length $L$ of the longest increasing subsequence (LIS) for the two cases of random permutations and of one-dimensional random walks. Using sophisticated large-deviation algorithms, we are able…