Related papers: Target-searching on the percolation
Accurate scale estimation of a target is a challenging research problem in visual object tracking. Most state-of-the-art methods employ an exhaustive scale search to estimate the target size. The exhaustive search strategy is…
What is the fastest way of finding a randomly hidden target? This question of general relevance is of vital importance for foraging animals. Experimental observations reveal that the search behaviour of foragers is generally intermittent:…
This study demonstrates a method to locate an ideal perch location on a tree for vision-guided autonomous tree-perching drones. Various image processing algorithms, including those used for machine learning, image segmentation and binary…
We study Bernoulli bond percolation on a random recursive tree of size $n$ with percolation parameter $p(n)$ converging to $1$ as $n$ tends to infinity. The sizes of the percolation clusters are naturally stored in a tree. We prove…
We study neural connectivity in cultures of rat hippocampal neurons. We measure the neurons' response to an electric stimulation for gradual lower connectivity, and characterize the size of the giant cluster in the network. The connectivity…
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…
Markov chain Monte Carlo algorithms are used to simulate from complex statistical distributions by way of a local exploration of these distributions. This local feature avoids heavy requests on understanding the nature of the target, but it…
Iterated localization is considered where each node of a network needs to get localized (find its location on 2-D plane), when initially only a subset of nodes have their location information. The iterated localization process proceeds as…
Numerical simulations of Diffusion-Limited and Reaction-Limited Cluster-Cluster Aggregation processes of identical particles are performed in a two-dimensional box. It is shown that, for concentrations larger than a characteristic gel…
We theoretically address minimal search strategies of active, self-propelled particles towards hidden targets in three-dimensional space. The particles can sense if a target is close, e.g., by detecting signaling molecules released by a…
The number of free sites next to the end of a self-avoiding walk is known as the atmosphere. The average atmosphere can be related to the number of configurations. Here we study the distribution of atmospheres as a function of length and…
We consider the problem of search through comparisons, where a user is presented with two candidate objects and reveals which is closer to her intended target. We study adaptive strategies for finding the target, that require knowledge of…
We investigate the problem of growing clusters, which is modeled by two dimensional disks and three dimensional droplets. In this model we place a number of seeds on random locations on a lattice with an initial occupation probability, $p$.…
In combination with Reinforcement Learning, Monte-Carlo Tree Search has shown to outperform human grandmasters in games such as Chess, Shogi and Go with little to no prior domain knowledge. However, most classical use cases only feature up…
Recent advances in bandit tools and techniques for sequential learning are steadily enabling new applications and are promising the resolution of a range of challenging related problems. We study the game tree search problem, where the goal…
We study the exchange and correlation hole of the valence shell of second row atoms using variational Monte Carlo techniques, especially correlated estimates, and norm-conserving pseudopotentials. The well-known scaling of the valence shell…
Imagine a tracking agent $P$ who wants to follow a moving target $Q$ in $d$-dimensional Euclidean space. The tracker has access to a noisy location sensor that reports an estimate $\tilde{Q}(t)$ of the target's true location $Q(t)$ at time…
Percolation theory is usually applied to lattices with a uniform probability p that a site is occupied or that a bond is closed. The more general case, where p is a function of the position x, has received less attention. Previous studies…
We investigate a critical scaling law for the cluster heterogeneity $H$ in site and bond percolations in $d$-dimensional lattices with $d=2,...,6$. The cluster heterogeneity is defined as the number of distinct cluster sizes. As an…
The problem of tracking the source of a passive scalar in a turbulent flow is relevant to flying insect behavior and several other applications. Extensive previous work has shown that certain Bayesian strategies, such as "infotaxis," can be…