Related papers: Flooding in weighted sparse random graphs of activ…
Percolation in an information-theoretically secure graph is considered where both the legitimate and the eavesdropper nodes are distributed as Poisson point processes. For both the path-loss and the path-loss plus fading model, upper and…
Complex systems often have features that can be modeled by advanced mathematical tools [1]. Of special interests are the features of complex systems that have a network structure as such systems are important for modeling technological and…
We have generalized the semi-analytic approach of special flow to the description of flows of passive particles taking into account internal noise. The model is represented by a series of recurrence relations. The recurrence relations are…
In this work we investigate the dynamics of random walk processes on scale-free networks in a short to moderate time scale. We perform extensive simulations for the calculation of the mean squared displacement, the network coverage and the…
Gravity-driven flows of granular matter are involved in a wide variety of situations, ranging from industrial processes to geophysical phenomena, such as avalanches or landslides. These flows are characterized by the coexistence of solid…
We numerically study the scattering coefficients of linear water waves on stationary flows above a localized obstacle. We compare the scattering on trans- and subcritical flows, and then focus on the latter which have been used in recent…
This paper considers a model for cascades on random networks in which the cascade propagation at any node depends on the load at the failed neighbor, the degree of the neighbor as well as the load at that node. Each node in the network…
The dynamics of a passive scalar plume in a turbulent boundary layer is experimentally investigated via vertical turbulent transport time-series. Data are acquired in a rough-wall turbulent boundary layer that develops in a recirculating…
Expected urban population doubling calls for a compelling theory of the city. Random walks and diffusions defined on spatial city graphs spot hidden areas of geographical isolation in the urban landscape going downhill. First--passage time…
Bootstrap percolation on a graph iteratively enlarges a set of occupied sites by adjoining points with at least $\theta$ occupied neighbors. The initially occupied set is random, given by a uniform product measure, and we say that spanning…
In the study of complex networks (systems), the scaling phenomenon of flow fluctuations refers to a certain power-law between the mean flux (activity) $<F_i>$ of the $i$th node and its variance $\sigma_i$ as $\sigma_i \propto < F_{i} >…
This paper discusses a simple stochastic model for the spread of messages in a large population with two types of individuals: transmitters and receivers. Transmitters, after receiving the message, start spreading copies of the message to…
We study a geometric version of first-passage percolation on the complete graph, known as long-range first-passage percolation. Here, the vertices of the complete graph $\mathcal K_n$ are embedded in the $d$-dimensional torus $\mathbb…
A model-based description of the scaling and radial location of turbulent fluctuations in turbulent pipe flow is presented and used to illuminate the scaling behaviour of the very large scale motions. The model is derived by treating the…
A fundamental challenge in computer analysis of power flow is the rigorous understanding of the impact of different loading levels on the solutions of the power flow equation. This letter presents a comprehensive study of possible numerical…
Channel formation and branching is widely seen in physical systems where movement of fluid through a porous structure causes the spatiotemporal evolution of the medium in response to the flow, in turn causing flow pathways to evolve. We…
Floods affected more than 2 billion people worldwide from 1998 to 2017 and their occurrence is expected to increase due to climate warming, population growth and rapid urbanization. Recent approaches for understanding the resilience of…
We introduce a growing network model---the copying model---in which a new node attaches to a randomly selected target node and, in addition, independently to each of the neighbors of the target with copying probability $p$. When…
The random-cluster model, a correlated bond percolation model, unifies a range of important models of statistical mechanics in one description, including independent bond percolation, the Potts model and uniform spanning trees. By…
Topology of urban environments can be represented by means of graphs. We explore the graph representations of several compact urban patterns by random walks. The expected time of recurrence and the expected first passage time to a node…