Related papers: Short paths for first passage percolation on the c…

We study local modifications of the graph distance in large random triangulations. Our main results show that, in large scales, the modified distance behaves like a deterministic constant $\mathbf{c}~\in~(0,\infty)$ times the usual graph…

Quantum walks on graphs can model physical processes and serve as efficient tools in quantum information theory. Once we admit random variations in the connectivity of the underlying graph, we arrive at the problem of percolation, where the…

We introduce and study a class of abstract continuous action minimization problems that generalize continuous first and last passage percolation. In this class of models a limit shape exists. Our main result provides a framework under which…

We prove new lower bounds on the likely size of a maximum independent set in a random graph with a given average degree. Our method is a weighted version of the second moment method, where we give each independent set a weight based on the…

Rank 1 inhomogeneous random graphs are a natural generalization of Erd\H{o}s R\'enyi random graphs. In this generalization each node is given a weight. Then the probability that an edge is present depends on the product of the weights of…

The on-line nearest-neighbour graph on a sequence of $n$ uniform random points in $(0,1)^d$ ($d \in \N$) joins each point after the first to its nearest neighbour amongst its predecessors. For the total power-weighted edge-length of this…

We consider first passage percolation on the configuration model. Once the network has been generated each edge is assigned an i.i.d. weight modeling the passage time of a message along this edge. Then independently two vertices are chosen…

In this paper we consider first passage percolation on the square lattice \(\mathbb{Z}^d\) with edge passage times that are independent and have uniformly bounded second moment, but not necessarily identically distributed. For integer \(n…

For a finite graph $G=(V,E)$ let $G^*$ be obtained by considering a random perfect matching of $V$ and adding the corresponding edges to $G$ with weight $\varepsilon$, while assigning weight 1 to the original edges of $G$. We consider…

We study first-passage percolation in two dimensions, using measures mu on passage times with b:=inf supp(mu) >0 and mu({b})=p \geq p_c, the threshold for oriented percolation. We first show that for each such mu, the boundary of the limit…

We consider the fundamental algorithmic problem of finding a cycle of minimum weight in a weighted graph. In particular, we show that the minimum weight cycle problem in an undirected n-node graph with edge weights in {1,...,M} or in a…

We review results on the scaling of the optimal path length in random networks with weighted links or nodes. In strong disorder we find that the length of the optimal path increases dramatically compared to the known small world result for…

We consider inhomogeneous spatial random graphs on the real line. Each vertex carries an i.i.d. weight and edges are drawn such that short edges and edges to vertices with large weights occur with higher probability. This allows the study…

We consider the standard first passage percolation model in the rescaled graph $\mathbb{Z}^d/n$ for $d\geq 2$, and a domain $\Omega$ of boundary $\Gamma$ in $\mathbb{R}^d$. Let $\Gamma^1$ and $\Gamma^2$ be two disjoint open subsets of…

We give the first properties of independent Bernoulli percolation, for oriented graphs on the set of vertices $\Z^d$ that are translation-invariant and may contain loops. We exhibit some examples showing that the critical probability for…

We present a unified general method for the asymptotic study of graphs from the so-called "subcritical"$ $ graph classes, which include the classes of cacti graphs, outerplanar graphs, and series-parallel graphs. This general method works…

One model of message delivery in a computer network is based on labelling each edge by a subset of a (reasonably small) universal set, and then encoding a path as the union of the labels of its edges. Earlier work suggested using random…

We develop a novel method for measuring the similarity between complete weighted graphs, which are probed by means of discrete-time quantum walks. Directly probing complete graphs using discrete-time quantum walks is intractable due to the…

We introduce the weighted random graph (WRG) model, which represents the weighted counterpart of the Erdos-Renyi random graph and provides fundamental insights into more complicated weighted networks. We find analytically that the WRG is…

Random graphs defined by an occurrence probability that is invariant under node aggregation have been identified recently in the context of network renormalization. The invariance property requires that edges are drawn with a specific…