Related papers: Minimal fragmentation problem
We consider the minimum-cut partitioning of a graph into more than two parts using spectral methods. While there exist well-established spectral algorithms for this problem that give good results, they have traditionally not been well…
We investigate the kinetics of systems in which particles of one species undergo binary fragmentation and pair annihilation. In the latter, nonlinear process, fragments react at collision to produce an inert species, causing loss of mass.…
This paper addresses the problem of reassembling images from disjointed fragments. More specifically, given an unordered set of fragments, we aim at reassembling one or several possibly incomplete images. The main contributions of this work…
In the framework of the Statistical Multifragmentation Model, the nuclear isoscaling analysis is extended to constrain the ratio between the sizes of the decaying sources formed in a collision between two heavy ions. It is found that the…
The piecewise-stationary bandit problem is an important variant of the multi-armed bandit problem that further considers abrupt changes in the reward distributions. The main theme of the problem is the trade-off between exploration for…
This paper presents an algorithm for sampling random variables that allows to separation of the sampling process into subproblems by dividing the sample space into overlapping parts. The subproblems can be solved independently of each other…
Various astrophysical processes are known, where the fly-by of a massive object affects matter initially supported against gravity by rotation. Examples are perturbations of galaxies, protoplanetary discs or planetary systems. We…
The property of isoscaling in nuclear fragmentation is studied using a simple bond percolation model with ``isospin'' added as an extra degree of freedom. It is shown analytically, first, that isoscaling is expected to exist in such a…
We present in this paper an approach for computing the homogenized behavior of a medium that is a small random perturbation of a periodic reference material. The random perturbation we consider is, in a sense made precise in our work, a…
We introduce a new Partition of Unity Method for the numerical homogenization of elliptic partial differential equations with arbitrarily rough coefficients. We do not restrict to a particular ansatz space or the existence of a finite…
Number partitioning is one of the classical NP-hard problems of combinatorial optimization. It has applications in areas like public key encryption and task scheduling. The random version of number partitioning has an "easy-hard" phase…
An emergent theory of quantum measurement arises directly by considering the particular subset of many body wavefunctions that can be associated with classical condensed matter and its interaction with delocalized wavefunctions. This…
We define a spatially-dependent fragmentation process, which involves rectangles breaking up into progressively smaller pieces at rates that depend on their shape. Long, thin rectangles are more likely to break quickly, and are also more…
Derived from the concentration-compactness principle, the concept of generalized minimizer can be used to define generalized solutions of variational problems which may have components ``infinitely'' distant from each other. In this article…
We investigate systems of three mutually interacting particles with masses of which the inner is much bigger than the intermediate and the latter is much bigger than the outer. Then the three-body problem reduces to the two-body scattering…
We suggest a multifragmentation scenario in which fragments are produced at an early, high temperature and high density, stage of the reaction. In this scenario, self-bound clusters of particles in the hot and dense fluid are the precursors…
Segmenting an image into multiple components is a central task in computer vision. In many practical scenarios, prior knowledge about plausible components is available. Incorporating such prior knowledge into models and algorithms for image…
Given an undirected graph representing similarities between a set of items and an additive measure evaluating the items, we treat the position of a special subset of items in an ordinal ranking through a collection of combinatorial…
Extremal optimization is a new general-purpose method for approximating solutions to hard optimization problems. We study the method in detail by way of the NP-hard graph partitioning problem. We discuss the scaling behavior of extremal…
Assessing where and how information is stored in biological networks (such as neuronal and genetic networks) is a central task both in neuroscience and in molecular genetics, but most available tools focus on the network's structure as…