相关论文: Loop-erased walks and total positivity

A quantum walk model which reflects the $2$-cell embedding on the orientable closed surface of a graph in the dynamics is introduced. We show that the scattering matrix is obtained by finding the faces on the underlying surface which have…

A Brownian loop is a random walk circuit of infinitely many, suitably infinitesimal, steps. In a plane such a loop may or may not enclose a marked point, the origin, say. If it does so it may wind arbitrarily many times, positive or…

We prove that the linearly edge reinforced random walk (LRRW) on any graph with bounded degrees is recurrent for sufficiently small initial weights. In contrast, we show that for non-amenable graphs the LRRW is transient for sufficiently…

We show that Brownian motion of a one-dimensional domain wall in a large but finite system yields a $\omega^{-3/2}$ power spectrum. This is successfully applied to the totally asymmetric simple exclusion process (TASEP) with open…

In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on the other, is extended to the setting of general planar directed…

We consider directed weighted graphs and define various families of path counting functions. Our main results are explicit formulas for the main term of the asymptotic growth rate of these counting functions, under some irrationality…

The paper develops the general theory for the items in the title, assuming that the matrix is countable and cofinal.

A Random walk labeling of a graph $G$ is any labeling of $G$ that could have been obtained by performing a random walk on $G$. Continuing two recent works, we calculate the number of random walk labelings of perfect trees, combs, and double…

A matrix random walk is a stochastic process of the form $B_k = (I+A_1)\cdots(I+A_k)$ where $A_j$ are independent ``step'' matrices in $\mathrm{M}_N(\mathbb{C})$. With the right entry-covariance, a rescaled matrix random walk converges to…

We review results on linearly edge-reinforced random walks. On finite graphs, the process has the same distribution as a mixture of reversible Markov chains. This has applications in Bayesian statistics and it has been used in studying the…

A cyclic random walk is a random walk whose transition probabilities/rates can be written as a superposition of the empirical measures of a family of finite cycles. This identifies a convex set of models. We discuss the problem of…

We present recent results about the asymptotic behavior of ergodic products of isometries of a metric space X. If we assume that the displacement is integrable, then either there is a sublinear diffusion or there is, for almost every…

This paper introduces a group-theoretic framework to analyze the algebraic structure of the Grover walk on a complete graph with self-loops. We construct a group generated by the Grover matrix and a diagonal matrix whose entries are powers…

We argue that the most conservative geometric extension of Einstein gravity describing both positive and negative mass sources and observers is bimetric gravity and contains two copies of standard model matter which interact only…

When random walks on a square lattice are biased horizontally to move solely to the right, the probability distribution of their algebraic area can be exactly obtained. We explicitly map this biased classical random system on a non…

Differentially positive systems are the nonlinear systems whose linearization along trajectories preserves a cone field on a smooth Riemannian manifold. One of the embryonic forms for cone fields in reality is originated from the general…

We show that the "twisted" planar random walk - which results by summing up stationary increments rotated by multiples of a fixed angle - is recurrent under diverse assumptions on the increment process. For example, if the increment process…

We present a new approach of topology biased random walks for undirected networks. We focus on a one parameter family of biases and by using a formal analogy with perturbation theory in quantum mechanics we investigate the features of…

We consider the zeros of the partition function of the Ising model with ferromagnetic pair interactions and complex external field. Under the assumption that the graph with strictly positive interactions is connected, we vary the…

A short proof of the equivalence of the recurrence of non-backtracking random walk and that of simple random walk on regular infinite graphs is given. It is then shown how this proof can be extended in certain cases where the graph in…