Related papers: Extreme value theory, Poisson-Dirichlet distributi…
We study first passage percolation on the configuration model. Assuming that each edge has an independent exponentially distributed edge weight, we derive explicit distributional asymptotics for the minimum weight between two randomly…
In this paper we explore first passage percolation (FPP) on the Erd\H{o}s-R\'enyi random graph $G_n(p_n)$, where each edge is given an independent exponential edge weight with rate 1. In the sparse regime, i.e., when $np_n\to \lambda>1,$ we…
In this paper we study first-passage percolation in the configuration model with empirical degree distribution that follows a power-law with exponent $\tau \in (2,3)$. We assign independent and identically distributed (i.i.d.)\ weights to…
We consider first passage percolation on sparse random graphs with prescribed degree distributions and general independent and identically distributed edge weights assumed to have a density. Assuming that the degree distribution satisfies a…
In first-passage percolation (FPP), we let $(\tau_v)$ be i.i.d. nonnegative weights on the vertices of a graph and study the weight of the minimal path between distant vertices. If $F$ is the distribution function of $\tau_v$, there are…
A large and sparse random graph with independent exponentially distributed link weights can be used to model the propagation of messages or diseases in a network with an unknown connectivity structure. In this article we study an extended…
In first-passage percolation (FPP), one assigns i.i.d.~weights to the edges of the cubic lattice $\mathbb{Z}^d$ and analyzes the induced weighted graph metric. If $T(x,y)$ is the distance between vertices $x$ and $y$, then a primary…
The study of first passage percolation (FPP) for the random interlacements model has been initiated in arXiv:2112.12096, where it is shown that on $\mathbb{Z}^d$, $d\geq 3$, the FPP distance is comparable to the graph distance with high…
We investigate first passage percolation on inhomogeneous random graphs. The random graph model G(n,kappa) we study is the model introduced by Bollob\'as, Janson and Riordan, where each vertex has a type from a type space S and edge…
This study delves into first-passage percolation on random geometric graphs in the supercritical regime, where the graphs exhibit a unique infinite connected component. We investigate properties such as geodesic paths, moderate deviations,…
We consider first passage percolation on the Erd\H{o}s--R\'{e}nyi graph with $n$ vertices in which each pair of distinct vertices is connected independently by an edge with probability $\lambda/n$ for some $\lambda>1$. The edges of the…
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 [9]. We describe our results…
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 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…
We study the load distribution in weighted networks by measuring the effective number of optimal paths passing through a given vertex. The optimal path, along which the total cost is minimum, crucially depend on the cost distribution…
We study the problem of random search in finite networks with a tree topology, where it is expected that the distribution of the first-passage time F(t) decays exponentially. We show that the slope of the exponential tail is independent of…
We prove results for first-passage percolation on the configuration model with i.i.d. degrees having finite mean, infinite variance and i.i.d. weights with strictly positive support of the form Y=a+X, where a is a positive constant. We…
We study diffusion with a bias towards a target node in networks. This problem is relevant to efficient routing strategies in emerging communication networks like optical networks. Bias is represented by a probability $p$ of the…
We study the complete graph equipped with a topology induced by independent and identically distributed edge weights. The focus of our analysis is on the weight W_n and the number of edges H_n of the minimal weight path between two distinct…
On the $Z^2$ lattice, vertices are assigned random weights $W(i,j)$. The point-to-point last passage percolation (LPP) time $S_{M,N+1-M}$ between $(1,1)$ and $(M,N+1-M)$ is the maximum total weight among all upward/right-oriented paths…