Related papers: Universality in polytope phase transitions and mes…

Based on the construction of polytope functions and several results about them in [LP], we take a deep look on their mutation behaviors to find a link between a face of a polytope and a sub-cluster algebra of the corresponding cluster…

In this paper I will describe some results that have been recently obtained in the study of random Euclidean matrices, i.e. matrices that are functions of random points in Euclidean space. In the case of translation invariant matrices one…

It is well known that the similar universal behavior of infinite-size (bulk) systems of different nature requires the same basic conditions: space dimensionality; number components of order parameter; the type (short- or long-range) of the…

Parametric representations of Feynman integrals have a key property: many, frequently all, of the Landau singularities appear as endpoint divergences. This leads to a geometric interpretation of the singularities as faces of Newton…

We suggest a generalization of the Feynman path integral to an integral over random surfaces. The proposed action is proportional to the linear size of the random surfaces and is called gonihedric. The convergence and the properties of the…

A random phase property establishing a link between quasi-one-dimensional random Schroedinger operators and full random matrix theory is advocated. Briefly summarized it states that the random transfer matrices placed into a normal system…

In his recent research M. K. Tam (2018) considered a framework for the analysis of iterative algorithms which can be described in terms of a structured set-valued operator. At each point in the ambient space, the value of the operator can…

We consider a class of approximated message passing (AMP) algorithms and characterize their high-dimensional behavior in terms of a suitable state evolution recursion. Our proof applies to Gaussian matrices with independent but not…

We introduce a communication model called universal SMP, in which Alice and Bob receive a function $f$ belonging to a family $\mathcal{F}$, and inputs $x$ and $y$. Alice and Bob use shared randomness to send a message to a third party who…

Matter exhibits phases and their transitions. These transitions are classified as first-order phase transitions (FOPTs) and continuous ones. While the latter has a well-established theory of the renormalization group, the former is only…

Matter exhibits phases and their transitions. These transitions are classified as first-order phase transitions (FOPTs) and continuous ones. While the latter has a well-established theory of the renormalization group, the former is only…

Let $F := (f_1, \ldots, f_p) \colon {\Bbb R}^n \to {\Bbb R}^p$ be a polynomial map, and suppose that $S := \{x \in {\Bbb R}^n \ : \ f_i(x) \le 0, i = 1, \ldots, p\} \ne \emptyset.$ Let $d := \max_{i = 1, \ldots, p} \deg f_i$ and…

Random-matrix theory is used to study the mesoscopic fluctuations of the excitation gap in a metal grain or quantum dot induced by the proximity to a superconductor. We propose that the probability distribution of the gap is a universal…

A fundamental dichotomous classification for all physical systems is according to whether they are spinless or spinful. This is especially crucial for the study of symmetry-protected topological phases, as the two classes have distinct…

We give a proof of the Universality Conjecture for orthogonal and symplectic ensembles of random matrices in the scaling limit for a class of weights w(x)=exp(-V(x)) where V is a polynomial, V(x)=kappa_{2m}x^{2m}+..., kappa_{2m}>0. For such…

Let $f, f_1, \ldots, f_\nV$ be polynomials with rational coefficients in the indeterminates $\bfX=X_1, \ldots, X_n$ of maximum degree $D$ and $V$ be the set of common complex solutions of $\F=(f_1,\ldots, f_\nV)$. We give an algorithm…

Many classical randomized algorithms (e.g., approximation algorithms for #P-complete problems) utilize the following random walk algorithm for {\em almost uniform sampling} from a state space $S$ of cardinality $N$: run a symmetric ergodic…

Multilayer (or deep) networks are powerful probabilistic models based on multiple stages of a linear transform followed by a non-linear (possibly random) function. In general, the linear transforms are defined by matrices and the non-linear…

In a series of recent works, an interesting quantum generative model based on parameterized instantaneous polynomial quantum (IQP) circuits has emerged as they can be trained efficiently classically using any loss function that depends only…

The theory of continuous phase transitions predicts the universal collective properties of a physical system near a critical point, which for instance manifest in characteristic power-law behaviours of physical observables. The…