Related papers: Continuum Cascade Model: Branching Random Walk for…
The cascade model generates a food web at random. In it the species are labeled from 0 to $m$, and arcs are given at random between pairs of the species. For an arc with endpoints $i$ and $j$ ($i<j$), the species $i$ is eaten by the species…
We study a class of directed random graphs. In these graphs, the interval [0,x] is the vertex set, and from each y\in [0,x], directed links are drawn to points in the interval (y,x] which are chosen uniformly with density one. We analyze…
We study the behavior of the random walk in a continuum independent long-range percolation model, in which two given vertices $x$ and $y$ are connected with probability that asymptotically behaves like $|x-y|^{-\alpha}$ with $\alpha>d$,…
We study random graph models for directed acyclic graphs, an important class of networks that includes citation networks, food webs, and feed-forward neural networks among others. We propose two specific models, roughly analogous to the…
Directed acyclic graphs are a fundamental class of networks that includes citation networks, food webs, and family trees, among others. Here we define a random graph model for directed acyclic graphs and give solutions for a number of the…
Paths are important structural elements in complex networks because they are finite (unlike walks), related to effective node coverage (minimum spanning trees), and can be understood as being dual to star connectivity. This article…
Random walk is one of the basic mechanisms found in many network applications. We study the epidemic spreading dynamics driven by biased random walks on complex networks. In our epidemic model, each time infected nodes constantly spread…
Branching processes are widely used to model the viral epidemic evolution. For more adequate investigation of viral epidemic modelling, we suggest to apply branching processes with transport of particles usually called branching random…
Random walks have been proposed as a simple method of efficiently searching, or disseminating information throughout, communication and sensor networks. In nature, animals (such as ants) tend to follow correlated random walks, i.e., random…
We review theoretical approaches to the understanding of food webs. After an overview of the available food web data, we discuss three different classes of models. The first class comprise static models, which assign links between species…
Directed covers of finite graphs are also known as periodic trees or trees with finitely many cone types. We expand the existing theory of directed covers of finite graphs to those of infinite graphs. While the lower growth rate still…
We consider random walks on dynamical networks where edges appear and disappear during finite time intervals. The process is grounded on three independent stochastic processes determining the walker's waiting-time, the up-time and down-time…
This paper is a collection of recent results on discrete-time and continuous-time branching random walks. Some results are new and others are known. Many aspects of this theory are considered: local, global and strong local survival, the…
We study an extension of Duncan Watts' 2002 model of information cascades in social networks where edge weights are taken to be random, an innovation motivated by recent applications of cascade analysis to systemic risk in financial…
Random walks are ubiquitous in the sciences, and they are interesting from both theoretical and practical perspectives. They are one of the most fundamental types of stochastic processes; can be used to model numerous phenomena, including…
Combs are a simple caricature of various types of natural branched structures, which belong to the category of loopless graphs and consist of a backbone and branches. We study continuous time random walks on combs and present a generic…
In this work we investigate the dynamics of random walk processes on scale-free networks in a short to moderate time scale. We perform extensive simulations for the calculation of the mean squared displacement, the network coverage and the…
The random walk process underlies the description of a large number of real world phenomena. Here we provide the study of random walk processes in time varying networks in the regime of time-scale mixing; i.e. when the network connectivity…
An intrinsic branching structure within the transient random walk on a strip in a random environment is revealed. As applications, which enables us to express the hitting time explicitly, and specifies the density of the absolutely…
The dynamics of the avalanche width in the evolution model is described using a random walk picture. In this approach the critical exponents for avalanche distribution, $\tau$, and avalanche average time, $\gamma$, are found to be the same…