Related papers: Analysis of ground state in random bipartite match…
The ground state correlations induced by a general pairing Hamiltonian in a finite system of like fermions are described in terms of four-body correlated structures (quartets). These are real superpositions of products of two pairs of…
A probabilistic approach to the stable matching problem has been identified as an important research area with several important open problems. When considering random matchings, ex-post stability is a fundamental stability concept. A…
We introduce a model of dynamic matching with transferable utility, extending the static model of Shapley and Shubik (1971). Forward-looking agents have individual states that evolve with current matches. Each period, a matching market with…
In their seminal work on the Stable Marriage Problem, Gale and Shapley describe an algorithm which finds a stable matching in $O(n^2)$ communication rounds. Their algorithm has a natural interpretation as a distributed algorithm where each…
Motivated by the Kronecker product approximation technique, we have developed a very simple method to assess the inseparability of bipartite quantum systems, which is based on a realigned matrix constructed from the density matrix. For any…
We propose a method to find out the community structure of a complex network. In this method the ground state problem of a ferromagnetic random field Ising model is considered on the network with the magnetic field $B_s = +\infty$, $B_{t} =…
In the theory of two-sided matching markets there are two well-known models: the marriage model (where no money is involved) and the assignment model (where payments are involved). Roth and Sotomayor (1990) asked for an explanation for the…
In this work, we analyze the influence of a single strategic agent on the quality of the other agents' matchings in a matching market. We consider a stable matching problem with $n$ men and $n$ women when preferences are drawn uniformly…
For a many-to-one matching model, we study the matchings obtained through the restabilization of stable matchings that had been disrupted by a change in the population. We include a simple representation of the stable matching obtained in…
The subsystem compatibility problem, which concerns the question of whether a set of subsystem states are compatible with a state of the entire system, has received much study. Here we attack the problem from a new angle, utilising the…
We study stable matchings that are robust to preference changes in the two-sided stable matching setting of Gale and Shapley[GS62]. Given two instances $A$ and $B$ on the same set of agents, a matching is said to be robust if it is stable…
We introduce a homology-based technique for the analysis of multiqubit state vectors. In our approach, we associate state vectors to data sets by introducing a metric-like measure in terms of bipartite entanglement, and investigate the…
We present the construction of the ground state of the Gross-Pitaevskii-Poisson equations using genetic algorithms. By employing numerical solutions, we develop an empirical formula for the density that works within the considered parameter…
We consider the task of detecting a hidden bipartite subgraph in a given random graph. This is formulated as a hypothesis testing problem, under the null hypothesis, the graph is a realization of an Erd\H{o}s-R\'{e}nyi random graph over $n$…
We propose a technique to investigate multipartite entanglement in the symmetric subspace. Our approach is to map an $N$-qubit symmetric state onto a bipartite symmetric state of higher local dimension. We show that this mapping preserves…
We are given a bipartite graph $G = \left( A \cup B, E \right)$. In the one-sided model, every $a \in A$ (often called agents) ranks its neighbours $z \in N_{a}$ strictly, and no $b \in B$ has any preference order over its neighbours $y \in…
Suppose we have an unknown multipartite quantum state, how can we experimentally find out whether it is genuine multipartite entangled or not? Recall that even for a bipartite quantum state whose density matrix is known, it is already…
We present our results on properties of ground states for nucleonic systems in the presence of random two-body interactions. In particular we present probability distributions for parity, seniority, spectroscopic (i.e., in the laboratory…
We analyze the problem of how different ground states associated to the same set of the Hamiltonian parameters evolve after a sudden quench. To realize our analysis we define a quantitative approach to the local distinguishability between…
Quantifying mixed-state entanglement in many-body systems has been a formidable task. In this work, we quantify the entanglement of states in unresolvable spin ensembles, which are inherently mixed. By exploiting their permutationally…