Related papers: Diffusion-limited-aggregation on a directed small …
Undirected hyperbolic graph models have been extensively used as models of scale-free small-world networks with high clustering coefficient. Here we presented a simple directed hyperbolic model, where nodes randomly distributed on a…
We introduce a new family of models for growing networks. In these networks new edges are attached preferentially to vertices with higher number of connections, and new vertices are created by already existing ones, inheriting part of their…
Diffusion on a T fractal lattice under the influence of topological biasing fields is studied by finite size scaling methods. This allows to avoid proliferation and singularities which would arise in a renormalization group approach on…
We introduce a new approach to connectivity-dependent properties of diluted systems, which is based on the transfer-matrix formulation of the percolation problem. It simultaneously incorporates the connective properties reflected in…
We study the fractal structure of Diffusion-Limited Aggregation (DLA) clusters on the square lattice by extensive numerical simulations (with clusters having up to $10^8$ particles). We observe that DLA clusters undergo strongly anisotropic…
Diffusion limited aggregation is studied from the perspective of computational complexity. A parallel algorithm is exhibited that requires a number of steps that scales as the depth of the tree defined by the cluster. The existence of this…
We investigate the phenomenon of diffusion in a countably infinite society of individuals interacting with their neighbors in a network. At a given time, each individual is either active or inactive. The diffusion is driven by two…
Many real-world networks are intrinsically directed. Such networks include activation of genes, hyperlinks on the internet, and the network of followers on Twitter among many others. The challenge, however, is to create a network model that…
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…
This work considers distributed sensing and transmission of sporadic random samples. Lower bounds are derived for the reconstruction error of a single normally or uniformly-distributed finite-dimensional vector imperfectly measured by a…
We study the diffusion phenomena on the negatively curved surface made up of congruent heptagons. Unlike the usual two-dimensional plane, this structure makes the boundary increase exponentially with the distance from the center, and hence…
Cylindrical lattice diffusion limited aggregation (DLA), with a narrow width N, is solved for site-sticking conditions using a Markovian matrix method (which was previously developed for the bond-sticking case). This matrix contains the…
There is an abundance of literature on complex networks describing a variety of relationships among units in social, biological, and technological systems. Such networks, consisting of interconnected nodes, are often self-organized,…
We consider a diffusion process with coefficients that are periodic outside of an "interface region" of finite thickness. The question investigated in this article is the limiting long time/large scale behavior of such a process under…
We employ the recently introduced conformal iterative construction of Diffusion Limited Aggregates (DLA) to study the multifractal properties of the harmonic measure. The support of the harmonic measure is obtained from a dynamical process…
We study the two-species diffusion-annihilation process, $A+B\rightarrow$ \O, on the fully-connected lattice. Probability distributions for the number of particles and the reaction time are obtained for a finite-size system using a master…
We developed analytical and numerical methods to study a transport of non-interacting particles in large networks consisting of M d-dimensional containers C_1,...,C_M with radii R_i linked together by tubes of length l_{ij} and radii a_{ij}…
We give exact relations for certain types of the hierarchic fractal structures. In the blatant distinction from regular networks of the "small world" (SW) topology [1], regular fractal networks manifests the logarithmic dependence of the…
Dynamic Spectrum Access systems exploit temporarily available spectrum (`white spaces') and can spread transmissions over a number of non-contiguous sub-channels. Such methods are highly beneficial in terms of spectrum utilization. However,…
We present a detailed analytical study of the $A+A\to\emptyset$ diffusion-annihilation process in complex networks. By means of microscopic arguments, we derive a set of rate equations for the density of $A$ particles in vertices of a given…