中文
相关论文

相关论文: Diffusion limited aggregation on a tree

200 篇论文

We simulate 50 off-lattice DLA clusters, one million particles each. The probability distribution of the angle of attachment of arriving particles with respect to the local radial direction is obtained numerically. For increasing cluster…

凝聚态物理 · 物理学 2009-10-22 Chi-Hang Lam

We investigate the following vertex percolation process. Starting with a random regular graph of constant degree, delete each vertex independently with probability p, where p=n^{-alpha} and alpha=alpha(n) is bounded away from 0. We show…

组合数学 · 数学 2007-05-23 Catherine Greenhill , Fred B. Holt , Nicholas Wormald

We study aggregation driven by a localized source of monomers. The densities become stationary and have algebraic tails far away from the source. We show that in a model with mass-independent reaction rates and diffusion coefficients, the…

统计力学 · 物理学 2015-06-09 P. L. Krapivsky

We present a new technique for proving logarithmic upper bounds for diameters of evolving random graph models, which is based on defining a coupling between random graphs and variants of random recursive trees. The advantage of the…

离散数学 · 计算机科学 2014-10-24 Abbas Mehrabian

The main observed properties of Ly-$\alpha$ absorbers are investigated on the basis of theoretical model of formation and evolution of DM structure elements. This model is generally consistent with simulations of absorbers formation and…

天体物理学 · 物理学 2009-10-31 M. Demianski , A. Doroshkevich , V. Turchaninov

We study the scaling limits of three different aggregation models on Z^d: internal DLA, in which particles perform random walks until reaching an unoccupied site; the rotor-router model, in which particles perform deterministic analogues of…

概率论 · 数学 2010-12-24 Lionel Levine , Yuval Peres

We investigate a class of Young diagrams growing via the addition of unit cells and satisfying the constraint that the height difference between adjacent columns $\geq r$. In the long time limit, appropriately re-scaled Young diagrams…

统计力学 · 物理学 2021-06-09 P. L. Krapivsky

Using both analytic and numerical methods, we study the radial growth probability distribution $P(r,M)$ for large scale off lattice diffusion limited aggregation (DLA) clusters. If the form of $P(r,M)$ is a Gaussian, we show analytically…

凝聚态物理 · 物理学 2009-10-22 Peter Ossadnik , Jysoo Lee

The frog model on the rooted d-ary tree changes from transient to recurrent as the number of frogs per site is increased. We prove that the location of this transition is on the same order as the degree of the tree.

概率论 · 数学 2016-12-28 Tobias Johnson , Matthew Junge

We use a natural ordered extension of the Chinese Restaurant Process to grow a two-parameter family of binary self-similar continuum fragmentation trees. We provide an explicit embedding of Ford's sequence of alpha model trees in the…

概率论 · 数学 2009-09-25 Jim Pitman , Matthias Winkel

Recent measurements of the autocorrelation function of the Ly-alpha clouds are analyzed from the point of view of a simple model with strong clustering on the small scales. It is shown that this toy model reproduces fairly well the…

天体物理学 · 物理学 2009-10-31 Milan M. Cirkovic , Kenneth M. Lanzetta

We show that the fractal growth described by the dielectric breakdown model exhibits a phase transition in the multifractal spectrum of the growth measure. The transition takes place because the tip-splitting of branches forms a fixed…

凝聚态物理 · 物理学 2009-11-07 Joachim Mathiesen , Mogens H. Jensen

We consider Galton--Watson trees conditioned on both the total number of vertices $n$ and the number of leaves $k$. The focus is on the case in which both $k$ and $n$ grow to infinity and $k = \alpha n + O(1)$, with $\alpha \in (0, 1)$.…

概率论 · 数学 2023-10-19 Vladislav Kargin

We first consider the growth of trees by probabilistic attachment of new vertices to leaves. This leads to a growth model based on vertex clusters and probabilities assigned to clusters. This model turns out to be readily applicable to…

概率论 · 数学 2021-06-15 Nomvelo Sibisi

The aim of this paper is to develop a method for proving almost sure convergence in Gromov-Hausodorff-Prokhorov topology for a class of models of growing random graphs that generalises R\'emy's algorithm for binary trees. We describe the…

概率论 · 数学 2020-02-25 Delphin Sénizergues

A microscopic model of the effect of unbinding in diffusion limited aggregation based on a cellular automata approach is presented. The geometry resembles electrochemical deposition - ``ions'' diffuse at random from the top of a container…

材料科学 · 物理学 2009-11-11 G. J. Ackland , E. S. Tweedie

Consider a Markov chain on the space of rooted real binary trees that randomly removes leaves and reinserts them on a random edge and suitably rescales the lengths of edges. This chain was introduced by David Aldous who conjectured a…

概率论 · 数学 2011-04-22 Soumik Pal

We develop a technique for probing harmonic measure of the diffusion limited aggregation (DLA) cluster surface with the variable size particle and generate one thousand clusters with 50 million particles using original off-lattice…

无序系统与神经网络 · 物理学 2007-05-23 A. Yu. Menshutin , L. N. Shchur , V. M. Vinokur

We develop a description of diffusion limited growth in solid-solid transformations, which are strongly influenced by elastic effects. Density differences and structural transformations provoke stresses at interfaces, which affect the phase…

材料科学 · 物理学 2008-11-18 M. Fleck , C. Hueter , D. Pilipenko , R. Spatschek , E. A. Brener

We study the recurrence of one-per-site frog model $\text{FM}(d, p)$ on a $d$-ary tree with drift parameter $p\in [0,1]$, which determines the bias of frogs' random walks. We are interested in the minimal drift $p_{d}$ so that the frog…

概率论 · 数学 2020-08-24 Chengkun Guo , Si Tang , Ningxi Wei