Related papers: Universality in polytope phase transitions and mes…
Consider random matrices $A$, of dimension $m\times (m+n)$, drawn from an ensemble with probability density $f(\rmtr AA^\dagger)$, with $f(x)$ a given appropriate function. Break $A = (B,X)$ into an $m\times m$ block $B$ and the…
We introduce the $q$-Hahn PushTASEP --- an integrable stochastic interacting particle system which is a 3-parameter generalization of the PushTASEP, a well-known close relative of the TASEP (Totally Asymmetric Simple Exclusion Process). The…
We study compressed sensing (CS) signal reconstruction problems where an input signal is measured via matrix multiplication under additive white Gaussian noise. Our signals are assumed to be stationary and ergodic, but the input statistics…
We present an analytic proof of the existence of phase transition in the large $N$ limit of certain random noncommutaitve geometries. These geometries can be expressed as ensembles of Dirac operators. When they reduce to single matrix…
Systematic trends of nonuniversal behavior of electron transmission phases through a quantum dot, with no phase lapse for the transition N=1 -> N=2 and a lapse of pi for the N=2 -> N=3 transition, are predicted, in agreement with…
We consider the estimation of an i.i.d.\ random vector observed through a linear transform followed by a componentwise, probabilistic (possibly nonlinear) measurement channel. A novel algorithm, called generalized approximate message…
Many out of equilibrium phenomena, such as diffusion-limited reactions or target search processes, are controlled by first-passage events. So far the general determination of the mean first-passage time (FPT) to a target in confinement has…
Gaussian and quadratic approximations of message passing algorithms on graphs have attracted considerable recent attention due to their computational simplicity, analytic tractability, and wide applicability in optimization and statistical…
We introduce a concept of efficiency for which we can prove that it applies to all paddable languages, but still does not conflict with potential worst case intractability. Note that the family of paddable languages apparently includes all…
This paper is concerned with the problem of continuous-time nonlinear filtering for stochastic processes on a compact and connected matrix Lie group without boundary, e.g. SO(n) and SE(n), in the presence of real-valued observations. This…
Random walks serve as important tools for studying complex network structures, yet their dynamics in cases where transition probabilities are not static remain under explored and poorly understood. Here we study nonlinear random walks that…
The percolation, Ising, and O($n$) models constitute fundamental systems in statistical and condensed matter physics. For short-range-interacting cases, the nature of their phase transitions is well established by renormalization-group…
Message-passing (MP) is a powerful tool for finding an approximate solution in optimization. We generalize it to nonlinear product-sum form, and numerically show the fast convergence for the minimum feedback vertex set and the minimum…
Numerical simulations on Ising Spin Glasses show that spin glass transitions do not obey the usual universality rules which hold at canonical second order transitions. On the other hand the dynamics at the approach to the transition appear…
We discuss a particular kind of quantum walk on a general graph. We affix two semi-infinite lines to a general finite graph, which we call tails. On the tails, the particle making the walk simply advances one unit at each time step, so that…
Partially ordered nondeterminsitic finite automata (poNFAs) are NFAs whose transition relation induces a partial order on states, that is, for which cycles occur only in the form of self-loops on a single state. A poNFA is universal if it…
Approximate message passing algorithm enjoyed considerable attention in the last decade. In this paper we introduce a variant of the AMP algorithm that takes into account glassy nature of the system under consideration. We coin this…
Group symmetry is inherent in a wide variety of data distributions. Data processing that preserves symmetry is described as an equivariant map and often effective in achieving high performance. Convolutional neural networks (CNNs) have been…
The unitary evolution maps in closed chaotic quantum graphs are known to have universal spectral correlations, as predicted by random matrix theory. In chaotic graphs with absorption the quantum maps become non-unitary. We show that their…
We study discrete-time random walks on arbitrary networks with first-passage resetting processes. To the end, a set of nodes are chosen as observable nodes, and the walker is reset instantaneously to a given resetting node whenever it hits…