Related papers: Diffusion limited aggregation on a tree
Through the analysis of unbiased random walks on fractal trees and continuous time random walks, we show that even if a process is characterized by a mean square displacement (MSD) growing linearly with time (standard behaviour) its…
We introduce Tree D-fusion, featuring the first collection of 600,000 environmentally aware, 3D simulation-ready tree models generated through Diffusion priors. Each reconstructed 3D tree model corresponds to an image from Google's Auto…
We present a model to describe the concentration-dependent growth of protein filaments. Our model contains two states, a low entropy/high affinity ordered state and a high entropy/low affinity disordered state. Consistent with experiments,…
We recently introduced the dynamical cluster approximation(DCA), a new technique that includes short-ranged dynamical correlations in addition to the local dynamics of the dynamical mean field approximation while preserving causality. The…
We present the first measurement of the large-scale cross-correlation of Lyman alpha forest absorption and Damped Lyman alpha systems (DLA), using the 9th Data Release of the Baryon Oscillation Spectroscopic Survey (BOSS). The…
In this paper, we present an effective data augmentation framework leveraging the Large Language Model (LLM) and Diffusion Model (DM) to tackle the challenges inherent in data-scarce scenarios. Recently, DMs have opened up the possibility…
In this paper, we propose to study a general notion of a down-up Markov chain for multifurcating trees with n labelled leaves. We study in detail down-up chains associated with the $(\alpha, \gamma)$-model of Chen et al. (2009),…
Numerical and analytical results are presented for the maximal relative height distribution of stationary periodic Gaussian signals (one dimensional interfaces) displaying a 1/f^alpha power spectrum. For 0<alpha<1 (regime of decaying…
Higher order clustering statistics of Ly$\alpha$ forest provide a unique probe to study non-gaussianity in Intergalactic matter distribution up to high redshifts and from large to small scales. The author presents a brief review of his work…
Aggregation phenomena are ubiquitous in nature, encompassing out-of-equilibrium processes of fractal pattern formation, important in many areas of science and technology. Despite their simplicity, foundational models such as…
We consider a family of growth models defined using conformal maps in which the local growth rate is determined by $|\Phi_n'|^{-\eta}$, where $\Phi_n$ is the aggregate map for $n$ particles. We establish a scaling limit result in which…
We introduce a model of evolving preferential attachment trees where vertices are assigned weights, and the evolution of a vertex depends not only on its own weight, but also on the weights of its neighbours. We study the distribution of…
We study the variation of the effective fine structure constant alpha for Dirac-Born-Infeld (DBI) type dark energy models. The DBI action based on string theory naturally gives rise to a coupling between gauge fields and a scalar field…
We consider a model of long-range first-passage percolation on the $d$ dimensional square lattice $Z^d$ in which any two distinct vertices $x, y \in Z^d$ are connected by an edge having exponentially distributed passage time with mean…
In this work we analyze bucket increasing tree families. We introduce two simple stochastic growth processes, generating random bucket increasing trees of size $n$, complementing the earlier result of Mahmoud and Smythe for bucket recursive…
Accurate quantification of the extent of lung pathological patterns (fibrosis, ground-glass opacity, emphysema, consolidation) is prerequisite for diagnosis and follow-up of interstitial lung diseases. However, segmentation is challenging…
Monolayer cluster growth in far-from-equilibrium systems is investigated by applying simulation and analytic techniques to minimal hard core particle (exclusion) models. The first model (I), for post-deposition coarsening dynamics, contains…
We demonstrate that adaptively controlling the size of individual regression trees in a random forest can improve predictive performance, contrary to the conventional wisdom that trees should be fully grown. A fast pruning algorithm,…
The minimum linear arrangement problem on a network consists of finding the minimum sum of edge lengths that can be achieved when the vertices are arranged linearly. Although there are algorithms to solve this problem on trees in polynomial…
The spread of infectious disease in a human community or the proliferation of fake news on social media can be modeled as a randomly growing tree-shaped graph. The history of the random growth process is often unobserved but contains…