Related papers: Loop-erased walks and total positivity
We consider Gaussian fields of real symmetric, complex Hermitian or quaternionic Hermitian matrices over an electrical network, and describe how the isomorphisms between these fields and random walks give rise to topological expansions…
In this paper, we present an overview of different types of random walk strategies with local and non-local transitions on undirected connected networks. We present a general approach to analyzing these strategies by defining the dynamics…
Consider a one dimensional simple random walk $X=(X_n)_{n\geq0}$. We form a new simple symmetric random walk $Y=(Y_n)_{n\geq0}$ by taking sums of products of the increments of $X$ and study the two-dimensional walk…
A matrix-weighted graph is an undirected graph with a $k\times k$ positive semidefinite matrix assigned to each edge. There are natural generalizations of the Laplacian and adjacency matrices for such graphs. These matrices can be used to…
We use analyticity arguments to conjecture a one-loop gravity scattering amplitude with an arbitrary number of external legs possessing the same helicity. This result also gives the complete perturbative S-matrix of self-dual gravity.
We establish a factorisation theorem for invertible, cross-symmetric, totally nonnegative matrices, and illustrate the theory by verifying that certain cases of Holte's Amazing Matrix are totally nonnegative.
In this article, we are interested in the enumeration of Fully Packed Loops configurations on a grid with a given noncrossing matching. These quantities also appear as the groundstate components of the Completely Packed Loops model as…
We consider some aspects of conformal symmetry in a metric-scalar-torsion system. It is shown that, for some special choice of the action, torsion acts as a compensating field and the full theory is conformally equivalent to General…
We set the ground for a theory of quantum walks on graphs- the generalization of random walks on finite graphs to the quantum world. Such quantum walks do not converge to any stationary distribution, as they are unitary and reversible.…
Dynamic systems characterized by diversified evolutions are not only more flexible, but also more resilient to attacks, failures and changing conditions. This article addresses the quantification of the diversity of non-linear transient…
A $k$-positive matrix is a matrix where all minors of order $k$ or less are positive. Computing all such minors to test for $k$-positivity is inefficient, as there are $\sum_{\ell=1}^k \binom{n}{\ell}^2$ of them in an $n\times n$ matrix.…
We initiate the study of what we refer to as random walk labelings of graphs. These are graph labelings that are obtainable by performing a random walk on the graph, such that the labeling occurs increasingly whenever an unlabeled vertex is…
We generalize a result from Volkov [Ann. Probab. 29 (2001) 66--91] and prove that, on a large class of locally finite connected graphs of bounded degree $(G,\sim)$ and symmetric reinforcement matrices $a=(a_{i,j})_{i,j\in G}$, the…
We prove that a quantum walk can detect the presence of a marked element in a graph in $O(\sqrt{WR})$ steps for any initial probability distribution on vertices. Here, $W$ is the total weight of the graph, and $R$ is the effective…
For $\lambda>0$, we define a $\lambda$-damped random walk to be a random walk that is started from a random vertex of a graph and stopped at each step with probability $\frac{\lambda}{1+\lambda}$, otherwise continued with probability…
The behavior of complex systems is determined not only by the topological organization of their interconnections but also by the dynamical processes taking place among their constituents. A faithful modeling of the dynamics is essential…
In many studies, it is common to use binary (i.e., unweighted) edges to examine networks of entities that are either adjacent or not adjacent. Researchers have generalized such binary networks to incorporate edge weights, which allow one to…
There is a cell decomposition of the nonnegative Grassmannian. For each cell, totally positive bases(TP-bases) is defined as the minimal set of Pl\"ucker variables such that all other nonzero Pl\"ucker variables in the cell can be expressed…
Models of random walks are considered in which walkers are born at one location and die at all other locations with uniform death rate. Steady-state distributions of random walkers exhibit dimensionally dependent critical behavior as a…
The largest ensemble of qubits which satisfy the general transformation of equal superposition is obtained by different methods, namely, linearity, no-superluminal signalling and non-increase of entanglement under LOCC. We also consider the…