Related papers: Competing first passage percolation on random regu…
A percolation model is presented, with computer simulations for illustrations, to show how the sales of a new product may penetrate the consumer market. We review the traditional approach in the marketing literature, which is based on…
Network properties govern the rate and extent of various spreading processes, from simple contagions to complex cascades. Recently, the analysis of spreading processes has been extended from static networks to temporal networks, where nodes…
It is widely believed that certain simple modifications of the random graph process lead to discontinuous phase transitions. In particular, starting with the empty graph on $n$ vertices, suppose that at each step two pairs of vertices are…
In this work we investigate a bootstrap percolation process on random graphs generated by a random graph model which combines preferential attachment and edge insertion between previously existing vertices. The probabilities of adding…
We consider standard first-passage percolation on $\Z^d$. Let $e_1$ be the first coordinate vector. Let $a(n)$ be the expected passage time from the origin to $ne_1$. In this short paper, we note that $a(n)$ is increasing under some strong…
In this paper we study the strict majority bootstrap percolation process on graphs. Vertices may be active or passive. Initially, active vertices are chosen independently with probability p. Each passive vertex becomes active if at least…
We consider first-passage percolation on the edges of $\mathbb{Z}^2 \times k,$ namely the slab of width $k$. Each edge is assigned independently a passage time of either 0 (with probability $1-p_c(\mathbb{S}_k)$) or 1 ((with probability…
In this paper we consider first-passage percolation on certain 1-dimensional periodic graphs, such as the $\Z\times\{0,1,\ldots,K-1\}^{d-1}$ nearest neighbour graph for $d,K\geq1$. We find that both length and weight of minimal-weight paths…
\emph{Full-bond percolation} with parameter $p$ is the process in which, given a graph, for every edge independently, we delete the edge with probability $1-p$. Bond percolation is motivated by problems in mathematical physics and it is…
Competition between alternative states is an essential process in social and biological networks. Neutral competition can be represented by an unbiased random drift process in which the states of vertices (e.g., opinions, genotypes, or…
We study first-passage percolation on random simple triangulations and their dual maps with independent identically distributed link weights. Our main result shows that the first-passage percolation distance concentrates in an…
We consider a synchronous process of particles moving on the vertices of a graph $G$, introduced by Cooper, McDowell, Radzik, Rivera and Shiraga (2018). Initially, $M$ particles are placed on a vertex of $G$. In subsequent time steps, all…
Consider a stochastic growth model on $\mathbb{Z} ^d$. Start with some active particle at the origin and sleeping particles elsewhere. The initial number of particles at $x \in \mathbb{Z} ^d$ is $\eta(x)$, where $\eta (x)$ are independent…
In vertex recoloring, we are given $n$ vertices with their initial coloring, and edges arrive in an online fashion. The algorithm must maintain a valid coloring by recoloring vertices, at a cost. The problem abstracts a scenario of job…
Accessibility percolation is a new type of percolation problem inspired by evolutionary biology. To each vertex of a graph a random number is assigned and a path through the graph is called accessible if all numbers along the path are in…
Majority bootstrap percolation is a monotone cellular automata that can be thought of as a model of infection spreading in networks. Starting with an initially infected set, new vertices become infected once more than half of their…
In this paper, we consider the random walk process on a kind of fractal (or transfractal) scale free networks, which also called as $(u,v)$ flowers, and we focus on the global first passage time (GFPT) and first return time (FRT). Here, we…
We consider learning on graphs, guided by kernels that encode similarity between vertices. Our focus is on random walk kernels, the analogues of squared exponential kernels in Euclidean spaces. We show that on large, locally treelike,…
In this paper we introduce a discrete time competing virus model and the assumptions necessary for the model to be well posed. We analyze the system exploring its different equilibria. We provide necessary and sufficient conditions for the…
This paper is concerned with some spreading properties of monostable Lotka--Volterra two-species competition--diffusion systems when the initial values are null or exponentially decaying in a right half-line. Thanks to a careful…