Related papers: Path methods for strong shift equivalence of posit…
A new notion of displacement convexity on a matrix level is developed for density flows arising from mean-field games, compressible Euler equations, entropic interpolation, and semi-classical limits of non-linear Schr\"odinger equations.…
Inspired by a recent novel work of Good and Meddaugh, we establish fundamental connections between shadowing, finite order shifts, and ultrametric complete spaces. We develop a theory of shifts of finite type for infinite alphabets. We call…
The degree matrix of a graph is the diagonal matrix with diagonal entries equal to the degrees of the vertices of $X$. If $X_1$ and $X_2$ are graphs with respective adjacency matrices $A_1$ and $A_2$ and degree matrices $D_1$ and $D_2$, we…
We introduce a path-theoretic framework for understanding the representation theory of (quantum) symmetric and general linear groups and their higher level generalisations over fields of arbitrary characteristic. Our first main result is a…
We establish analogues of the geometric Pitman $2M-X$ theorem of Matsumoto and Yor and of the classical Dufresne identity, for a multiplicative random walk on positive definite matrices with Beta type II distributed increments. The Dufresne…
We performed "weighted ensemble" path-sampling simulations of adenylate kinase, using several semi-atomistic protein models. Our study investigated both the biophysics of conformational transitions as well as the possibility of increasing…
The Kadison-Singer Problem (K-S) has expanded since 1959 to a very large number of equivalent problems in various fields. In the present paper we will introduce the notion of weak paveability for positive elements of a von Neumann algebra…
Among the lattice loop models defined by Pearce, Rasmussen and Zuber (2006), the model corresponding to critical dense polymers ($\beta = 0$) is the only one for which an inversion relation for the transfer matrix $D_N(u)$ was found by…
The class of norm-dependent Random Matrix Ensembles is studied in the presence of an external field. The probability density in those ensembles depends on the trace of the squared random matrices, but is otherwise arbitrary. An exact…
We present detailed discussions on a new approach we proposed in a previous paper to numerically study quantum spin systems. This method, which we will call re-structuring method hereafter, is based on rearrangement of intermediate states…
A new algorithm, termed subspace evolution and transfer (SET), is proposed for solving the consistent matrix completion problem. In this setting, one is given a subset of the entries of a low-rank matrix, and asked to find one low-rank…
Symmetry plays a major role in subgraph matching both in the description of the graphs in question and in how it confounds the search process. This work addresses how to quantify these effects and how to use symmetries to increase the…
A new determinant inequality of positive semidefinite matrices is discovered and proved by us. This new inequality is useful for attacking and solving a variety of optimization problems arising from the design of wireless communication…
Path reweighting is a principally exact method to estimate dynamic properties from biased simulations - provided that the path probability ratio matches the stochastic integrator used in the simulation. Previously reported path probability…
Table detection within document images is a crucial task in document processing, involving the identification and localization of tables. Recent strides in deep learning have substantially improved the accuracy of this task, but it still…
Let R and S be two vectors of real numbers whose entries have the same sum. In the transportation problems one wishes to find a matrix A with row sum vector R and column sum vector S. If, in addition, the two vectors only contain…
We study positive solutions of the superlinear Lane-Emden inequality \(-\Delta u\ge \sigma u^q\), \(q>1\), on infinite locally finite weighted graphs and connected domains of such graphs. We first prove that solvability is equivalent to the…
A matrix is totally positive if all of its minors are positive. This notion of positivity coincides with the type A version of Lusztig's more general total positivity in reductive real-split algebraic groups. Since skew-symmetric matrices…
A ring $R$ is called strongly clean if every element of $R$ is the sum of a unit and an idempotent that commute. By {\rm SRC} factorization, Borooah, Diesl, and Dorsey \cite{BDD051} completely determined when ${\mathbb M}_n(R)$ over a…
Central to rough path theory is the signature transform of a path, an infinite series of tensors given by the iterated integrals of the underlying path. The signature poses an effective way to capture sequentially ordered information,…