Related papers: Sharp Concentration of Hitting Size for Random Set…
A method of statistical selection of short lived particles in high multiplicity nucleus-nucleus collisions is discussed.
In this paper, we study the following detection problem. There are $n$ detectors randomly placed in the unit square $S = \left[-\frac{1}{2},\frac{1}{2}\right]^2$ assigned to detect the presence of a source located at the origin. Time is…
Many interactions result in a socially suboptimal equilibrium, or in a non-equilibrium state, from which arriving at an equilibrium through simple dynamics can be impossible of too long. Aiming to achieve a certain equilibrium, we persuade,…
In this paper a constructive method to determine and compute probabilistic reachable and invariant sets for linear discrete-time systems, excited by a stochastic disturbance, is presented. The samples of the disturbance signal are not…
A set of $N$ points is chosen randomly in a $D$-dimensional volume $V=a^D$, with periodic boundary conditions. For each point $i$, its distance $d_i$ is found to its nearest neighbour. Then, the maximal value is found, $d_{max}=max(d_i,…
We introduce and study randomized sequential importance sampling algorithms for estimating the number of perfect matchings in bipartite graphs. In analyzing their performance, we establish various non-standard central limit theorems. We…
In the 3-Hitting Set problem, the input is a hypergraph $G$ such that the size of every hyperedge of $G$ is at most 3, and an integers $k$, and the goal is to decide whether there is a set $S$ of at most $k$ vertices such that every…
A fundamental question in systems biology is what combinations of mean and variance of the species present in a stochastic biochemical reaction network are attainable by perturbing the system with an external signal. To address this…
To what extent can particulate random media be characterised using direct wave backscattering from a single receiver/source? Here, in a two dimensional setting, we show using a machine learning approach that both the particle radius and…
The Reward-Penalty-Selection Problem (RPSP) can be seen as a combination of the Set Cover Problem (SCP) and the Hitting Set Problem (HSP). Given a set of elements, a set of reward sets, and a set of penalty sets, one tries to find a subset…
Given a chain complex with the only modification that each cell of the complex has a probability distribution assigned. We will call this complex - a random complex and what should be understood in practice, is that we have a classical…
Recurrence problems are fundamental in dynamics, and for example, sizes of the set of points recurring infinitely often to a target have been studied extensively in many contexts. For example, the problem of finding the dimension for…
Criteria defining higher-order sub-Poissonian-like fields are given using five different quantities: moments of (I) integrated intensity, (II) photon number, (III) integrated-intensity fluctuation, (IV) photon-number fluctuation, and (V)…
Given a hypergraph $H = (V,E)$, what is the smallest subset $X \subseteq V$ such that $e \cap X \neq \emptyset$ holds for all $e \in E$? This problem, known as the hitting set problem, is a basic problem in parameterized complexity theory.…
Particle splitting methods are considered for the estimation of rare events. The probability of interest is that a Markov process first enters a set $B$ before another set $A$, and it is assumed that this probability satisfies a large…
A random sequence having two segments being the homogeneous Markov processes is registered. Each segment has his own transition probability law and the length of the segment is unknown and random. The transition probabilities of each…
In the framework of the Gibbs statistical theory, the question of the size of the particles forming the statistical system is investigated. This task is relevant for a wide variety of applications. The distribution for particle sizes and…
A very simple event frequency approximation algorithm that is sensitive to event timeliness is suggested. The algorithm iteratively updates categorical click-distribution, producing (path of) a random walk on a standard $n$-dimensional…
Low discrepancy point sets have been widely used as a tool to approximate continuous objects by discrete ones in numerical processes, for example in numerical integration. Following a century of research on the topic, it is still unclear…
Finding inclusion-minimal "hitting sets" for a given collection of sets is a fundamental combinatorial problem with applications in domains as diverse as Boolean algebra, computational biology, and data mining. Much of the algorithmic…