Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userInter-Party Avalanche Involvements May Increase Quadratically With Party Density
52
0
0.0
(
0
)
Authors
Charles A. Hagedorn
Ask ChatGPT about the research
No Arabic abstract
We estimate, from first-principles, the rate of inter-party avalanche involvements. The model suggests that the likelihood of inter-party involvements is quadratic in the density of parties -- twice as many parties quadruples the likelihood. The model predicts that when the product of the party-density and the area of a days potential avalanches approaches one, inter-party avalanche involvements will become a substantial fraction of all avalanche involvements. As a corollary, the relative rate of inter-party involvements is expected to increase with avalanche size. We argue, with selected North American inter-party incidents from 2001-2019, that inter-party involvements are a timely concern. To spur conversation, we enumerate a variety of strategies that may mitigate inter-party hazard.
rate research
Read More
We measure polarization in the United States Congress using the network science concept of modularity. Modularity provides a conceptually-clear measure of polarization that reveals both the number of relevant groups and the strength of inter-group divisions without making restrictive assumptions about the structure of the party system or the shape of legislator utilities. We show that party influence on Congressional blocs varies widely throughout history, and that existing measures underestimate polarization in periods with weak party structures. We demonstrate that modularity is a significant predictor of changes in majority party and that turnover is more prevalent at medium levels of modularity. We show that two variables related to modularity, called `divisiveness and `solidarity, are significant predictors of reelection success for individual House members. Our results suggest that modularity can serve as an early warning of changing group dynamics, which are reflected only later by changes in party labels.
We consider the problem of decorrelating states of coupled quantum systems. The decorrelation can be seen as separation of quantum signals, in analogy to the classical problem of signal-separation rising in the so-called cocktail-party context. The separation of signals cannot be achieved perfectly, and we analyse the optimal decorrelation map in terms of added noise in the local separated states. Analytical results can be obtained both in the case of two-level quantum systems and for Gaussian states of harmonic oscillators.
Bipartite matching problem is to study two disjoint groups of agents who need to be matched pairwise. It can be applied to many real-world scenarios and explain many social phenomena. In this article, we study the effect of competition on bipartite matching problem by introducing correlated wish list. The results show that proper competition can improve the overall happiness of society and also reduce the instability of the matching result of unequal sized bipartite matching.
We initiate the study of multi-party computation for classical functionalities (in the plain model) with security against malicious polynomial-time quantum adversaries. We observe that existing techniques readily give a polynomial-round protocol, but our main result is a construction of *constant-round* post-quantum multi-party computation. We assume mildly super-polynomial quantum hardness of learning with errors (LWE), and polynomial quantum hardness of an LWE-based circular security assumption. Along the way, we develop the following cryptographic primitives that may be of independent interest: 1. A spooky encryption scheme for relations computable by quantum circuits, from the quantum hardness of an LWE-based circular security assumption. This yields the first quantum multi-key fully-homomorphic encryption scheme with classical keys. 2. Constant-round zero-knowledge secure against multiple parallel quantum verifiers from spooky encryption for relations computable by quantum circuits. To enable this, we develop a new straight-line non-black-box simulation technique against *parallel* verifiers that does not clone the adversarys state. This forms the heart of our technical contribution and may also be relevant to the classical setting. 3. A constant-round post-quantum non-malleable commitment scheme, from the mildly super-polynomial quantum hardness of LWE.
We consider the task of secure multi-party distributed quantum computation on a quantum network. We propose a protocol based on quantum error correction which reduces the number of necessary qubits. That is, each of the $n$ nodes in our protocol requires an operational workspace of $n^2 + 4n$ qubits, as opposed to previously shown $Omegabig((n^3+n^2s^2)log nbig)$ qubits, where $s$ is a security parameter. Additionally, we reduce the communication complexity by a factor of $mathcal{O}(n^3log(n))$ qubits per node, as compared to existing protocols. To achieve universal computation, we develop a distributed procedure for verifying magic states, which allows us to apply distributed gate teleportation and which may be of independent interest. We showcase our protocol on a small example for a 7-node network.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
