相关论文: Statistical mechanics of frustrated assemblies and…

Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…

Geometric frustration results from a discrepancy between the locally favored arrangement of the constituents of a system and the geometry of the embedding space. Geometric frustration can be either non-cumulative, which implies an extensive…

Two-dimensional turbulent flows, and to some extent, geophysical flows, are systems with a large number of degrees of freedom, which, albeit fluctuating, exhibit some degree of organization: coherent structures emerge spontaneously at large…

We study the collective dynamics of oscillator networks with phase-repulsive coupling, considering various network sizes and topologies. The notion of link frustration is introduced to characterize and quantify the network dynamical states.…

We study the geometrical frustration scenario of glass formation for simple hard sphere models. We find that the dual picture in terms of defects brings little insight and no theoretical simplification for the understanding of the slowing…

Large graphs abound in machine learning, data mining, and several related areas. A useful step towards analyzing such graphs is that of obtaining certain summary statistics - e.g., or the expected length of a shortest path between two…

The idea of charge frustration is applied to describe the properties of such diverse physical systems as oil-water-surfactant mixtures and metal-ammonia solutions. The minimalist charge-frustrated model possesses one energy scale and two…

Geometrically frustrated elastic ribbons exhibit, in many cases, significant changes in configuration depending on the relation between their width and thickness. We show that the existence of such a transition, and the scaling at which it…

We study a number of domain wall forming models where various types of defect junctions can exist. These illustrate some of the mechanisms that will determine the evolution of defect networks with junctions. Understanding these mechanisms…

We study, numerically and analytically, the stability of synchronization for an ensemble of coupled phase oscillators with attractive and repulsive interactions, as a function of the number of repulsive couplings and their intensity.…

According to the so-called strong version of structural balance theory, actors in signed social networks avoid establishing triads with an odd number of negative links. Generalising, the weak version of balance theory allows for nodes to be…

The theory of complex networks and of disordered systems is used to study the stability and dynamical properties of a simple model of material flow networks defined on random graphs. In particular we address instabilities that are…

Geometrical frustration in thin sheets is ubiquitous across scales in biology and becomes increasingly relevant in technology. Previous research identified the origin of the frustration as the violation of Gauss's \emph{Theorema Egregium}.…

Geometrically frustrated solids with non-Euclidean reference metric are ubiquitous in biology and are becoming increasingly relevant in technological applications. Often they acquire a targeted con- figuration of incompatibility through…

Starting from the instability diagram of a traffic flow model, we derive conditions for the occurrence of congested traffic states, their appearance, their spreading in space and time, and the related increase in travel times. We discuss…

Structural balance theory studies stability in networks. Given a $n$-vertex complete graph $G=(V,E)$ whose edges are labeled positive or negative, the graph is considered \emph{balanced} if every triangle either consists of three positive…

Signed networks with positive and negative interaction are widely observed in the real systems. The negative links would induce frustration, then affect global properties of the system. Based on previous studies, frustration of signed…

We present an analytically solvable random graph model in which the connections between the nodes can evolve in time, adiabatically slowly compared to the dynamics of the nodes. We apply the formalism to finite connectivity attractor neural…

Geometric frustration leads to complex phases of matter with exotic properties. Antiferromagnets on triangular lattices and square ice are two simple models of geometrical frustration. We map their highly degenerated ground-state phase…

Self-assembled structures are possible solutions to the problem of increasing the density and connectivity of memristive units in massive arrays. Although they would allow surpassing the limit imposed by the lithographic feature size, the…