Related papers: Invariant monotone coupling need not exist
For a finite undirected graph $G = (V,E)$, let $p_{u,v}(t)$ denote the probability that a continuous-time random walk starting at vertex $u$ is in $v$ at time $t$. In this note we give an example of a Cayley graph $G$ and two vertices $u,v…
In this paper we study the algebra of graph invariants, focusing mainly on the invariants of simple graphs. All other invariants, such as sorted eigenvalues, degree sequences and canonical permutations, belong to this algebra. In fact,…
Starting from a given topological invariant, we argue that it is possible to construct a topological field theory with a finite number of Feynman diagrams and an amplitude of gauge invariant objects that is a function of that invariant.…
We obtain sufficient conditions exlcuding the existence of non-trivial distribution sections of bundles over the boundary of symmetric spaces of negative curvature which are invariant with respect to a geometrically finite group of…
Motivated by circle graphs, and the enumeration of Euler circuits, we define a one-variable ``interlace polynomial'' for any graph. The polynomial satisfies a beautiful and unexpected reduction relation, quite different from the cut and…
Two non-isomorphic graphs are twins if each is isomorphic to a subgraph of the other. We prove that a rayless graph has either infinitely many twins or none.
A crossing-free straight-line drawing of a graph is monotone if there is a monotone path between any pair of vertices with respect to some direction. We show how to construct a monotone drawing of a tree with $n$ vertices on an $O(n^{1.5})…
Interactions of gauge-invariant systems are severely constrained by several consistency requirements. One is the preservation of the number of gauge symmetries, another is causal propagation. For lower-spin fields, the emphasis is usually…
This paper is devoted to study the topological invariance of several non-uniform hyperbolicity conditions of one-dimensional maps. In contrast with the case of maps with only one critical point, it is known that for maps with several…
Invariant manifolds are important sets arising in the stability theory of dynamical systems. In this article, we take a brief review of invariant sets. We provide some results regarding the existence of invariant lines and parabolas in…
We develop a bifurcation theory for infinite dimensional systems satisfying abstract hypotheses that are tailored for applications to mean field coupled chaotic maps. Our abstract theory can be applied to many cases, from globally coupled…
Non-commutative versions of Arveson's curvature invariant and Euler characteristic for a commuting $n$-tuple of operators are introduced. The non-commutative curvature invariant is sensitive enough to determine if an $n$-tuple is free. In…
A popular question in Bernoulli percolation models is if the probability of connection between two vertices in a transitive graph decays monotonically with the distance between these two vertices. For example, on the square lattice is an…
These notes concern aspects of various graphs whose vertex set is a group $G$ and whose edges reflect group structure in some way (so that they are invariant under the action of the automorphism group of $G$). The graphs I will discuss are…
Stochastic monotonicity is a well known partial order relation between probability measures defined on the same partially ordered set. Strassen Theorem establishes equivalence between stochastic monotonicity and the existence of a coupling…
Let $G$ be a finite non-abelian simple group, $C$ a non-identity conjugacy class of $G$, and $\Gamma_C$ the Cayley graph of $G$ based on $C \cup C^{-1}$. Our main result shows that in any such graph, there is an involution at bounded…
The partial sum of the states of a Markov chain or more generally a Markov source is asymptotically normally distributed under suitable conditions. One of these conditions is that the variance is unbounded. A simple combinatorial…
This note presents a simple proof of the monotonicity of the invariant distribution of a discrete Markov chain with a finite state space. This answers a question recently raised by David Siegmund.
A main question in graphical models and causal inference is whether, given a probability distribution $P$ (which is usually an underlying distribution of data), there is a graph (or graphs) to which $P$ is faithful. The main goal of this…
Symmetry is a cornerstone of much of mathematics, and many probability distributions possess symmetries characterized by their invariance to a collection of group actions. Thus, many mathematical and statistical methods rely on such…