Related papers: Splitting chains, tunnels and twisted sums

We consider the problem of uniformly generating a spanning tree, of a connected undirected graph. This process is useful to compute statistics, namely for phylogenetic trees. We describe a Markov chain for producing these trees. For cycle…

We consider Fell bundles over discrete groups, and the C*-algebra which is universal for representations of the bundle. We define deformations of Fell bundles, which are new Fell bundles with the same underlying Banach bundle but with the…

We construct a fractured structure, in the sense of Lurie, on the $\infty$-topos of condensed anima. This fractured structure allows us to better comprehend various properties of condensed anima - we use it to exhibit an explicit collection…

We study the asymptotic nature of geometric structures formed from a point cloud of observations of (generally heavy tailed) distributions in a Euclidean space of dimension greater than one. A typical example is given by the Betti numbers…

We exhibit a characteristic structure of the class of all regular graphs of degree d that stems from the spectra of their adjacency matrices. The structure has a fractal threadlike appearance. Points with coordinates given by the mean and…

We study random subgraphs of an arbitrary finite connected transitive graph $\mathbb G$ obtained by independently deleting edges with probability $1-p$. Let $V$ be the number of vertices in $\mathbb G$, and let $\Omega$ be their degree. We…

We endow projective (resp. direct) limits of Banach tensor structures with Fr\'{e}chet (resp. convenient) structures and study adapted connections to $G$-structures in both frameworks. This situation is illustrated by a lot of examples.

The cardinal invariants $ \mathfrak h, \mathfrak b, \mathfrak s$ of $\mathcal P (\omega)$ are known to satisfy that $\omega_1 \leq \mathfrak h \leq\min\{\mathfrak b, \mathfrak s\}$. We prove that all inequalities can be strict. We also…

We characterize those classes $\ccc$ of separable Banach spaces admitting a separable universal space $Y$ (that is, a space $Y$ containing, up to isomorphism, all members of $\ccc$) which is not universal for all separable Banach spaces.…

We call a singularity of a presymplectic form $\omega$ removable in its graph if its graph extends to a smooth Dirac structure over the singularity. An example for this is the symplectic form of a magnetic monopole. A criterion for the…

Metacirculants are a rich resource of many families of interesting graphs, and weak metacirculants are generalizations of them. A graph is called a {\em split weak metacirculant} if it has a vertex-transitive split metacyclic automorphism…

The contour of a family of filters along a filter is a set-theoretic lower limit. Topologicity and regularity of convergences can be characterized with the aid of the contour operation. Contour inversion is studied, in particular, for…

In magnetic fields applied parallel to the anisotropy axis, the relaxation of the magnetization of Mn$_{12}$ measured for different sweep rates is shown to collapse onto a single scaled curve. The form of the scaling implies that the…

In this paper we consider a random partition of the plane into cells, the partition being based on the nodes and links of a {\it random planar geometric graph}. The resulting structure generalises the \emph{random \tes}\ hitherto studied in…

We consider the probability that a spanning tree chosen uniformly at random from a graph can be partitioned into a fixed number $k$ of trees of equal size by removing $k-1$ edges. In that case, the spanning tree is called {\em splittable}.…

We study some questions concerning the structure of the set of spreading models of a separable infinite-dimensional Banach space $X$. In particular we give an example of a reflexive $X$ so that all spreading models of $X$ contain $\ell_1$…

Split networks are a popular tool for the analysis and visualization of complex evolutionary histories. Every collection of splits (bipartitions) of a finite set can be represented by a split network. Here we characterize which collection…

We initiate the study of mixing times of Markov chain under monotone censoring. Suppose we have some Markov Chain $M$ on a state space $\Omega$ with stationary distribution $\pi$ and a monotone set $A \subset \Omega$. We consider the chain…

We establish splitter theorems for graph immersions for two families of graphs, $k$-edge-connected graphs, with $k$ even, and 3-edge-connected, internally 4-edge-connected graphs. As a corollary, we prove that every $3$-edge-connected,…

Let $G=(V, E)$ be a planar graph and let $\mathcal{C}$ be a partition of $V$. We refer to the graphs induced by the vertex sets in $\mathcal{C}$ as Clusters. Let $D_{\mathcal C}$ be an arrangement of disks with a bijection between the disks…