Related papers: Incompatibility boundaries for properties of commu…
Choice functions constitute a simple, direct and very general mathematical framework for modelling choice under uncertainty. In particular, they are able to represent the set-valued choices that appear in imprecise-probabilistic decision…
In the paper, we give partition-theoretic results for the coefficients of some mock theta functions and prove their congruence properties. Some recurrence relations connecting the coefficients of the mock theta functions with certain…
We study the compatibility (or joint measurability) of quantum observables in a setting where the experimenter has access to multiple copies of a given quantum system, rather than performing the experiments on each individual copy…
Community detection is one of the most investigated problems in the field of complex networks. Although several methods were proposed, there is still no precise definition of communities. As a step towards a definition, I highlight two…
The fact that there are quantum observables without a simultaneous measurement is one of the fundamental characteristics of quantum mechanics. In this work we expand the concept of joint measurability to all kinds of possible measurement…
We examine the transmission of quantum particles (phonons, electrons, and photons) across interfaces, identifying universal patterns in diverse physical scenarios. Starting with classical wave equations, we quantize them and derive kinetic…
Spectral clustering is popular among practitioners and theoreticians alike. While performance guarantees for spectral clustering are well understood, recent studies have focused on enforcing ``fairness'' in clusters, requiring them to be…
Quantum mechanics in phase space (or deformation quantization) appears to fail as an autonomous quantum method when infinite potential walls are present. The stationary physical Wigner functions do not satisfy the normal eigen equations,…
We consider two new problems regarding the impact of edge addition or removal on the modularity of partitions (or community structures) in a network. The first problem seeks to add edges to enforce that a desired partition is the partition…
Here we propose a new method to compare the modular structure of a pair of node-aligned networks. The majority of current methods, such as normalized mutual information, compare two node partitions derived from a community detection…
The existence of incompatible measurements is a fundamental phenomenon having no explanation in classical physics. Intuitively, one considers given measurements to be incompatible within a framework of a physical theory, if their…
Complexity of the problem of choosing among uncertain acts is a salient feature of many of the environments in which departures from expected utility theory are observed. I propose and axiomatize a model of choice under uncertainty in which…
We consider general settings of Bell inequality experiments with many parties, where each party chooses from a finite number of measurement settings each with a finite number of outcomes. We investigate the constraints that Bell…
For a given ergodic measure preserving transformation T of a standard measure space each finite labelled partition defines an ergodic stationary process. There is a complete metric on the space of partitions which is separable. Various…
Community detection is a core tool for analyzing large realworld graphs. It is often used to derive additional local features of vertices and edges that will be used to perform a downstream task, yet the impact of community detection on…
Erling Folner proved that the amenability or nonamenability of a countable group depends on the complexity of its finite subsets. Complexity has three measures: maximum Folner ratio, optimal cooling function, and minimum cooling norm. Our…
In the consistent histories (CH) approach to quantum theory probabilities are assigned to histories subject to a consistency condition of negligible interference. The approach has the feature that a given physical situation admits multiple…
The consensus problem, briefly stated, consists of having processes in an asynchronous distributed system agree on a value. It is widely known that the consensus problem does not have a deterministic solution that ensures both termination…
We propose a notion of a stable partition in a coalitional game that is parametrized by the concept of a defection function. This function assigns to each partition of the grand coalition a set of different coalition arrangements for a…
We are given a set of elements in a metric space. The distribution of the elements is arbitrary, possibly adversarial. Can we weigh the elements in a way that is resistant to such (adversarial) manipulations? This problem arises in various…