Related papers: Limit theorems for random spatial drainage network…
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…
Traffic dynamics is universally crucial in analyzing and designing almost any network. This article introduces a novel theoretical approach to analyzing network traffic dynamics. This theory's machinery is based on the notion of traffic…
In the decremental single-source shortest paths problem, the goal is to maintain distances from a fixed source $s$ to every vertex $v$ in an $m$-edge graph undergoing edge deletions. In this paper, we conclude a long line of research on…
The structure of a river network may be seen as a discrete set of nested sub-networks built out of individual stream segments. These network components are assigned an integral stream order via a hierarchical and discrete ordering method.…
We minimize a linear combination of the Willmore and the length functional among networks in $\mathbb{R}^d$ belonging to a given class determined by the number of curves, the order of the junctions and the angles between curves at the…
Recently, In [Phys. Rev. Lett. 104, 018701 (2010)] the authors studied a spatial network which is constructed from a regular lattice by adding long-range edges (shortcuts) with probability $P_{ij}\sim r_{ij}^{-\alpha}$, where $r_{ij}$ is…
We investigate flows on graphs whose links have random capacities. For binary trees we derive the probability distribution for the maximal flow from the root to a leaf, and show that for infinite trees it vanishes beyond a certain threshold…
The problem of achieving consensus in a network of connected systems arises in many science and engineering applications. In contrast to previous works, we focus on the system reactivity, i.e., the initial amplification of the norm of the…
What makes economic and ecological networks so unlike other highly skewed networks in their tendency toward turbulence and collapse? Here, we explore the consequences of a defining feature of these networks: their nodes are tied together by…
Landscapes evolve toward surfaces with complex networks of channels and ridges in response to climatic and tectonic forcing. Here we analyze variational principles giving rise to minimalist models of landscape evolution as a system of…
In this paper, we study the $H_\infty$-norm of linear systems over graphs, which is used to model distribution networks. In particular, we aim to minimize the $H_\infty$-norm subject to allocation of the weights on the edges. The…
We consider the problem of determining the proportion of edges that are discovered in an Erdos-Renyi graph when one constructs all shortest paths from a given source node to all other nodes. This problem is equivalent to the one of…
The Newman-Watts model is given by taking a cycle graph of n vertices and then adding each possible edge $(i,j), |i-j|\neq 1 \mod n$ with probability $\rho/n$ for some $\rho>0$ constant. In this paper we add i.i.d. exponential edge weights…
We consider a variant of so called power-law random graph. A sequence of expected degrees corresponds to a power-law degree distribution with finite mean and infinite variance. In previous works the asymptotic picture with number of nodes…
Graph-limit theory focuses on the convergence of sequences of graphs when the number of nodes becomes arbitrarily large. This framework defines a continuous version of graphs allowing for the study of dynamical systems on very large graphs,…
A spatial network is constructed on a two dimensional space where the nodes are geometrical points located at randomly distributed positions which are labeled sequentially in increasing order of one of their co-ordinates. Starting with $N$…
Quasi-two-dimensional fluids can be generated by confining a fluid between two parallel walls with narrow separation. Such fluids exhibit an inhomogeneous structure perpendicular to the walls due to the loss of translational symmetry.…
Power law distribution is common in real-world networks including online social networks. Many studies on complex networks focus on the characteristics of vertices, which are always proved to follow the power law. However, few researches…
The sliced-Wasserstein flow is an evolution equation where a probability density evolves in time, advected by a velocity field computed as the average among directions in the unit sphere of the optimal transport displacements from its 1D…
We study the linearization of a discrete transportation distance between probability distributions on finite weighted graphs originally due to Maas (``Gradient flows of the entropy for finite {M}arkov chains,'' J. Funct. Anal. 261(8), 2011)…