Related papers: Scaling limit for a drainage network model
We consider a system of random walks in a random environment interacting via exclusion. The model is reversible with respect to a family of disordered Bernoulli measures. Assuming some weak mixing conditions, it is shown that, under…
Motivated in part by various sequences of graphs growing under random rules (like internet models), convergent sequences of dense graphs and their limits were introduced by Borgs, Chayes, Lov\'asz, S\'os and Vesztergombi and by Lov\'asz and…
Shaw and Stevens call for a new paradigm in climate science criticizes Large Scale Determinism in favor of (i) embracing discrepancies, (ii) embracing hierarchies, and (iii) create disruption while keeping interpretability. The last 20…
We show that the error of iteratively magnitude-pruned networks empirically follows a scaling law with interpretable coefficients that depend on the architecture and task. We functionally approximate the error of the pruned networks,…
Robustness of distributed routing policies is studied for dynamical flow networks, with respect to adversarial disturbances that reduce the link flow capacities. A dynamical flow network is modeled as a system of ordinary differential…
The adjacency and Laplacian matrices of complex networks with two species of nodes are studied and the spectral density is evaluated by using the replica method in statistical physics. The network nodes are classified into two species (A…
We study the growth of random networks under a constraint that the diameter, defined as the average shortest path length between all nodes, remains approximately constant. We show that if the graph maintains the form of its degree…
We investigate the dependence of river network scaling on the relative dominance of slope vs. noise in initial conditions, using an erosion model. Increasing slope causes network patterns to transition from dendritic to parallel and results…
Random network models, constrained to reproduce specific statistical features, are often used to represent and analyze network data and their mathematical descriptions. Chief among them, the configuration model constrains random networks by…
A variety of scale-free networks have been created since the pioneer work by A.-L. Barab\'{a}si and R. Albert. All this networks are homogeneous since they are composed of the same kind of nodes. In the realistic world, however, one element…
We consider navigation schemes on planar diluted lattices and semi lattices with one discrete and one continuous component. More precisely, nodes that survive inhomogeneous Bernoulli site percolation, or are placed as inhomogeneous Poisson…
The effects of link rewiring are considered for the class of directed networks where each node has the same fixed out-degree. We model a network generated by three mechanisms that are present in various networked systems; growth, global…
We investigate flow dynamics in rivers characterized by basin areas and daily mean discharge spanning different orders of magnitude. We show that the delayed increments evaluated at time scales ranging from days to months can be opportunely…
Robustness of routing policies for networks is a central problem which is gaining increased attention with a growing awareness to safeguard critical infrastructure networks against natural and man-induced disruptions. Routing under limited…
We present a framework to calculate the cascade size evolution for a large class of cascade models on random network ensembles in the limit of infinite network size. Our method is exact and applies to network ensembles with almost arbitrary…
Power minimisation in branched fluidic networks has gained significant attention in biology and engineering. The optimal network is defined by channel radii that minimise the sum of viscous dissipation and the volumetric energetic cost of…
This paper investigates a model reduction problem for linear directed network systems, in which the interconnections among the vertices are described by general weakly connected digraphs. First, the definitions of pseudo controllability and…
We study the statistical properties of observables of scale-free networks in the degree-thresholding renormalization (DTR) flows. For BA scale-free networks with different sizes, we find that their structural and dynamical observables have…
The continuous-space symbiotic branching model describes the evolution of two interacting populations that can reproduce locally only in the simultaneous presence of each other. If started with complementary Heaviside initial conditions,…
We study theoretically the surface response of a semi-infinite viscoelastic polymer network using the two-fluid model. We focus on the overdamped limit and on the effect of the network's intrinsic length scales. We calculate the decay rate…