Related papers: Weighted distances in scale-free configuration mod…
First-passage percolation is the study of the metric space $(\mathbb{Z}^d,T)$, where $T$ is a random metric defined as the weighted graph metric using random edge-weights $(t_e)_{e\in \mathcal{E}^d}$ assigned to the nearest-neighbor edges…
We present analytical results for the distribution of shortest path lengths between random pairs of nodes in configuration model networks. The results, which are based on recursion equations, are shown to be in good agreement with numerical…
We consider a sparse Erd\H{o}s--R\'{e}nyi graph $\mathcal{G}(n,\lambda/n)$ where each edge is independently assigned a random signed weight. For two uniformly chosen vertices, we study the joint distribution of the total weights and…
Scale-free networks with moderate edge dependence experience a phase transition between ultrasmall and small world behaviour when the power law exponent passes the critical value of three. Moreover, there are laws of large numbers for the…
We show that the transience or recurrence of a random walk in certain random environments on an arbitrary infinite locally finite tree is determined by the branching number of the tree, which is a measure of the average number of branches…
We consider the random connection model in which an edge between two Poisson points at distance $r$ is present with probability $g(r)$. We conduct an extreme value analysis on this model, namely by investigating the longest edge with at…
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 real life, networks are dynamic in nature; they grow over time and often exhibit power-law degree sequences. To model the evolving structure of the internet, Barab\'{a}si and Albert introduced a simple dynamic model with a power-law…
We consider directed random graphs, the prototype of which being the Barak-Erd\H{o}s graph $\vec G(\mathbb Z, p)$, and study the way that long (or heavy, if weights are present) paths grow. This is done by relating the graphs to certain…
In a geometric inhomogeneous random graph vertices are given by the points of a Poisson process and are equipped with independent weights following a heavy tailed distribution. Any pair of distinct vertices is independently forming an edge…
Many complex networks in nature have directed links, a property that affects the network's navigability and large-scale topology. Here we study the percolation properties of such directed scale-free networks with correlated in- and…
We introduce a model of evolving preferential attachment trees where vertices are assigned weights, and the evolution of a vertex depends not only on its own weight, but also on the weights of its neighbours. We study the distribution of…
Let a random geometric graph be defined in the supercritical regime for the existence of a unique infinite connected component in Euclidean space. Consider the first-passage percolation model with independent and identically distributed…
We study the distribution of optimal path lengths in random graphs with random weights associated with each link (``disorder''). With each link $i$ we associate a weight $\tau_i = \exp(ar_i)$ where $r_i$ is a random number taken from a…
We consider a simplified model of first-passage percolation, involving two families of i.i.d. random variables $\{\xi_{ij}\}$ and $\{\eta_{ij}\}$ corresponding to the weights of the horizontal and vertical edges respectively. We obtain an…
Degree distribution, or equivalently called degree sequence, has been commonly used to be one of most significant measures for studying a large number of complex networks with which some well-known results have been obtained. By contrast,…
We consider first passage percolation with i.i.d. weights on edges of the d-dimensional cubic lattice. Under the assumptions that a weight is equal to zero with probability smaller than the critical probability of bond percolation in the…
We study the distribution $P(\sigma)$ of the equivalent conductance $\sigma$ for Erd\H{o}s-R\'enyi (ER) and scale-free (SF) weighted resistor networks with $N$ nodes. Each link has conductance $g\equiv e^{-ax}$, where $x$ is a random number…
We consider self-loops and multiple edges in the configuration model as the size of the graph tends to infinity. The interest in these random variables is due to the fact that the configuration model, conditioned on being simple, is a…
In this paper we study the impact of random exponential edge weights on the distances in a random graph and, in particular, on its diameter. Our main result consists of a precise asymptotic expression for the maximal weight of the shortest…