Related papers: Phase Diagram of Optimal Paths
We show a connection between sampling and optimization on discrete domains. For a family of distributions $\mu$ defined on size $k$ subsets of a ground set of elements that is closed under external fields, we show that rapid mixing of…
Random walks are the simplest way to explore or search a graph, and have revealed a very useful tool to investigate and characterize the structural properties of complex networks from the real world, e.g. they have been used to identify the…
Gradient-based (a.k.a. `first order') optimization algorithms are routinely used to solve large scale non-convex problems. Yet, it is generally hard to predict their effectiveness. In order to gain insight into this question, we revisit the…
The event graph representation of temporal networks suggests that the connectivity of temporal structures can be mapped to a directed percolation problem. However, similar to percolation theory on static networks, this mapping is valid…
By analyzing the real space nonequilibrium dynamics of polymers, we elucidate the physics of driven translocation and propose its dynamical scaling scenario analogous to that in the surface growth phenomena. We provide a detailed account of…
We give a geometrically exact treatment of percolation through voids around assemblies of randomly placed impermeable barrier particles, introducing a computationally inexpensive approach to finding critical barrier density thresholds…
This paper addresses the problem of finding multiple near-optimal, spatially-dissimilar paths that can be considered as alternatives in the decision making process, for finding optimal corridors in which to construct a new road. We further…
We study the fractal properties of depth-first search (DFS) paths in critical configurations of statistical physics models, including the two-dimensional $O(n)$ loop model for various $n$, and bond percolation in dimensions $d = 2$ to $6$.…
Because of a close blood relationship between directed percolation & directed polymers in random media, the latter's journey to asymptotic scaling can be greatly retarded by an uninformed choice of departure point; i.e., the bare-bond PDF…
The effects of two types of randomness on the behaviour of directed polymers are discussed in this chapter. The first part deals with the effect of randomness in medium so that a directed polymer feels a random external potential. The…
The evolution of many kinetic processes in 1+1 (space-time) dimensions results in 2d directed percolative landscapes. The active phases of these models possess numerous hidden geometric orders characterized by various types of large-scale…
We introduce a new disorder regime for directed polymers with one space and one time dimension that is accessed by scaling the inverse temperature parameter \beta with the length of the polymer n. We scale \beta_n := \beta n^{-\alpha} for…
We describe some recent results concerning the statistical properties of a self-interacting polymer stretched by an external force. We concentrate mainly on the cases of purely attractive or purely repulsive self-interactions, but our…
Motivated by an investigation of ground state properties of randomly charged polymers, we discuss the size distribution of the largest Q-segments (segments with total charge Q) in such N-mers. Upon mapping the charge sequence to…
We demonstrate that conventional artificial deep neural networks operating near the phase boundary of the signal propagation dynamics, also known as the edge of chaos, exhibit universal scaling laws of absorbing phase transitions in…
These lecture notes are a guided tour through the fascinating world of polymer chains interacting with themselves and/or with their environment. The focus is on the mathematical description of a number of physical and chemical phenomena,…
Molecules with complex internal structure in time-dependent periodic potentials are studied by using short Rubinstein-Duke model polymers as an example. We extend our earlier work on transport in stochastically varying potentials to cover…
We study the replacement paths problem in the $\mathsf{CONGEST}$ model of distributed computing. Given an $s$-$t$ shortest path $P$, the goal is to compute, for every edge $e$ in $P$, the shortest-path distance from $s$ to $t$ avoiding $e$.…
In the maximum independent set of convex polygons problem, we are given a set of $n$ convex polygons in the plane with the objective of selecting a maximum cardinality subset of non-overlapping polygons. Here we study a special case of the…
Diffusion Probabilistic Models (DPMs) have demonstrated exceptional capability of generating high-quality and diverse images, but their practical application is hindered by the intensive computational cost during inference. The DPM…