Related papers: Coverage Problem Revisited
Problems of existence, construction and estimation of parameters of interval colorings of complete k-partite graphs K_{n}^{k} are investigated.
Sampling one or more effective solutions from large search spaces is a recurring idea in machine learning, and sequential optimization has become a popular solution. Typical examples include data summarization, sample mining for predictive…
We investigate a densely packed, non-random arrangement of forty-six chromosomes (46,XY) in human nuclei. Here, we model systems-level chromosomal crosstalk by unifying intrinsic parameters (chromosomal length and number of genes) across…
The aim of this paper is to provide a comprehensive study of some linear nonlocal diffusion problems in metric measure spaces. These include, for example, open subsets in $\mathbb{R}^N$, graphs, manifolds, multi-structures or some fractal…
In the context of the genome rearrangement problem, we analyze two well known models, namely the block transposition and the prefix block transposition models, by exploiting the connection with the notion of permutation pattern. More…
We consider nearest neighbor spacing distributions of composite ensembles of levels. These are obtained by combining independently unfolded sequences of levels containing only few levels each. Two problems arise in the spectral analysis of…
We are interested in the distribution of the number of faces across all the $2-$cell embeddings of a graph, which is equivalent to the distribution of genus by Euler's formula. In order to study this distribution, we consider the local…
I present a review of the theoretical and computational methodologies that have been used to model the assembly of viral capsids. I discuss the capabilities and limitations of approaches ranging from equilibrium continuum theories to…
In a classical covering problem, we are given a set of requests that we need to satisfy (fully or partially), by buying a subset of items at minimum cost. For example, in the k-MST problem we want to find the cheapest tree spanning at least…
We study the problem of generating a test sequence that achieves maximal coverage for a reactive system under test. We formulate the problem as a repeated game between the tester and the system, where the system state space is partitioned…
We are interested in the large time behavior of the solutions to the growth-fragmentation equation. We work in the space of integrable functions weighted with the principal dual eigenfunction of the growth-fragmentation operator. This space…
Typical-case computation complexity is a research topic at the boundary of computer science, applied mathematics, and statistical physics. In the last twenty years the replica-symmetry-breaking mean field theory of spin glasses and the…
We consider the problem of determining the top-$k$ largest measurements from a dataset distributed among a network of $n$ agents with noisy communication links. We show that this scenario can be cast as a distributed convex optimization…
We study the isoperimetric problem in product spaces equipped with the uniform distance. Our main result is a characterization of isoperimetric inequalities which, when satisfied on a space, are still valid for the product spaces, up a to a…
Let n points be taken at random on a circle of unit circumference and clockwise ordered. Uniform spacings are defined as the clockwise arc-lengths between the successive points from this sample. We are interested in the asymptotic behavior…
We study the sample complexity of learning a high-dimensional simplex from a set of points uniformly sampled from its interior. Learning of simplices is a long studied problem in computer science and has applications in computational…
We study the problem of stabilization for the acoustic system with a spatially distributed damping. With imposing hypothesis on the structural properties of the damping term, we identify exponential decay of solutions with growing time.
In random sequential covering, identical objects are deposited randomly, irreversibly, and sequentially; only attempts that increase coverage are accepted. The process continues indefinitely on an infinite substrate, and we analyze the…
We study the random sequential adsorption of $k$-mers on the fully-connected lattice with $N=kn$ sites. The probability distribution $T_n(s,t)$ of the time $t$ needed to cover the lattice with $s$ $k$-mers is obtained using a generating…
We study the propagation properties of the solutions of the finite-difference space semi-discrete wave equation on an uniform grid of the whole Euclidean space. We provide a construction of high frequency wave packets that propagate along…