Related papers: The strong component structure of the barely subcr…
The weak localization (WL) contribution to the two-level correlation function is calculated for two-dimensional disordered conductors. Our analysis extends to the nondiffusive (ballistic) regime, where the elastic mean path is of order of…
We study a special case of the configuration model, in which almost all the vertices of the graph have degree $2$. We show that the graph has a very peculiar and interesting behaviour, in particular when the graph is made up by a vast…
Biologists and physicists have a rich tradition of modeling living systems with simple models composed of a few interacting components. Despite the remarkable success of this approach, it remains unclear how to use such finely tuned models…
Fracture in quasi-statically driven systems is studied by means of a discrete spring-block model. Developed from close comparison with desiccation experiments, it describes crack formation induced by friction on a substrate. The model…
We consider bond percolation on random graphs with given degrees and bounded average degree. In particular, we consider the order of the largest component after the random deletion of the edges of such a random graph. We give a rough…
We study site and bond percolation on directed simple random graphs with a given degree distribution and derive the expressions for the critical value of the percolation probability above which the giant strongly connected component emerges…
Simple nonlinear dynamical systems with multiple stable stationary states are often taken as models for switchlike biological systems. This paper considers the interaction of multiple such simple multistable systems when they are embedded…
An input-output approach to stability analysis is explored for networked systems with uncertain link dynamics. The main result consists of a collection of integral quadratic constraints, which together imply robust stability of the…
We consider a finite collection of reinforced stochastic processes with a general network-based interaction among them. We provide sufficient and necessary conditions in order to have some form of almost sure asymptotic synchronization,…
We describe how to calculate the sizes of all giant connected components of a directed graph, including the {\em strongly} connected one. Just to the class of directed networks, in particular, belongs the World Wide Web. The results are…
We introduce a new class of large structured random matrices characterized by four fundamental properties which we discuss. We prove that this class is stable under matrix-valued and pointwise non-linear operations. We then formulate an…
We show that extremely simple systems of a not too large number of particles can be simultane- ously thermally stable and complex. To such an end, we extend the statistical complexity's notion to simple configurations of non-interacting…
Correlations and other collective phenomena in a schematic model of heterogeneous binary agents (individual spin-glass samples) are considered on the complete graph and also on 2d and 3d regular lattices. The system's stochastic dynamics is…
The influence of disordering upon critical behavior of the system with hidden degrees of freedom is considered. It is shown that there is a tricritical behavior in the constrained system, while in the unconstrained system only phase…
We study the asymptotics of large, moderate and normal deviations for the connected components of the sparse random graph by the method of stochastic processes. We obtain the logarithmic asymptotics of large deviations of the joint…
We develop two generalizations of contraction theory, namely, semi-contraction and weak-contraction theory. First, using the notion of semi-norm, we propose a geometric framework for semi-contraction theory. We introduce matrix…
We consider the problem of computing the maximal invariant set of discrete-time black-box nonlinear systems without analytic dynamical models. Under the assumption that the system is asymptotically stable, the maximal invariant set…
The identification of the limiting factors in the dynamical behavior of complex systems is an important interdisciplinary problem which often can be traced to the spectral properties of an underlying network. By deriving a general relation…
We develop a diffusion approximation for systems subject to fast random resetting by small amplitudes. Equivalently, this describes systems with frequent but small catastrophes. We demonstrate the validity of the approximation by computing…
The weak component generalizes the idea of connected components to directed graphs. In this paper, an exact criterion for existence of the giant weak component is derived for directed graphs with arbitrary bivariate degree distributions. In…