Related papers: Invariant monotone coupling need not exist
In this paper, we give an alternative proof of the fact that, when compounding a nonnegative probability distribution, convex ordering between the distributions of the number of summands implies convex ordering between the resulting…
The contents are divided into two papers "The Monotone Cumulants" (arXiv:0907.4896) and "Conditionally monotone independence" (arXiv:0907.5473).
Random walk on changing graphs is considered. For sequences of finite graphs increasing monotonically towards a limiting infinite graph, we establish transition probability upper bounds. It yields sufficient transience criteria for simple…
We define a $\mathbb{Z}_2$-valued invariant for transversely-intersecting coassociative $4$-folds equipped with spin structures. Our main result shows this invariant provides an obstruction to separating two such coassociatives through a…
We prove that every homogeneous flow on a finite-volume homogeneous manifold has countably many independent invariant distributions unless it is conjugate to a linear flow on a torus. We also prove that the same conclusion holds for every…
We consider a simple model for active random walk with general temporal correlations, and investigate the shape of the probability distribution function of the displacement during a short time interval. We find that under certain conditions…
A Cayley graph is said to be an NNN-graph if it is both normal and non-normal for isomorphic regular groups, and a group has the NNN-property if there exists an NNN-graph for it. In this paper we investigate the NNN-property of cyclic…
The internal state of a cell in a coupled cell network is often described by an element of a vector space. Synchrony or anti-synchrony occurs when some of the cells are in the same or the opposite state. Subspaces of the state space…
We define link and graph invariants from entropic magmas modeling them on the Kauffman bracket and Tutte polynomial. We define the homology of entropic magmas. We also consider groups that can be assigned to the families of compatible…
A map is given showing that convolutions of independent random variables over a finite group and matrix multiplications of doubly stochastic matrices are homomorphic. As an application, a short proof is given to the theorem that the…
A knot diagram has an associated looped interlacement graph, obtained from the intersection graph of the Gauss diagram by attaching loops to the vertices that correspond to negative crossings. This construction suggests an extension of the…
In the theory of line graphs of undirected graphs there exists an important theorem linking the incidence matrix of the root graph to the adjacency matrix of its line graph. For directed or mixed graphs, however, the exists no analogous…
We study a random dynamical system such that one transformation is randomly selected from a family of transformations and then applied on each iteration. For such random dynamical systems, we consider estimates of absolutely continuous…
The $c_2$-invariant is an arithmetic graph invariant useful for understanding Feynman periods. Brown and Schnetz conjectured that the $c_2$-invariant has a particular symmetry known as completion invariance. This paper will prove completion…
Planar locally finite graphs which are almost vertex transitive are discussed. If the graph is 3-connected and has at most one end then the group of automorphisms is a planar discontinuous group and its structure is well-known. A general…
In this article, we consider involutions, called togglings, on the set of independent sets of the Dynkin diagram of type A, or a path graph. We are interested in the action of the subgroup of the symmetric group of the set of independent…
We establish maximal trees and graphs for the difference of average distance and proximity proving thus the corresponding conjecture posed in [4]. We also establish maximal trees for the difference of average eccentricity and remoteness and…
In an $\mathsf{L}$-embedding of a graph, each vertex is represented by an $\mathsf{L}$-segment, and two segments intersect each other if and only if the corresponding vertices are adjacent in the graph. If the corner of each…
A graph may be the Kronecker cover in more than one way. In this note we explore this phenomenon. Using this approach we show that the least common cover of two graphs need not be unique.
It is known that the number of biquandle colorings of a long virtual knot diagram, with a fixed color of the initial arc, is a knot invariant. In this paper we describe a more subtle invariant: a family of biquandle endomorphisms obtained…