Related papers: Spreading and shortest paths in systems with spars…
We study the random geometry of first passage percolation on the complete graph equipped with independent and identically distributed edge weights, continuing the program initiated by Bhamidi and van der Hofstad [6]. We describe our results…
The shortest path problem is related to many dynamic processes on networks, ranging from routing in communication networks to signaling in molecular interaction networks. When the network is fully known, the shortest path problem can be…
To better understand the temporal characteristics and the lifetime of fluctuations in stochastic processes in networks, we investigated diffusive persistence in various graphs. Global diffusive persistence is defined as the fraction of…
In this short note, we study the distribution of spreads in a point set $\mathcal{P} \subseteq \mathbb{F}_q^d$, which are analogous to angles in Euclidean space. More precisely, we prove that, for any $\varepsilon > 0$, if $|\mathcal{P}|…
We are interested in the assessment of electromagnetic Path-Loss in complex environments. The Path-loss is the attenuation function $P$ of the electromagnetic power at a distance $d$ of an antenna. In free-space, $P(d) \propto 1/d^2$, in…
A measure on a locally compact group is called spread out if one of its convolution powers is not singular with respect to Haar measure. Using Markov chain theory, we conduct a detailed analysis of random walks on homogeneous spaces with…
In this paper, we investigate random walks in a family of small-world trees having an exponential degree distribution. First, we address a trapping problem, that is, a particular case of random walks with an immobile trap located at the…
A spanner graph on a set of points in $R^d$ contains a shortest path between any pair of points with length at most a constant factor of their Euclidean distance. In this paper we investigate new models and aim to interpret why good…
We study the persistent random walk of photons on a one-dimensional lattice of random transmittances. Transmittances at different sites are assumed independent, distributed according to a given probability density $f(t)$. Depending on the…
In this paper we consider a simple virus infection spread model on a finite population of $n$ agents connected by some neighborhood structure. Given a graph $G$ on $n$ vertices, we begin with some fixed number of initial infected vertices.…
The shortest path problem is among the most fundamental combinatorial optimization problems to answer reachability queries. It is hard to deter-mine which vertices or edges are visited during shortest path traversals. In this paper, we…
We study damage-spreading in the ferromagnetic Ising model on small world networks using Monte Carlo simulation with Glauber dynamics. The damage spreading temperature $T_d$ is determined as a function of rewiring probability $p$ for small…
Consider first passage percolation on $\mathbb{Z}^d$ with passage times given by i.i.d. random variables with common distribution $F$. Let $t_\pi(u,v)$ be the time from $u$ to $v$ for a path $\pi$ and $t(u,v)$ the minimal time among all…
How to quantify the distance between any two partitions of a finite set is an important issue in statistical classification, whenever different clustering results need to be compared. Developing from the traditional Hamming distance between…
We consider random networks whose dynamics is described by a rate equation, with transition rates $w_{nm}$ that form a symmetric matrix. The long time evolution of the system is characterized by a diffusion coefficient $D$. In one dimension…
We consider the mean distribution functions Phi(r|l), Phi(B)(r|l), and Phi(S)(r|l), giving the probability that two sites on the incipient percolation cluster, on its backbone and on its skeleton, respectively, connected by a shortest path…
We consider the optimal paths in a $d$-dimensional lattice, where the bonds have isotropically correlated random weights. These paths can be interpreted as the ground state configuration of a simplified polymer model in a random potential.…
For a supercritical catalytic branching random walk on Z^d (d is positive integer) with an arbitrary finite catalysts set we study the spread of particles population as time grows to infinity. Namely, we divide by t the position coordinates…
Many important transport phenomena are described by simple mathematical models rooted in the diffusion equation. Geometrical constraints present in such phenomena often have influence of a universal sort and manifest themselves in scaling…
Small-world networks by Watts and Strogatz are a class of networks that are highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs. These characteristics result in networks with unique…