Related papers: Discrete harmonic polynomials in multidimensional …
While discrete harmonic functions have been objects of interest for quite some time, this is not the case for discrete polyharmonic functions, as appear for instance in the asymptotics of path counting problems. In this article, a novel…
We point out a connection between fusion coefficients and random walks in a fixed level alcove associated to the root system of an affine Lie algebra and use this connection to solve completely the Dirichlet problem on such an alcove for a…
We prove existence of partitions of an open set $\Omega$ with a given number of phases, which minimize the sum of the fractional perimeters of all the phases, with Dirichlet boundary conditions. In two dimensions we show that, if the…
We investigate random walks in independent, identically distributed random sceneries under the assumption that the scenery variables satisfy Cramer's condition. We prove moderate deviation principles in dimensions two and larger, covering…
We look at random walks in Dirichlet environment. It was known that in dimension $d\geq 3$, if the walk is sub-ballistic, the displacement of the walk is polynomial of order $\kappa$ for some explicit $\kappa$. We show that the walk, after…
We consider multidimensional discrete valued random walks with nonzero drift killed when leaving general cones of the euclidian space. We find the asymptotics for the exit time from the cone and study weak convergence of the process…
In this paper we study a random walk in a one-dimensional dynamic random environment consisting of a collection of independent particles performing simple symmetric random walks in a Poisson equilibrium with density $\rho \in (0,\infty)$.…
We consider a walker that at each step keeps the same direction with a probabilitythat depends on the time already spent in the direction the walker is currently moving. In this paper, we study some asymptotic properties of this persistent…
We experimentally study the fundamental problem of computing the volume of a convex polytope given as an intersection of linear inequalities. We implement and evaluate practical randomized algorithms for accurately approximating the…
We study the evolution of a random walker on a conservative dynamic random environment composed of independent particles performing simple symmetric random walks, generalizing results of [16] to higher dimensions and more general transition…
We consider convex hulls of random walks whose steps belong to the domain of attraction of a stable law in $\mathbb{R}^d$. We prove convergence of the convex hull in the space of all convex and compact subsets of $\mathbb{R}^d$, equipped…
We show the existence of rigid combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, $t$-designs, and $t$-wise…
The motion of a domain wall in a two dimensional medium is studied taking into account the internal elastic degrees of freedom of the wall and geometrical pinning produced both by holes and sample boundaries. This study is used to analyze…
We focus on two models of nearest-neighbour random walks on d-dimensional regular hyper-cubic lattices that are usually assumed to be identical - the discrete-time Polya walk, in which the walker steps at each integer moment of time, and…
We consider open quantum walks on a graph, and consider the random variables defined as the passage time and number of visits to a given point of the graph. We study in particular the probability that the passage time is finite, the…
We study the topological dynamics of the action of the diagonal subgroup on quotients Gamma\PSL(2,R)*PSL(2,R), where Gamma is an irreducible lattice. Closed orbits are described and a set of points of dense orbit is explicitly given. Such…
We consider discrete-time nearest-neighbor quantum walks on random environments in one dimension. Using the method based on a path counting, we present both quenched and annealed weak limit theorems for the quantum walk.
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 introduce a novel operator to describe a random walk process on a simplicial complex. Walkers are allowed to wonder across simplices of various dimensions, bridging nodes to edges, and edges to triangles, via a nested organization that…
The $m$-symmetric Macdonald polynomials form a basis of the space of polynomials that are symmetric in the variables $x_{m+1},x_{m+2},\dots$ (while having no special symmetry in the variables $x_1,\dots,x_m$).We establish in this article…