Related papers: The Heider balance - a continuous approach
Although ubiquitous, interactions of groups of individuals (e.g., modern messaging applications, group meetings, or even a parliament discussion) are not yet thoroughly studied. Frequently, single-groups are modeled as critical-mass…
Networks representing social, biological, technological or other systems are often characterized by higher-order interaction involving any number of nodes. Temporal hypergraphs are given by ordered sequences of hyperedges representing sets…
Every homomorphism $\varphi: B(G) \rightarrow B(H)$ between Fourier-Stieltjes algebras on locally compact groups $G$ and $H$ is determined by a continuous mapping $\alpha: Y \rightarrow \Delta(B(G))$, where $Y$ is a set in the open coset…
Our main result is a full classification, for every connected graph $H$, of the computational complexity of Steiner Forest on $H$-subgraph-free graphs. To obtain this dichotomy, we establish the following new algorithmic, hardness, and…
It is not uncommon for certain social networks to divide into two opposing camps in response to stress. This happens, for example, in networks of political parties during winner-takes-all elections, in networks of companies competing to…
A nonlinear Schrodinger equation arising from light propagation down an inhomogeneous medium is considered. The inhomogeneity is reflected through a non-uniform coefficient of the non-linear term in the equation. In particular, a…
Hypergraphs serve as an effective tool widely adopted to characterize higher-order interactions in complex systems. The most intuitive and commonly used mathematical instrument for representing a hypergraph is the incidence matrix, in which…
The stochastic block model is widely used to generate graphs with a community structure, but no simple alternative currently exists for hypergraphs, in which more than two nodes can be connected together through a hyperedge. We discuss here…
In the Hospitals/Residents (HR) problem, agents are partitioned into hospitals and residents. Each agent wishes to be matched to an agent in the other set and has a strict preference over these potential matches. A matching is stable if…
We study a general mass transport model on an arbitrary graph consisting of $L$ nodes each carrying a continuous mass. The graph also has a set of directed links between pairs of nodes through which a stochastic portion of mass, chosen from…
The three-body problem is famously chaotic, with no closed-form analytical solutions. However, hierarchical systems of three or more bodies can be stable over indefinite timescales. A system is considered hierarchical if the bodies can be…
We analyse signed networks from the perspective of balance theory which predicts structural balance as a global structure for signed social networks that represent groups of friends and enemies. The scarcity of balanced networks encouraged…
Recently, we introduced [Physical Review E 100, 022303 (2019)] a stochastic social balance model with Glauber dynamics which takes into account the role of randomness in the individual's behavior. One important finding of our study was a…
The holographic equilibration of a far-from-equilibrium strongly coupled gauge theory is investigated. The dynamics of a probe D7-brane in an AdS-Vaidya background is studied in the presence of an external time-dependent electric field.…
We study the balance of $G$-gain graphs, where $G$ is an arbitrary group, by investigating their adjacency matrices and their spectra. As a first step, we characterize switching equivalence and balance of gain graphs in terms of their…
Biological and social networks have recently attracted enormous attention between physicists. Among several, two main aspects may be stressed: A non trivial topology of the graph describing the mutual interactions between agents exists…
Persistent homology has been studied to better understand the structural properties and topology features of weighted networks. It can reveal hidden layers of information about the higher-order structures formed by non-pairwise interactions…
A novel formalism, called H-theory, is applied to the problem of statistical equilibrium of a hierarchical complex system with multiple time and length scales. In this approach, the system is formally treated as being composed of a small…
We analyze the following dynamics on a connected graph $(V,E)$ with $n$ vertices. Let $V = I \bigcup B$, where the set of interior vertices $I \ne \emptyset$ is disjoint from the set of boundary vertices $B \neq \emptyset$. Given $p > 1$…
We study information aggregation in networks when agents interact to learn a binary state of the world. Initially each agent privately observes an independent signal which is "correct" with probability $\frac{1}{2}+\delta$ for some $\delta…