Related papers: Spreading and shortest paths in systems with spars…
Many real networks are embedded in space, where in some of them the links length decay as a power law distribution with distance. Indications that such systems can be characterized by the concept of dimension were found recently. Here, we…
We propose a bond-percolation model intended to describe the consumption, and eventual exhaustion, of resources in transport networks. Edges forming minimum-length paths connecting demanded origin-destination nodes are removed if below a…
In this paper we study the small-world network model of Watts and Strogatz, which mimics some aspects of the structure of networks of social interactions. We argue that there is one non-trivial length-scale in the model, analogous to the…
Large networked systems are constantly exposed to local damages and failures that can alter their functionality. The knowledge of the structure of these systems is however often derived through sampling strategies whose effectiveness at…
Random scale-free networks are ultrasmall worlds. The average length of the shortest paths in networks of size N scales as lnlnN. Here we show that these ultrasmall worlds can be navigated in ultrashort time. Greedy routing on scale-free…
We investigate a relationship network of humans located in a metric space where relationships are drawn according to a distance-dependent probability density. The obtained spatial graph allows us to calculate the average separation of…
We study evolving networks where new nodes when attached to the network form links with other nodes of preferred distances. A particular case is where always the shortest distances are selected (``make friends with the friends of your…
We investigate by numerical simulation and finite-size analysis the impact of long-range shortcuts on a spatially embedded transportation network. Our networks are built from two-dimensional ($d=2$) square lattices to be improved by the…
First passage percolation on $\mathbb{Z}^2$ is a model for describing the spread of an infection on the sites of the square lattice. The infection is spread via nearest neighbor sites and the time dynamic is specified by random passage…
In this paper, we use a series of small world networks to simulate the epidemic spreading in the real world. To make our model more similar to the real world, we employ a parameter $p_{move}$ to denote its moving probability, which…
Propagation of chaos for interacting particle systems has been an active research topic over decades. We propose an alternative approach to study the mean-field limit of the stochastic interacting particle systems via tools from information…
The Small-World phenomenon, popularly known as six degrees of separation, has been mathematically formalized by Watts and Strogatz in a study of the topological properties of a network. Small-worlds networks are defined in terms of two…
Chase-escape percolation is a variation of the standard epidemic spread models. In this model, each site can be in one of three states: unoccupied, occupied by a single prey, or occupied by a single predator. Prey particles spread to…
Distributions of the resilience of transport networks are studied numerically, in particular the large-deviation tails. Thus, not only typical quantities like average or variance but the distributions over the (almost) full support can be…
We consider the problem of estimating a $d$-dimensional $s$-sparse discrete distribution from its samples observed under a $b$-bit communication constraint. The best-known previous result on $\ell_2$ estimation error for this problem is…
The Erd\H{o}s distance problem concerns the least number of distinct distances that can be determined by $N$ points in the plane. The integer lattice with $N$ points is known as \textit{near-optimal}, as it spans $\Theta(N/\sqrt{\log(N)})$…
We investigate the effect of sequentiallydisrupting the shortest path of percolation clusters at criticality by comparing it with the shortest alternative path. We measure the difference in length and the enclosed area between the two…
We describe a distributed randomized algorithm computing approximate distances and routes that approximate shortest paths. Let n denote the number of nodes in the graph, and let HD denote the hop diameter of the graph, i.e., the diameter of…
Structure and dynamics of complex networks usually deal with degree distributions, clustering, shortest path lengths and other graph properties. Although these concepts have been analysed for graphs on abstract spaces, many networks happen…
We consider a diffusion process under a local weak H\"{o}rmander condition on the coefficients. We find Gaussian estimates for the density in short time and exponential lower and upper bounds for the probability that the diffusion remains…