Related papers: The largest fragment of a homogeneous fragmentatio…
We propose a stochastic model of a fragmentation process, developed by taking into account fragment lifetime as a function of their size based on the Gibrat process. If lifetime is determined by a power function of fragment size, numerical…
Fragmentation functions are determined for pions, kaons, and nucleons by a global analysis of charged-hadron production data in electron-positron annihilation. The optimum functions are obtained in both leading order (LO) and…
The main focus of this work is the asymptotic behavior of mass-conservative homogeneous fragmentations. Considering the logarithm of masses makes the situation reminiscent of branching random walks. The standard approach is to study {\bf…
In this paper we introduce a network model which evolves in time, and study its largest connected component. We consider a process of graphs $(G_t:t\in [0,1])$, where initially we start with a critical Erd\H{o}s-R\'enyi graph ER(n, 1/n),…
Cohesive particles form agglomerates that are usually very porous. Their geometry, particularly their fractal dimension, depends on the agglomeration process (diffusion-limited or ballistic growth by adding single particles or…
Linear binary fragmentation of synthetic fractal-like agglomerates composed of spherical, equal-size, touching monomers is numerically investigated. Agglomerates of different morphologies are fragmented via random bond removal. The…
For a bounded measurable set $A\subseteq \mathbb{R}$ we denote the Lebesgue measure of $\{(x, y)\in A^2\colon x\le y\le x+1\}$ by $\Phi(A)$. We prove that if $I=A_1\cup\dots\cup A_{k+1}$ partitions an interval $I$ of length $L$ into $k+1$…
We consider the paths of a Gaussian random process $x(t)$, $x(0)=0$ not exceeding a fixed positive level over a large time interval $(0,T)$, $T\gg 1$. The probability $p(T)$ of such event is frequently a regularly varying function at…
We carry out a resolution study on the fragmentation boundary of self-gravitating discs. We perform three-dimensional Smoothed Particle Hydrodynamics (SPH) simulations of discs to determine whether the critical value of the cooling…
We study the asymptotics of the $k$-regular self-similar fragmentation process. For $\alpha > 0$ and an integer $k \geq 2$, this is the Markov process $(I_t)_{t \geq 0}$ in which each $I_t$ is a union of open subsets of $[0,1)$, and…
The dynamics of the fragmentation equation with size diffusion is investigated when the size ranges in (0, $\infty$). The associated linear operator involves three terms and can be seen as a nonlocal perturbation of a Schr{\"o}dinger…
Expander decompositions form the basis of one of the most flexible paradigms for close-to-linear-time graph algorithms. Length-constrained expander decompositions generalize this paradigm to better work for problems with lengths, distances…
Let $\alpha>0$, $H=(-\triangle)^{\alpha}+V(x)$, $V(x)$ belongs to the higher order Kato class $K_{2\alpha}(\mathbbm{R}^n)$. For $1\leq p\leq \infty$, we prove a polynomial upper bound of $\|e^{-itH}(H+M)^{-\beta}\|_{L^p, L^p}$ in terms of…
We give a polynomial-time constant-factor approximation algorithm for maximum independent set for (axis-aligned) rectangles in the plane. Using a polynomial-time algorithm, the best approximation factor previously known is $O(\log\log n)$.…
We consider the impact fragmentation of two spherical solid bodies sensitive to strain rate in a three-dimensional (3D) setting. We use both dimensional analysis and numerical simulations by smoothed-particle hydrodynamics (SPH) method to…
We study the inhomogeneous random graphs in the subcritical case. We derive an exact formula for the size of the largest connected component scaled to $\log n$ where $n$ is the size of the graph. This generalizes the recent result for the…
The role played by the heaviest fragment in partitions of multifragmenting hot nuclei is emphasized. Its size/charge distribution (mean value, fluctuations and shape) gives information on properties of fragmenting nuclei and on the…
Problem 1.5.7 from Pitman's Saint-Flour lecture notes: Does there exist for each n a fragmentation process (\Pi_{n,k}, 1 \leq k \leq n) taking values in the space of partitions of {1,2,...,n} such that \Pi_{n,k} is distributed like the…
The basic object we consider is a certain model of continuum random tree, called the stable tree. We construct a fragmentation process $(F^-(t), t>=0)$ out of this tree by removing the vertices located under height $t$. Thanks to a…
In a coalescence plus independent fragmentation approach we calculate the $p_T$ spectra of the main hadrons: $\pi, K, p, \bar p, \Lambda, \phi$ in a wide range of transverse momentum from low $p_T$ up to about 10 GeV. The approach in its…