相关论文: Diffusive behavior of a greedy traveling salesman
This paper studies a class of enhanced diffusion processes in which random walkers perform L\'evy flights and apply it for global optimization. L\'evy flights offer controlled balance between exploitation and exploration. We develop four…
\begin{abstract} Greedy permutations, also known as Gonzalez Orderings or Farthest Point Traversals are a standard way to approximate $k$-center clustering and have many applications in sampling and approximating metric spaces. A greedy…
The main focus of this article is to provide a mathematical study of the algorithm proposed in \cite{boyaval2010variance} where the authors proposed a variance reduction technique for the computation of parameter-dependent expectations…
We show how an evolutionary algorithm can successfully be used to evolve a set of difficult to solve symmetric travelling salesman problem instances for two variants of the Lin-Kernighan algorithm. Then we analyse the instances in those…
In times of plenty expectations rise, just as in times of crisis they fall. This can be mathematically described as a Win-Stay-Lose-Shift strategy with dynamic aspiration levels, where individuals aspire to be as wealthy as their average…
In the randomly-oriented Manhattan lattice, every line in $\mathbb{Z}^d$ is assigned a uniform random direction. We consider the directed graph whose vertex set is $\mathbb{Z}^d$ and whose edges connect nearest neighbours, but only in the…
We consider a random walk on one-dimensional inhomogeneous graphs built from Cantor fractals. Our study is motivated by recent experiments that demonstrated superdiffusion of light in complex disordered materials, thereby termed L\'evy…
We present here a model for multivalent diffusive transport whereby a central point-like hub is coupled to multiple feet, which bind to complementary sites on a two-dimensional landscape. The available number of binding interactions is…
In this thesis, we study the diffusive and ballistic behaviors of random walk in random environment (RWRE) in an integer lattice with dimension at least 2. Our contributions are in three directions: a conditional law of large numbers and…
We consider Kleinberg's celebrated small world graph model (Kleinberg, 2000), in which a D-dimensional grid {0,...,n-1}^D is augmented with a constant number of additional unidirectional edges leaving each node. These long range edges are…
We survey recent results of normal and anomalous diffusion of two types of random motions with long memory in ${\Bbb R}^d$ or ${\Bbb Z}^d$. The first class consists of random walks on ${\Bbb Z}^d$ in divergence-free random drift field,…
In this paper, we consider a novel two-dimensional randomized Kaczmarz method and its improved version with simple random sampling, which chooses two active rows with probability proportional to the square of their cross-product-like…
We study the random link traveling salesman problem, where lengths l_ij between city i and city j are taken to be independent, identically distributed random variables. We discuss a theoretical approach, the cavity method, that has been…
We study the spreading of families in two-dimensional multispecies predator-prey systems, in which species cyclically dominate each other. In each time step randomly chosen individuals invade one of the nearest sites of the square lattice…
Commonly, normal diffusive behavior is characterized by a linear dependence of the second central moment on time, $< x^2(t) >\propto t$, while anomalous behavior is expected to show a different time dependence, $ < x^2(t) > \propto…
Intransitivity is a critical issue in pairwise preference modeling. It refers to the intransitive pairwise preferences between a group of players or objects that potentially form a cyclic preference chain and has been long discussed in…
The generalized correlation approach, which has been successfully used in statistical radio physics to describe non-Gaussian random processes, is proposed to describe stochastic financial processes. The generalized correlation approach has…
Constant-factor, polynomial-time approximation algorithms are presented for two variations of the traveling salesman problem with time windows. In the first variation, the traveling repairman problem, the goal is to find a tour that visits…
We consider a minimal model of persistent random searcher with short range memory. We calculate exactly for such searcher the mean first-passage time to a target in a bounded domain and find that it admits a non trivial minimum as function…
The Traveling Salesperson problem asks for the shortest cyclic tour visiting a set of cities given their pairwise distances and belongs to the NP-hard complexity class, which means that with all known algorithms in the worst case instances…