相关论文: Serial interconnections of 1-contracting and 2-con…
We study a network of 500 coupled modified van der Pol oscillators. The value of a parameter associated with each oscillator is drawn from a normal distribution, giving a heterogeneous network. For strong enough coupling the oscillators all…
The node set of a two-mode network consists of two disjoint subsets and all its links are linking these two subsets. The links can be weighted. We developed a new method for identifying important sub-networks in two-mode networks. The…
Given a network of agents, we study the problem of designing a distributed algorithm that computes k independent weighted means of the network's initial conditions (namely, the agents agree on a k-dimensional space). Akin to average…
We study skew-orthogonal polynomials with respect to the weight function $\exp[-2V(x)]$, with $V(x)=\sum_{K=1}^{2d}(u_{K}/{K})x^{K}$, $u_{2d} > 0$, $d > 0$. A finite subsequence of such skew-orthogonal polynomials arising in the study of…
We propose a means to relate properties of an interconnected system to its separate component systems in the presence of cascade-like phenomena. Building on a theory of interconnection reminiscent of the behavioral approach to systems…
Flow networks can describe many natural and artificial systems. We present a model for a flow system that allows for volume accumulation, includes conduits with a non-linear relation between current and pressure difference, and can be…
We consider the ground-state entanglement in highly connected many-body systems, consisting of harmonic oscillators and spin-1/2 systems. Varying their degree of connectivity, we investigate the interplay between the enhancement of…
A major line of questions in quantum information and computing asks how quickly locally random circuits converge to resemble global randomness. In particular, approximate k-designs are random unitary ensembles that resemble random circuits…
We characterize 1-complemented subspaces of finite codimension in strictly monotone one-$p$-convex, $2<p<\infty,$ sequence spaces. Next we describe, up to isometric isomorphism, all possible types of 1-unconditional structures in sequence…
We use series expansions to study dynamics of equilibrium and non-equilibrium systems on networks. This analytical method enables us to include detailed non-universal effects of the network structure. We show that even low order…
A family of subsets of $\{1,\ldots,n\}$ is called {\it intersecting} if any two of its sets intersect. A classical result in extremal combinatorics due to Erd\H{o}s, Ko, and Rado determines the maximum size of an intersecting family of…
Symmetry constraints for (2+1)-dimensional dispersionless integrable equations are considered. It is demonstrated that they naturally lead to systems of hydrodynamic type which arise within the reduction method. One also easily obtaines an…
Multimodal normal incestual systems are investigated in terms of multiple categories. The different sorted composition of operators are exhibited as 2-cells in multiple categories built up from 2-categories giving rise to different axioms.…
What features characterise complex system dynamics? Power laws and scale invariance of fluctuations are often taken as the hallmarks of complexity, drawing on analogies with equilibrium critical phenomena[1-3]. Here we argue that slow,…
Finding separable certificates of stability is important for tractability of analysis methods for large-scale networked systems. In this paper we consider the question of when a nonlinear system which is contracting, i.e. all solutions are…
A large variety of interacting complex systems are characterized by interactions occurring between more than two nodes. These systems are described by simplicial complexes. Simplicial complexes are formed by simplices (nodes, links,…
The structure of a river network may be seen as a discrete set of nested sub-networks built out of individual stream segments. These network components are assigned an integral stream order via a hierarchical and discrete ordering method.…
Construction of signal sets with low correlation property is of interest to designers of CDMA systems. One of the preferred ways of constructing such sets is the interleaved construction which uses two sequences a and b with 2-level…
A book embedding of a complete graph is a spatial embedding whose planar projection has the vertices located along a circle, consecutive vertices are connected by arcs of the circle, and the projections of the remaining "interior" edges in…
Integer iteration rules such as n |-> {a n + b, c n +d} are studied as minimal examples of the general process of multicomputation. Despite the simplicity of such rules, their multiway graphs can be complex, exhibiting, for example,…