Related papers: Higher walks and squares

We derive a perturbation expansion for general self-interacting random walks, where steps are made on the basis of the history of the path. Examples of models where this expansion applies are reinforced random walk, excited random walk, the…

We give examples of $n$-sequentially compact spaces that are not $(n+1)$-sequentially compact under several assumptions. We improve results from Kubis and Szeptycki by building such examples from $\mathfrak{b=c}$ and…

We make and generalize the observation that summing of probability amplitudes of a discrete-time quantum walk over partitions of the walking graph consistent with the step operator results in a unitary evolution on the reduced graph which…

We prove a result concerning elementary embeddings of the set-theoretic universe into itself (Reinhardt embeddings) and functions on ordinals that "eventually dominate" such embeddings. We apply that result to show the existence of…

We prove an invariance principle for continuous-time random walks in a dynamically averaging environment on $\mathbb Z$. In the beginning, the conductances may fluctuate substantially, but we assume that as time proceeds, the fluctuations…

This survey is concerned with random walks on mapping class groups. We illustrate how the actions of mapping class groups on Teichm\"uller spaces or curve complexes reveal the nature of random walks, and vice versa. Our emphasis is on the…

A graph $H$ is \emph{common} if the number of monochromatic copies of $H$ in a 2-edge-colouring of the complete graph $K_n$ is asymptotically minimised by the random colouring, or equivalently, $t_H(W)+t_H(1-W)\geq 2^{1-e(H)}$ holds for…

The goal of these notes is to fill some gaps in the literature about random walks in the Cauchy domain of attraction, which has been in many cases left aside because of its additional technical difficulties. We prove here several results in…

Random paths are time continuous interpolations of random walks. By using Littelmann path model, we associate to each irreducible highest weight module of a Kac Moody algebra g a random path W. Under suitable hypotheses, we make explicit…

Using Mazur's theorem on torsions of elliptic curves, an upper bound 24 for the order of the finite Galois group $\mathcal{H}$ associated with weighted walks in the quarter plane $\mathbb{Z}^2_+$ is obtained. The explicit criterion for…

We prove a variant of a formula due to S. Zhang relating the Beilinson-Bloch height of the Gross-Schoen cycle on a pointed curve with the self-intersection of its relative dualizing sheaf. In our approach the height of the Gross-Schoen…

We have recently proposed a two-dimensional quantum walk where the requirement of a higher dimensionality of the coin space is substituted with the alternance of the directions in which the walker can move [C. Di Franco, M. Mc Gettrick, and…

Consider a discrete-time quantum walk on the $N$-cycle subject to decoherence both on the coin and the position degrees of freedom. By examining the evolution of the density matrix of the system, we derive some new conclusions about the…

We develop walk-on-sphere for fractional Poisson equations with Dirichilet boundary conditions in high dimensions. The walk-on-sphere method is based on probabilistic represen tation of the fractional Poisson equation. We propose effcient…

In this article we obtain new expressions for the generating functions counting (non-singular) walks with small steps in the quarter plane. Those are given in terms of infinite series, while in the literature, the standard expressions use…

Recently, it has been shown that one-dimensional quantum walks can mix more quickly than classical random walks, suggesting that quantum Monte Carlo algorithms can outperform their classical counterparts. We study two quantum walks on the…

Humans excel at robust bipedal walking in complex natural environments. In each step, they adequately tune the interaction of biomechanical muscle dynamics and neuronal signals to be robust against uncertainties in ground conditions.…

As recently pointed out, regularization schemes defined in four-dimensions may also face inconsistencies in the presence of chiral fermions. In this work, we extend this analysis to two-loop order. Adopting the implicit regularization as…

We propose high-order hypergraph walks as a framework to generalize graph-based network science techniques to hypergraphs. Edge incidence in hypergraphs is quantitative, yielding hypergraph walks with both length and width. Graph methods…

Continuous time quantum walks on exponentially large, sparse graphs form a powerful paradigm for quantum computing: On the one hand, they can be efficiently simulated on a quantum computer. On the other hand, they are themselves…