Related papers: An introduction to higher walks
Higher Green functions are real-valued functions of two variables on the upper half plane which are bi-invariant under the action of a congruence subgroup, have logarithmic singularity along the diagonal, but instead of the usual equation…
Random walks on regular bounded degree expander graphs have numerous applications. A key property of these walks is that they converge rapidly to the uniform distribution on the vertices. The recent study of expansion of high dimensional…
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…
In physics, all dynamical equations that describe fundamental interactions are second order ordinary differential equations in the time derivatives. In the literature, this property is traced back to a result obtained by Ostrogradski in the…
We consider walks on a triangular domain that is a subset of the triangular lattice. We then specialise this by dividing the lattice into two directed sublattices with different weights. Our central result is an explicit formula for the…
Consider a randomly-oriented two dimensional Manhattan lattice where each horizontal line and each vertical line is assigned, once and for all, a random direction by flipping independent and identically distributed coins. A deterministic…
The involution walk is the random walk on $S_n$ generated by involutions with a binomially distributed with parameter $1-p$ number of $2$-cycles. This is a parallelization of the transposition walk. The involution walk is shown in this…
Two-dimensional (random) walks in cones are very natural both in combinatorics and probability theory: they are interesting for themselves and also because they are strongly related to other discrete structures. While walks restricted to…
In the last twenty years network science has proven its strength in modelling many real-world interacting systems as generic agents, the nodes, connected by pairwise edges. Yet, in many relevant cases, interactions are not pairwise but…
We interpret walks in the first quadrant with steps {(1,1),(1,0),(-1,0), (-1,-1)} as a generalization of Dyck words with two sets of letters. Using this language, we give a formal expression for the number of walks in the steps above…
We enumerate total cyclic orders on $\left\{1,\ldots,n\right\}$ where we prescribe the relative cyclic order of consecutive triples $(i,{i+1},{i+2})$, these integers being taken modulo $n$. In some cases, the problem reduces to the…
We define new higher-order Alexander modules $\mathcal{A}_n(C)$ and higher-order degrees $\delta_n(C)$ which are invariants of the algebraic planar curve $C$. These come from analyzing the module structure of the homology of certain…
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…
We initiate the study of Boolean function analysis on high-dimensional expanders. We give a random-walk based definition of high-dimensional expansion, which coincides with the earlier definition in terms of two-sided link expanders. Using…
A rotor configuration on a graph contains in every vertex an infinite ordered sequence of rotors, each is pointing to a neighbor of the vertex. After sampling a configuration according to some probability measure, a rotor walk is a…
The foundational work of Karlin and McGregor established a powerful connection between random walks with tridiagonal transition matrices and the theory of orthogonal polynomials. We consider a particular extension of this framework, where…
Although higher-order interactions are known to affect the typical state of dynamical processes giving rise to new collective behavior, how they drive the emergence of rare events and fluctuations is still an open problem. We investigate…
The theory of operads (May, cyclic, modular, PROPs, etc) is extended to include higher dimensional phenomena, i.e. operations between operations, mimicking the algebraic structure on varieties of arbitrary dimensions, having marked…
We build on recent work of Yeats, Courtiel, and others involving connected chord diagrams. We first derive from a Hopf-algebraic foundation a class of tree-like functional equations and prove that they are solved by weighted generating…
We consider the use of random walks as an approach to obtain connection coefficients for higher-order Bernoulli and Euler polynomials. In particular, we consider the cases of a $1$-dimensional linear reflected Brownian motion and of a…