English
Related papers

Related papers: The largest fragment of a homogeneous fragmentatio…

200 papers

We study the "rank 1 case" of the inhomogeneous random graph model. In the subcritical case we derive an exact formula for the asymptotic size of the largest connected component scaled to log n. This result is new, it completes the…

Probability · Mathematics 2007-06-15 T. S. Turova

Homogeneous mass fragmentation processes describe the evolution of a unit mass that breaks down randomly into pieces as time. Mathematically speaking, they can be thought of as continuous-time analogues of branching random walks with…

Probability · Mathematics 2015-07-07 Andreas E. Kyprianou , Thomas Madaule

The self-similar growth-fragmentation equation describes the evolution of a medium in which particles grow and divide as time proceeds, with the growth and splitting of each particle depending only upon its size. The critical case of the…

Probability · Mathematics 2021-01-22 Jean Bertoin , Alexander R. Watson

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…

Probability · Mathematics 2021-06-15 Alice Callegaro , Matthew I. Roberts

We study the general fragmentation process starting from one element of size unity (E=1). At each elementary step, each existing element of size $E$ can be fragmented into $k\,(\ge 2)$ elements with probability $p_k$. From the continuous…

Statistical Mechanics · Physics 2013-08-14 Jean-Yves Fortin , Sophie Mantelli , Moo Young Choi

We bound the smoothed running time of the FLIP algorithm for local Max-Cut as a function of $\alpha$, the arboricity of the input graph. We show that, with high probability and in expectation, the following holds (where $n$ is the number of…

Data Structures and Algorithms · Computer Science 2024-04-23 Gregory Schwartzman

The stable fragmentation with index of self-similarity $\alpha \in [-1/2,0)$ is derived by looking at the masses of the subtrees formed by discarding the parts of a $(1 + \alpha)^{-1}$--stable continuum random tree below height $t$, for $t…

Probability · Mathematics 2009-02-15 Christina Goldschmidt , Bénédicte Haas

In this paper, we discuss the maximum principle for a time-fractional diffusion equation $$ \partial_t^\alpha u(x,t) = \sum_{i,j=1}^n \partial_i(a_{ij}(x)\partial_j u(x,t)) + c(x)u(x,t) + F(x,t),\ t>0,\ x \in \Omega \subset {\mathbb R}^n$$…

Analysis of PDEs · Mathematics 2021-03-12 Yuri Luchko , Masahiro Yamamoto

Let $L:[0,1]\setminus\{d\}\rightarrow [0,1]$ be a one-dimensional Lorenz like expanding map ($d$ is the point of discontinuity), $\mathcal{P}=\{ (0,d),(d,1) \}$ be a partition of $[0,1]$ and $C^{\alpha}([0,1],\mathcal{P})$ the set of…

Dynamical Systems · Mathematics 2017-03-20 Marcus Bronzi , Juliano G. Oler

Disordered assemblies with maximum packing fraction are studied by discrete element numerical simulation for monodisperse or bidisperse spherical particles, the diameter ratio being set at three. A maximum packing fraction value corresponds…

Materials Science · Physics 2009-01-23 Jean-Noël Roux , François Chevoir , Fabrice Toussaint

Let ${\cal F}$ be a family of graphs. For a graph $G$, the {\em ${\cal F}$-packing number}, denoted $\nu_{{\cal F}}(G)$, is the maximum number of pairwise edge-disjoint elements of ${\cal F}$ in $G$. A function $\psi$ from the set of…

Combinatorics · Mathematics 2007-05-23 Raphael Yuster

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…

Probability · Mathematics 2009-05-22 Adrien Joseph

The lattice of the set partitions of $[n]$ ordered by refinement is studied. Given a map $\phi: [n] \rightarrow [n]$, by taking preimages of elements we construct a partition of $[n]$. Suppose $t$ partitions $p_1,p_2,\dots,p_t$ are chosen…

Probability · Mathematics 2016-02-04 Dmitry Krachun , Yuri Yakubovich

Let $\alpha$ be a Pisot number. Let $L(\alpha)$ be the largest positive number such that for some $\xi=\xi(\alpha)\in \mathbb R$ the limit points of the sequence of fractional parts $\{\xi \alpha^n\}_{n=1}^{\infty}$ all lie in the interval…

Number Theory · Mathematics 2014-11-17 Victoria Zhuravleva

The growth-fragmentation equation models systems of particles that grow and split as time proceeds. An important question concerns the large time asymptotic of its solutions. Doumic and Escobedo ($2016$) observed that when growth is a…

Probability · Mathematics 2019-04-30 Benedetta Cavalli

The most important characteristics of the fragmentation of heterogeneous solids is that the mass (size) distribution of pieces is described by a power law functional form. The exponent of the distribution displays a high degree of…

Disordered Systems and Neural Networks · Physics 2015-03-10 Gergo Pal , Imre Varga , Ferenc Kun

Given an ordered partition $\Pi =\{P_1,P_2, ...,P_t\}$ of the vertex set $V$ of a connected graph $G=(V,E)$, the \emph{partition representation} of a vertex $v\in V$ with respect to the partition $\Pi$ is the vector…

Combinatorics · Mathematics 2013-05-03 Juan A. Rodriguez-Velazquez , Ismael G. Yero , Henning Fernau

A two-dimensional bidisperse granular fluid is shown to exhibit pronounced long-ranged dynamical heterogeneities as dynamical arrest is approached. Here we focus on the most direct approach to study these heterogeneities: we identify…

Disordered Systems and Neural Networks · Physics 2017-10-27 Karina E. Avila , Horacio E. Castillo , Katharina Vollmayr-Lee , Annette Zippelius

Many calculations for the production of light and intermediate particles resulting from heavy ion collisions at intermediate energies exist. Calculations of properties of the largest fragment resulting from multifragmentation are rare. In…

Nuclear Theory · Physics 2008-11-26 G. Chaudhuri , S. Das Gupta

In this paper we prove that Amdeberhan's conjecture on the largest size of $(t, t+1, t+2)$-core partitions is true. We also show that the number of $(t, t + 1, t + 2)$-core partitions with the largest size is $1$ or $2$ based on the parity…

Combinatorics · Mathematics 2015-01-08 Huan Xiong