English
Related papers

Related papers: The largest fragment of a homogeneous fragmentatio…

200 papers

We study a self-similar fragmentation process with dislocation measure $\nu$ and self-similarity index $\alpha > 0$. Let $e^{-m_t}$ denote the size of the largest fragment at time $t \geq 0$. For dislocation measures satisfying a regularity…

Probability · Mathematics 2026-03-12 Piotr Dyszewski , Samuel G. G. Johnston , Sandra Palau , Joscha Prochno

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…

Condensed Matter · Physics 2015-06-25 G J Rodgers , M K Hassan

We consider a homogenous fragmentation process with killing at an exponential barrier. With the help of two families of martingales we analyse the growth of the largest fragment for parameter values that allow for survival. In this respect…

Probability · Mathematics 2012-08-21 Robert Knobloch , Andreas E. Kyprianou

In the spirit of a classical results for Crump-Mode-Jagers processes, we prove a strong law of large numbers for homogenous fragmentation processes. Specifically, for self-similar fragmentation processes, including homogenous processes, we…

Probability · Mathematics 2008-09-18 S. C. Harris , R. Knobloch , A. E. Kyprianou

Kang, Perkins and Spencer showed that the size of the largest component of the Bohman-Frieze process at a fixed time $t$ smaller than $t_c$, the critical time for the process is $L_1(t)=\Omega(\log n/(t_c-t)^2)$ with high probability. They…

Probability · Mathematics 2013-08-22 Sanchayan Sen

We obtain sharp sufficient conditions for exponentially integrable stochastic processes $X=\{X(t)\!\!: t\in [0,1]\}$, to have sample paths with bounded $\Phi$-variation. When $X$ is moreover Gaussian, we also provide a bound of the…

Probability · Mathematics 2017-07-20 Andreas Basse-O'Connor , Michel Weber

We present the first polynomial-time algorithm for computing a near-optimal \emph{flow}-expander decomposition. Given a graph $G$ and a parameter $\phi$, our algorithm removes at most a $\phi\log^{1+o(1)}n$ fraction of edges so that every…

Data Structures and Algorithms · Computer Science 2026-04-29 Nikhil Bansal , Arun Jambulapati , Thatchaphol Saranurak

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…

Statistical Mechanics · Physics 2007-05-23 P. L. Krapivsky , I. Grosse , E. Ben-Naim

We investigate fragmentation of charged particles in e+e- annihilation at 22, 35 and 44 GeV in terms of their polar angle and momentum distributions. From the angular distribution the ratio of longitudinal to total hadronic cross-section…

High Energy Physics - Experiment · Physics 2009-11-07 Mona Blumenstengel , Stefan Kluth

Consider the geometric range space $(X, \mathcal{H}_d)$ where $X \subset \mathbb{R}^d$ and $\mathcal{H}_d$ is the set of ranges defined by $d$-dimensional halfspaces. In this setting we consider that $X$ is the disjoint union of a red and…

Computational Geometry · Computer Science 2021-06-29 Michael Matheny , Jeff M. Phillips

A homogeneous mass-fragmentation, as it has been defined in \cite{RFC}, describes the evolution of the collection of masses of fragments of an object which breaks down into pieces as time passes. Here, we show that this model can be…

Probability · Mathematics 2007-05-23 Jean Bertoin

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…

Probability · Mathematics 2016-08-16 Bénédicte Haas

For an integer $d\ge 2$, $t\in \mathbb{R}$ and a $0$-homogeneous function $\Phi\in C^{\infty}(\mathbb{R}^{d}\setminus\{0\},\mathbb{R})$, we consider the family of Fourier multiplier operators $T_{\Phi}^t$ associated with symbols $\xi\mapsto…

Classical Analysis and ODEs · Mathematics 2023-08-22 Aleksandar Bulj

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…

Statistical Mechanics · Physics 2009-11-07 M. K. Hassan , J. Kurths

We study the size properties of the largest intermediate mass fragments in each partition mode, produced in the prompt statistical breakup of a thermally equilibrated nuclear source, at different temperatures. We find that an appreciable…

Nuclear Theory · Physics 2020-04-28 S. R. Souza , R. Donangelo

Two models of binary fragmentation are introduced in which a time dependent transition size produces two regions of fragment sizes above and below the transition size. In the models we consider a fixed rate of fragmentation for the largest…

Statistical Mechanics · Physics 2009-10-31 Z. Tavassoli , A. Esmaeilnia Shirvani

We consider a natural destruction process of an infinite recursive tree by removing each edge after an independent exponential time. The destruction up to time t is encoded by a partition $\Pi$(t) of N into blocks of connected vertices.…

Probability · Mathematics 2015-01-08 Erich Baur , Jean Bertoin

We investigate fragmentation processes with a steady input of fragments. We find that the size distribution approaches a stationary form which exhibits a power law divergence in the small size limit, P(x) ~ x^{-3}. This algebraic behavior…

Statistical Mechanics · Physics 2009-10-31 E. Ben-Naim , P. L. Krapivsky

Let $ \mu $ be the self-similar measure associated with a homogeneous iterated function system $ \Phi = \{ \lambda x + t_j \}_{j=1}^m $ on ${\Bbb R}$ and a probability vector $ (p_{j})_{j=1}^m$, where $0\neq \lambda\in (-1,1)$ and $t_j\in…

Dynamical Systems · Mathematics 2024-05-07 De-Jun Feng , Zhou Feng

A \emph{random temporal graph} is an Erd\H{o}s-R\'enyi random graph $G(n,p)$, together with a random ordering of its edges. A path in the graph is called \emph{increasing} if the edges on the path appear in increasing order. A set $S$ of…

Probability · Mathematics 2025-09-17 Caelan Atamanchuk , Luc Devroye , Gabor Lugosi
‹ Prev 1 2 3 10 Next ›