Related papers: Growing in time IDLA cluster is recurrent
This Thesis aims to highlight some isoperimetric questions involving the, so-called, $N$-clusters. We first briefly recall the theoretical framework we are adopting. This is done in Chapter one. In chapter two we focus on the standard…
Under some mild condition, a random walk in the plane is recurrent. In particular each trajectory is dense, and a natural question is how much time one needs to approach a given small neighborhood of the origin. We address this question in…
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…
We consider the nearest-neighbor simple random walk on $\Z^d$, $d\ge2$, driven by a field of bounded random conductances $\omega_{xy}\in[0,1]$. The conductance law is i.i.d. subject to the condition that the probability of $\omega_{xy}>0$…
We consider a model of aggregation, both diffusion-limited and ballistic, based on the Cayley tree. Growth is from the leaves of the tree towards the root, leading to non-trivial screening and branch competition effects. The model exhibits…
We study the percolation properties of geometrical clusters defined in the overlap space of two statistically independent replicas of a square-lattice Ising model that are simulated at the same temperature. In particular, we consider two…
We develop the notion of higher Cheeger constants for a measurable set $\Omega \subset \mathbb{R}^N$. By the $k$-th Cheeger constant we mean the value \[h_k(\Omega) = \inf \max \{h_1(E_1), \dots, h_1(E_k)\},\] where the infimum is taken…
Brownian particles that are replicated and annihilated at equal rate have strongly correlated positions, forming a few compact clusters separated by large gaps. We characterize the distribution of the particles at a given time, using a…
We study discrete time random walks in an environment of i.i.d. non-negative bounded conductances in $\mathbb{Z}^d$. We are interested in the anomaly of the heat-kernel decay. We improve recent results and techniques.
The Cheeger constant of a graph, or equivalently its coboundary expansion, quantifies the expansion of the graph. This notion assumes an implicit choice of a coefficient group, namely, $\mathbb{F}_2$. In this paper, we study Cheeger-type…
Central limit theorems for random walks in quenched random environments have attracted plenty of attention in the past years. More recently still, finer local limit theorems -- yielding a Gaussian density multiplied by a highly oscillatory…
We survey recent results of normal and anomalous diffusion of two types of random motions with long memory in ${\Bbb R}^d$ or ${\Bbb Z}^d$. The first class consists of random walks on ${\Bbb Z}^d$ in divergence-free random drift field,…
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…
Given a doubly infinite sequence of positive numbers {c_k: k in Z} satisfying a LLN with limit A, we consider the nearest-neighbor simple exclusion process on Z where c_k is the probability rate of jumps between k and k+1. If A is infinite…
We construct a renewal structure for random walks on surface groups. The renewal times are defined as times when the random walks enters a particular type of a cone and never leaves it again. As a consequence, the trajectory of the random…
We examine the stellar mass assembly in galaxy cluster cores using data from the Cluster Lensing and Supernova survey with Hubble (CLASH). We measure the growth of brightest cluster galaxy (BCG) stellar mass, the fraction of the total…
We establish general estimates for simple random walk on an arbitrary infinite random graph, assuming suitable bounds on volume and effective resistance for the graph. These are generalizations of the results in \cite[Section 1,2]{BJKS},…
We consider a $d$-dimensional correlated percolation problem of sites {\em not} visited by a random walk on a hypercubic lattice $L^d$ for $d=3$, 4 and 5. The length of the random walk is ${\cal N}=uL^d$. Close to the critical value…
Reflecting diffusions on continuum percolation clusters are considered. Assuming that the occupied region has a unique unbounded cluster and the cluster satisfies geometrical conditions such as volume regularity, isoperimetric conditions,…
We demonstrate a simple method by which time-dependent interactions can be exploited to improve self-assembly in colloidal systems. We apply this method to two systems: a model colloid with short-ranged attractive potentials that undergoes…