相关论文: Loop-erased walks and total positivity
We consider a random partition of the vertex set of an arbitrary graph that can be sampled using loop-erased random walks stopped at a random independent exponential time of parameter $q>0$, that we see as a tuning parameter.The related…
We study the set of probability distributions visited by a continuous-time quantum walk on graphs. An edge-weighted graph G is universal mixing if the instantaneous or average probability distribution of the quantum walk on G ranges over…
We first present a comprehensive review of various random walk metrics used in the literature and express them in a consistent framework. We then introduce fundamental tensor -- a generalization of the well-known fundamental matrix -- and…
Loop-weighted walk with parameter $\lambda\geq 0$ is a non-Markovian model of random walks that is related to the loop $O(N)$ model of statistical mechanics. A walk receives weight $\lambda^{k}$ if it contains $k$ loops; whether this is a…
The dynamics of linear positive systems map the positive orthant to itself. In other words, it maps a set of vectors with zero sign variations to itself. This raises the following question: what linear systems map the set of vectors with…
We consider two natural models of random walks on a module $V$ over a finite commutative ring $R$ driven simultaneously by addition of random elements in $V$, and multiplication by random elements in $R$. In the coin-toss walk, either one…
We consider Delone sets with finite local complexity. We characterize validity of a subadditive ergodic theorem by uniform positivity of certain weights. The latter can be considered to be an averaged version of linear repetitivity. In this…
We consider a single Brownian particle in a spatially symmetric, periodic system far from thermal equilibrium. This setup can be readily realized experimentally. Upon application of an external static force F, the average particle velocity…
As an image of the many-to-one map of loop-erasing operation $\LE$ of random walks, a self-avoiding walk (SAW) is obtained. The loop-erased random walk (LERW) model is the statistical ensemble of SAWs such that the weight of each SAW…
The "loop equations" of random matrix theory are a hierarchy of equations born of attempts to obtain explicit formulae for generating functions of map enumeration problems. These equations, originating in the physics of 2-dimensional…
This paper gives the quantum walks determined by graph zeta functions. The result enables us to obtain the characteristic polynomial of the transition matrix of the quantum walk, and it determines the behavior of the quantum walk. We treat…
We investigate the one-loop renormalization group evolution in four dimensions of the leading operators in the effective field theories of shift-symmetric scalars, photons, and gravitons. We show that certain non-minimal three-point…
We review the general relativistic theory of the motion, and of the timing, of binary systems containing compact objects (neutron stars or black holes). Then we indicate the various ways one can use binary pulsar data to test the…
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…
Planar run-and-tumble walks with orthogonal directions of motion are considered. After formulating the problem with generic transition probabilities among the orientational states, we focus on the symmetric case, giving general expressions…
We prove a general noncommutative law of large numbers. This applies in particular to random walks on any locally finite homogeneous graph, as well as to Brownian motion on Riemannian manifolds which admit a compact quotient. It also…
To a given nonsingular triangular matrix A with entries from a ring, we associate a weighted bipartite graph G(A) and give a combinatorial description of the inverse of A by employing paths in G(A). Under a certain condition, nonsingular…
Matrix-based centrality measures have enjoyed significant popularity in network analysis, in no small part due to our ability to rigorously analyze their behavior as parameters vary. Recent work has considered the relationship between…
Random walks in cones have the double interest of being at the heart of many probabilistic problems and of being related to many mathematical fields, such as spectral theory, combinatorics, or discrete complex analysis. In this article, we…
Simple random walks on a partially directed version of $\mathbb{Z}^2$ are considered. More precisely, vertical edges between neighbouring vertices of $\mathbb{Z}^2$ can be traversed in both directions (they are undirected) while horizontal…