Related papers: Fibers on a graph with local load sharing
We analyse graphs in which each vertex is assigned random coordinates in a geometric space of arbitrary dimensionality and only edges between adjacent points are present. The critical connectivity is found numerically by examining the size…
We study modulational instability in a fiber system resembling a dispersion-managed link where the sign of the group-velocity dispersion varies randomly according to a telegraph process. We find that the instability gain of stochastic…
The distribution of the magnitudes of damage avalanches during a failure process typically follows a power law. When these avalanches are recorded close to the point at which the system fails catastrophically, we find that the power law has…
Dynamical processes exhibiting absorbing states are essential in the modeling of a large variety of situations from material science to epidemiology and social sciences. Such processes exhibit the possibility of avalanching behavior upon…
We present a two-dimensional system which exhibits features of self-organized criticality. The avalanches which occur on the surface of a pile of rice are found to exhibit finite size scaling in their probability distribution. The critical…
We investigate how the topology of attributed graphs influences the distribution of node attributes. This work offers a novel perspective by treating topology and attributes as structurally distinct but interacting components. We introduce…
We report on experimentally observed shear stress fluctuations in both granular solid and fluid states, showing that they are non-Gaussian at low shear rates, reflecting the predominance of correlated structures (force chains) in the…
We study the tolerance to congestion failures in communication networks with scale-free topology. The traffic load carried by each damaged element in the network must be partly or totally redistributed among the remaining elements.…
Random graphs have played an instrumental role in modelling real-world networks arising from the internet topology, social networks, or even protein-interaction networks within cells. Percolation, on the other hand, has been the fundamental…
To investigate the barrier effect of grain boundaries on the propagation of avalanche-like plasticity at the atomic-scale, we perform three-dimensional molecular dynamics simulations by using simplified polycrystal models including…
In recent decades, it has been emphasized that the evolving structure of networks may be shaped by interaction principles that yield sparse graphs with a vertex degree distribution exhibiting an algebraic tail, and other structural traits…
We use a discrete-time formulation to study the asymmetric avalanche process [Phys. Rev. Lett. vol. 87, 084301 (2001)] on a finite ring and obtain an exact expression for the average avalanche size of particles as a function of toppling…
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…
We study the undirected divisibility graph in which the vertex set is a finite subset of consecutive natural numbers up to N.We derive analytical expressions for measures of the graph like degree, clustering, geodesic distance and…
Using large scale numerical simulations we analyze the statistical properties of fracture in the two dimensional random spring model and compare it with its scalar counterpart: the random fuse model. We first consider the process of crack…
Many real-world networks of interest are embedded in physical space. We present a new random graph model aiming to reflect the interplay between the geometries of the graph and of the underlying space. The model favors configurations with…
Various kinds of heterogeneity in solids including atomistic discreteness affect the fracture strength as well as the failure dynamics remarkably. Here we study the effects of an initial crack in a discrete model for fracture in…
We introduce an individual-based model for fiber elements having the ability to cross-link or unlink each other and to align with each other at the cross links. We first formally derive a kinetic model for the fiber and cross-links…
This paper presents a graph bundling algorithm that agglomerates edges taking into account both spatial proximity as well as user-defined criteria in order to reveal patterns that were not perceivable with previous bundling techniques. Each…
In network data analysis, summary statistics of a network can provide us with meaningful insight into the structure of the network. The average clustering coefficient is one of the most popular and widely used network statistics. In this…