相关论文: Phase Transition in a Random Fragmentation Problem…
We study a random fragmentation process and its associated random tree. The process has earlier been studied by Dean and Majumdar (J. Phys. A: Math. Gen., vol. 35, L501--L507), who found a phase transition: the number of fragmentations is…
We provide information about the asymptotic regimes for a homogeneous fragmentation of a finite set. We establish a phase transition for the asymptotic behaviours of the shattering times, defined as the first instants when all the blocks of…
We consider the fragmentation process with mass loss and discuss self-similar properties of the arising structure both in time and space, focusing on dimensional analysis. This exhibits a spectrum of mass exponents $\theta$, whose exact…
As an alternative to the paradigmatic fragmentation problem of a single object crushed into a great number of pieces, we survey a large collection of identical bodies, each one randomly split into two fragments only. While some key features…
The fluctuations in the particle size distribution for processes of fragmentation and aggregation are studied for stationary state regimes. The system is described in terms of a stochastic process over an adequate tree structure. The RMS…
A liquid droplet is fragmented by a sudden pressurized-gas blow, and the resulting droplets, adhered to the window of a flatbed scanner, are counted and sized by computerized means. The use of a scanner plus image recognition software…
We consider a model of fragmentation of sheet by cracks that move with a velocity in preferred direction, but undergo random transverse displacements as they move. There is a non-zero probability of crack-splitting, and the split cracks…
We present a study of the phase diagram of a random optimization problem in presence of quantum fluctuations. Our main result is the characterization of the nature of the phase transition, which we find to be a first-order quantum phase…
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…
We investigate the kinetics of nonlinear collision-induced fragmentation. We obtain the fragment mass distribution analytically by utilizing its travelling wave behavior. The system undergoes a shattering transition in which a finite…
This contribution presents a review of our present theoretical as well as experimental knowledge of different fluctuation observables relevant to nuclear multifragmentation. The possible connection between the presence of a fluctuation peak…
We investigate a class of stochastic fragmentation processes involving stable and unstable fragments. We solve analytically for the fragment length density and find that a generic algebraic divergence characterizes its small-size tail.…
We study the random m-ary search tree model (where m stands for the number of branches of a search tree), an important problem for data storage in computer science, using a variety of statistical physics techniques that allow us to obtain…
In certain classes of physical quantum systems, the exponentially large state space "fragments" into many low-dimensional, dynamically disconnected subspaces. We introduce a learning problem known as fragment classification, where given a…
Number partitioning is an NP-complete problem of combinatorial optimization. A statistical mechanics analysis reveals the existence of a phase transition that separates the easy from the hard to solve instances and that reflects the…
We consider a family of fragmentation processes where the rate at which a particle splits is proportional to a function of its mass. Let $F\_{1}^{(m)}(t),F\_{2}^{(m)}(t),...$ denote the decreasing rearrangement of the masses present at time…
The mincut graph bisection problem involves partitioning the n vertices of a graph into disjoint subsets, each containing exactly n/2 vertices, while minimizing the number of "cut" edges with an endpoint in each subset. When considered over…
We investigate fluctuation phenomena for the graph distance and the number of cut points associated with random media arising from the range of a random walk. Our results demonstrate a sequence of dimension-dependent phase transitions in…
We study a random bisection problem where an initial interval of length x is cut into two random fragments at the first stage, then each of these two fragments is cut further, etc. We compute the probability P_n(x) that at the n-th stage,…
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…