Related papers: Internal DLA on Sierpinski gasket graphs
We introduce Interleaved Gibbs Diffusion (IGD), a novel generative modeling framework for discrete-continuous data, focusing on problems with important, implicit and unspecified constraints in the data. Most prior works on discrete and…
A random geometric digraph $G_n$ is constructed by taking $\{X_1,X_2,... X_n\}$ in $\mathbb{R}^2$ independently at random with a common bounded density function. Each vertex $X_i$ is assigned at random a sector $S_i$ of central angle…
Given a graph $G$, we form a random subgraph $G_p$ by including each edge of $G$ independently with probability $p$. We provide an asymptotic expansion of the expected number of independent sets in random subgraphs of regular bipartite…
We introduce and study interval partition diffusions with Poisson--Dirichlet$(\alpha,\theta)$ stationary distribution for parameters $\alpha\in(0,1)$ and $\theta\ge 0$. This extends previous work on the cases $(\alpha,0)$ and…
Deterministic complex networks that use iterative generation algorithms have been found to more closely mirror properties found in real world networks than the traditional uniform random graph models. In this paper we introduce a new,…
This paper is concerned with using discontinuous Galerkin isogeometric analysis (dGIGA) as a numerical treatment of Diffusion problems on orientable surfaces $\Omega \subset \mathbb{R}^3$. The computational domain or surface considered…
Diffusion-coagulation can be simply described by a dynamic where particles perform a random walk on a lattice and coalesce with probability unity when meeting on the same site. Such processes display non-equilibrium properties with strong…
The flow and deposition of polydisperse granular materials is simulated through the Magnetic Diffusion Limited Aggregation (MDLA) model. The random walk undergone by an entity in the MDLA model is modified such that the trajectories are…
A novel methodology is presented for reconstructing the Eulerian number density field of dispersed gas-droplet flows modelled using the Fully Lagrangian Approach (FLA). In this work, the nonparametric framework of kernel regression is used…
In this work, we study the Anderson model on graphs with Ahlfors $\alpha$-regular volume growth. We show that, under mild regularity assumptions of the random distribution, Lifshitz-tail type estimates near the bottom of the spectrum lead…
In this two--part study, we present the development and analysis of a stochastic theory for characterizing the relative positions of monodisperse, low-inertia particle pairs that are settling rapidly in homogeneous isotropic turbulence. In…
We prove a law of large numbers for the right boundary in the model of internal DLA generated by cookie random walks in dimension one. The proof is based on stochastic algorithms techniques.
In this work, we study the approximation properties of multi-patch dG-IgA methods, that apply the multipatch Isogeometric Analysis (IgA) discretization concept and the discontinuous Galerkin (dG) technique on the interfaces between the…
We examine diffusion-limited aggregation for a one-dimensional random walk with long jumps. We achieve upper and lower bounds on the growth rate of the aggregate as a function of the number of moments a single step of the walk has. In this…
Diffusion condensation is a dynamic process that yields a sequence of multiscale data representations that aim to encode meaningful abstractions. It has proven effective for manifold learning, denoising, clustering, and visualization of…
The velocity profiles of weak metal absorption lines can be used to observationally probe the kinematic state of gas in damped Lyman-alpha systems. Prochaska and Wolfe have argued that the flat distribution of velocity widths combined with…
In this paper, a new structure of cooperative learning automata so-called extended learning automata (eDLA) is introduced. Based on the proposed structure, a new iterative randomized heuristic algorithm for finding optimal sub-graph in a…
We consider an infinite locally finite system (configuration) $\gamma$ of particles distributed over a Euclidean space $X$. Each particle located at $x\in X$ carries an internal parameter (mark, or ``spin'') $\sigma_{x}\in S=\mathbb{R}.$…
We address the problem of evaluating the number $S_N(t)$ of distinct sites visited up to time t by N noninteracting random walkers all initially placed on one site of a deterministic fractal lattice. For a wide class of fractals, of which…
We investigate the problem of growing clusters, which is modeled by two dimensional disks and three dimensional droplets. In this model we place a number of seeds on random locations on a lattice with an initial occupation probability, $p$.…