Related papers: Random walks and the colored Jones function
We study near-alternating links whose diagrams satisfy conditions generalized from the notion of semi-adequate links. We extend many of the results known for adequate knots relating their colored Jones polynomials to the topology of…
We determine a connection between the weight of a Boolean function and the total weight of its first-order derivatives. The relationship established is used to study some cryptographic properties of Boolean functions. We establish a…
This work develops a methodical approach to counting of walks on cartesian products, biproducts, symmetric and exterior powers and bipowers, Schur operations, coverings and semicoverings of weighted graphs. For weight and root lattices of…
Motivated by the study of ribbon knots we explore symmetric unions, a beautiful construction introduced by Kinoshita and Terasaka in 1957. For symmetric diagrams we develop a two-variable refinement $W_D(s,t)$ of the Jones polynomial that…
We solve the Jones conjecture, which states that the exponent sum in a minimal braid representation of a knot in S^3 is a knot invariant, by proving a generalized version of the original one. We apply contact geometry to study this problem…
We continue our study of the degree of the colored Jones polynomial under knot cabling started in "Knot Cabling and the Degree of the Colored Jones Polynomial" (arXiv:1501.01574). Under certain hypothesis on this degree, we determine how…
We present a surprisingly new connection between two well-studied combinatorial classes: rooted connected chord diagrams on one hand, and rooted bridgeless combinatorial maps on the other hand. We describe a bijection between these two…
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…
We consider two notions describing how one finite graph may be larger than another. Using them, we prove several theorems for such pairs that compare the number of spanning trees, the return probabilities of random walks, and the number of…
We investigate the computational complexity of finding temporally disjoint paths or walks in temporal graphs. There, the edge set changes over discrete time steps and a temporal path (resp. walk) uses edges that appear at monotonically…
We give a series of combinatorial results that can be obtained from any two collections (both indexed by $\Z\times \N$) of left and right pointing arrows that satisfy some natural relationship. When applied to certain self-interacting…
We study generating functions of ordinary and plane partitions coloured by the action of a finite subgroup of the corresponding special linear group. After reviewing known results for the case of ordinary partitions, we formulate a…
A very simple expression is conjectured for arbitrary colored Jones and HOMFLY polynomials of a rich $(g+1)$-parametric family of Pretzel knots and links. The answer for the Jones and HOMFLY polynomials is fully and explicitly expressed…
Starting from a sequence regarded as a walk through some set of values, we consider the associated loop-erased walk as a sequence of directed edges, with an edge from $i$ to $j$ if the loop erased walk makes a step from $i$ to $j$. We…
We show that weighted path orders are special instances of a variant of semantic path orders. Exploiting this fact, we introduce a generalization of weighted path orders that goes beyond the realm of simple termination. Experimental data…
The Conway potential function (CPF) for colored links is a convenient version of the multi-variable Alexander-Conway polynomial. We give a skein characterization of CPF, much simpler than the one by Murakami. In particular, Conway's…
We present two path decompositions of Markov chains (with general state space) by means of harmonic functions, which are dual to each other. They can be seen as a generalization of Williams' decomposition of a Brownian motion with drift.…
The Kontsevich integral of a knot is a powerful invariant which takes values in an algebra of trivalent graphs with legs. Given a Lie algebra, the Kontsevich integral determines an invariant of knots (the so-called colored Jones function)…
A weight system is a function on chord diagrams that satisfies the so-called four-term relations. Vassiliev's theory of finite-order knot invariants describes these invariants in terms of weight systems. In particular, there is a weight…
Random walk based distributed algorithms make use of a token that circulates in the system according to a random walk scheme to achieve their goal. To study their efficiency and compare it to one of the deterministic solutions, one is led…