Related papers: Emergent correlations in the selected link-times a…
We study transport properties such as electrical and frictionless flow conductance on scale-free and Erdos-Renyi networks. We consider the conductance G between two arbitrarily chosen nodes where each link has the same unit resistance. Our…
We investigate by numerical simulation and finite-size analysis the impact of long-range shortcuts on a spatially embedded transportation network. Our networks are built from two-dimensional ($d=2$) square lattices to be improved by the…
We study the effects of uniform time delays on the extreme fluctuations in stochastic synchronization and coordination problems with linear couplings in complex networks. We obtain the average size of the fluctuations at the nodes from the…
We study a simple swarming model on a two-dimensional lattice where the self-propelled particles exhibit a tendency to align ferromagnetically. Volume exclusion effects are present: particles can only hop to a neighboring node if the node…
We consider a stochastic interface $h(x,t)$, described by the $1+1$ Kardar-Parisi-Zhang (KPZ) equation on the half-line $x\geq0$ with the reflecting boundary at $x=0$. The interface is initially flat, $h(x,t=0)=0$. We focus on the…
We study the cascading failures in a system composed of two interdependent square lattice networks A and B placed on the same Cartesian plane, where each node in network A depends on a node in network B randomly chosen within a certain…
We investigate the extreme first-passage statistics of $N$ non-interacting random walkers on discrete, hierarchical networks. {By distinguishing between transport limited by escape from localized initial states (injection-limited) and…
We provide a comprehensive report on scale-invariant fluctuations of growing interfaces in liquid-crystal turbulence, for which we recently found evidence that they belong to the Kardar-Parisi-Zhang (KPZ) universality class for 1+1…
In this work we are concerned with the crossover between strong disorder (SD) and weak disorder (WD) behaviors in three well-known problems that involve minimal paths: directed polymers (directed paths with fixed starting point and length),…
Consider the short-time probability distribution $\mathcal{P}(H,t)$ of the one-point interface height difference $h(x=0,\tau=t)-h(x=0,\tau=0)=H$ of the stationary interface $h(x,\tau)$ described by the Kardar-Parisi-Zhang equation. It was…
The Lovasz Local Lemma (LLL) is a probabilistic tool which has been used to show the existence of a variety of combinatorial structures with good "local" properties. The "LLL-distribution" can be used to show that the resulting structures…
It has been shown that the last passage time in certain symmetrized models of directed percolation can be written in terms of averages over random matrices from the classical groups $U(l)$, $Sp(2l)$ and $O(l)$. We present a theory of such…
We show that continuous random walks (diffusion) in the Poincar\'{e} hyperbolic upper halfplane $\mathbb{H}^2 = \{(x,y)|y>0\}$ provide a unifying description of three seemingly unrelated phenomena: (i) the non-analytic divergence of the…
We consider the isochrone curves in first-passage percolation on a 2D square lattice, i.e. the boundary of the set of points which can be reached in less than a given time from a certain origin. The occurrence of an instantaneous average…
We study the statistical properties of wave scattering in a disordered waveguide. The statistical properties of a "building block" of length (delta)L are derived from a potential model and used to find the evolution with length of the…
In this paper, we study detection and fast reconstruction of the celebrated Watts-Strogatz (WS) small-world random graph model \citep{watts1998collective} which aims to describe real-world complex networks that exhibit both high clustering…
Systems of oscillators subject to time-dependent noise typically achieve synchronization for long times when their mutual coupling is sufficiently strong. The dynamical process whereby synchronization is reached can be thought of as a…
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…
We perform numerical simulations to study the optimal path problem on disordered hierarchical graphs with effective dimension d=2.32. Therein, edge energies are drawn from a disorder distribution that allows for positive and negative…
Previous work shows that the mean first-passage time (MFPT) for random walks to a given hub node (node with maximum degree) in uncorrelated random scale-free networks is closely related to the exponent $\gamma$ of power-law degree…