Related papers: Strength distribution of repeatedly broken chains
In a wide range of complex networks, the links between the nodes are temporal and may sporadically appear and disappear. This temporality is fundamental to analyze the formation of paths within such networks. Moreover, the presence of the…
This article describes a complex network model whose weights are proportional to the difference between uniformly distributed ``fitness'' values assigned to the nodes. It is shown both analytically and experimentally that the strength…
The successive discrete structures generated by a sequential algorithm from random input constitute a Markov chain that may exhibit long term dependence on its first few input values. Using examples from random graph theory and search…
This article describes a gradient complex network model whose weights are proportional to the difference between uniformly distributed ``fitness'' values assigned to the nodes. It is shown analytically and experimentally that the strength…
The rupture of a polymer chain maintained at temperature $T$ under fixed tension is prototypical to a wide array of systems failing under constant external strain and random perturbations. Past research focused on analytic and numerical…
Several interesting approaches have been reported in the literature on complex networks, random walks, and hierarchy of graphs. While many of these works perform random walks on stable, fixed networks, in the present work we address the…
The question of recurrence and transience of branching Markov chains is more subtle than for ordinary Markov chains; they can be classified in transience, weak recurrence, and strong recurrence. We review criteria for transience and weak…
Motivated by experiments in which single DNA molecules are stretched and twisted we consider a perturbative approach around very high forces, where we determine the writhe distribution in a simple, analytically tractable model. Our results…
We consider the rupture dynamics of a homopolymer chain pulled at one end at a constant loading rate. Our model of the breakable polymer is related to the Rouse chain, with the only difference that the interaction between the monomers is…
We discuss the threshold activated extremal dynamics that is prevalent in the breakdown processes in heterogeneous materials. We model such systems by an elastic spring network with random breaking thresholds assigned to the springs.…
Systems which consist of many localized constituents interacting with each other can be represented by complex networks. Consistently, network science has become highly popular in vast fields focusing on natural, artificial and social…
Empirical estimation of critical points at which complex systems abruptly flip from one state to another is among the remaining challenges in network science. However, due to the stochastic nature of critical transitions it is widely…
We show that determining the crossing number of a link is NP-hard. For some weaker notions of link equivalence, we also show NP-completeness.
The mechanical resistance of a polyethylene strand subject to tension and the way its properties are affected by the presence of a knot is studied using first-principles molecular dynamics calculations. The distribution of strain energy for…
Damage scenarios for large networks are considered. The cascade scenario is described by means of powers of adjacency matrix. More difficult probabilistic variants of the large network damage are modeling by Markov chains. For reliability…
The freely jointed chain is often applied to model the thermodynamics of single polymer chains, but the traditional formulation of the model lacks internal energy changes due to bond stretching. For this reason, the extensible freely…
We review briefly the concepts underlying complex systems and probability distributions. The later are often taken as the first quantitative characteristics of complex systems, allowing one to detect the possible occurrence of regularities…
We study sequences of partitions of the unit interval into subintervals, starting from the trivial partition, in which each partition is obtained from the one before by splitting its subintervals in two, according to a given rule, and then…
We present an explicit connected spanning structure that appears in a random graph just above the connectivity threshold with high probability.
As the amount of linked data published on the web grows, attempts are being made to describe and measure it. However even basic statistics about a graph, such as its size, are difficult to express in a uniform and predictable way. In order…