Related papers: Self-Avoiding Walk on Fractal Complex Networks: Ex…
In this paper we study the following one-dimensional reaction-diffusion problem $$ u_t+(-\Delta)^s u=f(x-c t, u) \;\:\textrm{ in } \mathbb{R}\times (0,+\infty), $$ where $s>\frac{1}{2}$, $c \in \mathbb{R}$ is a prescribed velocity, and $f$…
Random walks are studied on disordered cellular networks in 2-and 3-dimensional spaces with arbitrary curvature. The coefficients of the evolution equation are calculated in term of the structural properties of the cellular system. The…
For a given pcf self-similar fractal, a certain network (weighted graph) is constructed whose ideal boundary is (homeomorphic to) the fractal. This construction is the first representation of a connected self-similar fractal as the boundary…
A random hopping on a fractal network with dimension slightly above one, $d = 1 + \epsilon$, is considered as a model of transport for conducting polymers with nonmetallic conductivity. Within the real space renormalization group method of…
We consider spread-out models of self-avoiding walk, bond percolation, lattice trees and bond lattice animals on the d-dimensional hyper cubic lattice having long finite-range connections, above their upper critical dimensions d=4…
We study nonlinear diffusion problems of the form $u_t=u_{xx}+f(u)$ with free boundaries. Such problems may be used to describe the spreading of a biological or chemical species, with the free boundary representing the expanding front. For…
The foundations of the fractional diffusion equation are investigated based on coupled and decoupled continuous time random walks (CTRW). For this aim we find an exact solution of the decoupled CTRW, in terms of an infinite sum of stable…
In this work, the outward and inward accessibilities of individual nodes are defined and their potential for application is illustrated with respect to the investigation of 6 different types of networks. The outward accessibility quantifies…
Collective phenomena emerge from the interaction of natural or artificial units with a complex organization. The interplay between structural patterns and dynamics might induce functional clusters that, in general, are different from…
We study diffusion (random walks) on recursive scale-free graphs, and contrast the results to similar studies in other analytically soluble media. This allows us to identify ways in which diffusion in scale-free graphs is special. Most…
Several kinds of walks on complex networks are currently used to analyze search and navigation in different systems. Many analytical and computational results are known for random walks on such networks. Self-avoiding walks (SAWs) are…
The Abelian Sandpile Model is a discrete diffusion process defined on graphs (Dhar \cite{DD90}, Dhar et al. \cite{DD95}) which serves as the standard model of \textit{self-organized criticality}. The transience class of a sandpile is…
We study the connective constants of weighted self-avoiding walks (SAWs) on infinite graphs and groups. The main focus is upon weighted SAWs on finitely generated, virtually indicable groups. Such groups possess so-called 'height…
The setting is the representation theory of a simply connected, semisimple algebraic group over a field of positive characteristic. There is a natural transformation from the wall-crossing functor to the identity functor. The kernel of this…
Complex networks are the representative graphs of interactions in many complex systems. Usually, these interactions are abstractions of the communication/diffusion channels between the units of the system. Real complex networks, e.g.…
We study the simple random walk on the giant component of a supercritical Erd\H{o}s-R\'enyi random graph on $n$ vertices, in particular the so-called vacant set at level $u$, the complement of the trajectory of the random walk run up to a…
We study the 2-dimensional uniform prudent self-avoiding walk, which assigns equal probability to all nearest-neighbor self-avoiding paths of a fixed length that respect the prudent condition, namely, the path cannot take any step in the…
We perform a Monte Carlo simulation of two-dimensional N-step interacting self-avoiding walks at the theta point, with lengths up to N=3200. We compute the critical exponents, verifying the Coulomb-gas predictions, the theta-point…
We propose random walks on suitably defined graphs as a framework for finescale modeling of particle motion in an obstructed environment where the particle may have interactions with the obstructions and the mean path length of the particle…
We study the random walk representation of the two-point function in statistical mechanics models near the critical point. Using standard scaling arguments we show that the critical exponent $\nu$ describing the vanishing of the physical…