相关论文: Phase Transition in a Random Fragmentation Problem…
We derive exact statistical properties of a class of recursive fragmentation processes. We show that introducing a fragmentation probability 0<p<1 leads to a purely algebraic size distribution in one dimension, P(x) ~ x^{-2p}. In d…
We consider a system of $N$ disordered mean-field interacting diffusions within spatial constraints: each particle $\theta_i$ is attached to one site $x_i$ of a periodic lattice and the interaction between particles $\theta_i$ and…
We investigate the splitting probability of a monitored continuous-time quantum walk with two targets and show that, in stark contrast to a classical random walk, it exhibits a nonanalytic, phase-transition-like behavior controlled by the…
We show that in small and low density systems described by a lattice gas model with fixed number of particles the location of a thermodynamic phase transition can be detected by means of the distribution of the fluctuations related to an…
We numerically analyse quantum survival probability fluctuations in an open, classically chaotic system. In a quasi-classical regime, and in the presence of classical mixed phase space, such fluctuations are believed to exhibit a fractal…
We introduce a prime number generator in the form of a stochastic algorithm. The character of such algorithm gives rise to a continuous phase transition which distinguishes a phase where the algorithm is able to reduce the whole system of…
We formulate the statistics of the discrete multicomponent fragmentation event using a methodology borrowed from statistical mechanics. We generate the ensemble of all feasible distributions that can be formed when a single integer…
Inertial particles suspended in many natural and industrial flows undergo coagulation upon collisions and fragmentation if their size becomes too large or if they experience large shear. Here we study this coagulation-fragmentation process…
We consider a discrete-time Markov chain, called fragmentation process, that describes a specific way of successively removing objects from a linear arrangement. The process arises in population genetics and describes the ancestry of the…
We study the probability distribution $P$ of the sum of a large number of non-identically distributed random variables $n_m$. Condensation of fluctuations, the phenomenon whereby one of such variables provides a macroscopic contribution to…
We investigate the fragmentation process of solid materials with crystalline and amorphous phases using the discrete element method. Damage initiates inside spherical samples above the contact zone in a region where the circumferential…
We consider the binary fragmentation problem in which, at any breakup event, one of the daughter segments either survives with probability $p$ or disappears with probability $1\!-\!p$. It describes a stochastic dyadic Cantor set that…
A special type of binomial splitting process is studied. Such a process can be used to model a high-dimensional corner parking problem, as well as the depth of random PATRICIA tries (a special class of digital tree data structures). The…
We consider a phase retrieval problem, where the goal is to reconstruct a $n$-dimensional complex vector from its phaseless scalar products with $m$ sensing vectors, independently sampled from complex normal distributions. We show that,…
We study the kinetics of nonlinear irreversible fragmentation. Here fragmentation is induced by interactions/collisions between pairs of particles, and modelled by general classes of interaction kernels, and for several types of breakage…
Dynamic Spectrum Access systems exploit temporarily available spectrum (`white spaces') and can spread transmissions over a number of non-contiguous sub-channels. Such methods are highly beneficial in terms of spectrum utilization. However,…
In adaptive networks fragmentation transitions have been observed in which the network breaks into disconnected components. We present an analytical approach for calculating the transition point in general adaptive network models. Using the…
We introduce three models of fragmentation in which the largest fragment in the system can be broken at each time step with a fixed probability, p. We solve these models exactly in the long time limit to reveal stable time invariant…
We consider the problem of Gaussian mixture clustering in the high-dimensional limit where the data consists of $m$ points in $n$ dimensions, $n,m \rightarrow \infty$ and $\alpha = m/n$ stays finite. Using exact but non-rigorous methods…
Random constraint satisfaction problems undergo several phase transitions as the ratio between the number of constraints and the number of variables is varied. When this ratio exceeds the satisfiability threshold no more solutions exist;…