Related papers: Volume explored by a branching random walk on gene…
In this thesis, we study the diffusive and ballistic behaviors of random walk in random environment (RWRE) in an integer lattice with dimension at least 2. Our contributions are in three directions: a conditional law of large numbers and…
The study of dynamical systems defined on complex networks provides a natural framework with which to investigate myriad features of neural dynamics, and has been widely undertaken. Typically, however, networks employed in theoretical…
Random network models play a prominent role in modeling, analyzing and understanding complex phenomena on real-life networks. However, a key property of networks is often neglected: many real-world networks exhibit spatial structure, the…
The reproduction speed of a continuous-time branching random walk is proportional to a positive parameter $\lambda$. There is a threshold for $\lambda$, which is called $\lambda_w$, that separates almost sure global extinction from global…
We consider activated random walk (ARW), an interacting particle system and prototypical model of self-organized criticality in a setting which combines mean-field behavior with the geometry of an arbitrary graph, which we call the village…
We define the Uniform Random Walk (URW) on a connected, locally finite graph as the weak limit of the uniform walk of length $n$ starting at a fixed vertex. When the limit exists, it is necessarily Markovian and is independent of the…
Biomolecular networks, such as protein-protein interactions, gene-gene associations, and cell-cell interactions, offer valuable insights into the complex organization of biological systems. These networks are key to understanding cellular…
Network growth models that embody principles such as preferential attachment and local attachment rules have received much attention over the last decade. Among various approaches, random walks have been leveraged to capture such…
This work studies the relation between two graph parameters, $\rho$ and $\Lambda$. For an undirected graph $G$, $\rho(G)$ is the growth rate of its universal covering tree, while $\Lambda(G)$ is a weighted geometric average of the vertex…
We give three different criteria for transience of a Branching Markov Chain. These conditions enable us to give a classification of Branching Random Walks in Random Environment (BRWRE) on Cayley Graphs in recurrence and transience. This…
Consider the following routing problem in the context of a large scale network $G$, with particular interest paid to power law networks, although our results do not assume a particular degree distribution. A small number of nodes want to…
Maximum entropy random walks (MERWs) are maximally dispersing and play a key role in optimizing information spreading in various contexts. However, building MERWs comes at the cost of knowing beforehand the global structure of the network,…
Dynamical scalings for the end-to-end distance $R_{ee}$ and the number of distinct visited nodes $N_v$ of random walks (RWs) on finite scale-free networks (SFNs) are studied numerically. $\left< R_{ee} \right>$ shows the dynamical scaling…
We study the branching random walk on weighted graphs; site-breeding and edge-breeding branching random walks on graphs are seen as particular cases. We describe the strong critical value in terms of a geometrical parameter of the graph. We…
The study of the response of complex dynamical social, biological, or technological networks to external perturbations has numerous applications. Random Boolean Networks (RBNs) are commonly used a simple generic model for certain dynamics…
We study the dynamics of a radioactive species flowing through a porous material, within the Continuous-Time Random Walk (CTRW) approach to the modelling of stochastic transport processes. Emphasis is given to the case where radioactive…
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…
The self-avoiding random walk (SARW) is a stochastic process whose state variable avoids returning to previously visited states. This non-Markovian feature has turned SARWs a powerful tool for modelling a plethora of relevant aspects in…
A simple strategy to explore a network is to use a random-walk where the walker jumps from one node to an adjacent node at random. It is known that biasing the random jump, the walker can explore every walk of the same length with equal…
We study a continuous time branching process where an individual splits into two daughters with rate b and dies with rate a, starting from a single individual at t=0. We show that the model can be mapped exactly to a random walk problem…