Results 91 to 100 of about 69,347 (192)
Expanderizing Higher‐Order Random Walks
ABSTRACT We study a variant of the down‐up (also known as the Glauber dynamics) and up‐down walks over an n$$ n $$‐partite simplicial complex, which we call expanderized higher‐order random walks—where the sequence of updated coordinates corresponds to the sequence of vertices visited by a random walk over an auxiliary expander graph H$$ H $$. When H$$
Vedat Levi Alev, Shravas Rao
wiley +1 more source
Integer colorings with forbidden rainbow sums
For a set of positive integers $A \subseteq [n]$, an $r$-coloring of $A$ is rainbow sum-free if it contains no rainbow Schur triple. In this paper we initiate the study of the rainbow Erd\H{o}s-Rothchild problem in the context of sum-free sets, which ...
Cheng, Yangyang +4 more
core
(Random) Trees of Intermediate Volume Growth
ABSTRACT For every function g:ℝ≥0→ℝ≥0$$ g:{\mathbb{R}}_{\ge 0}\to {\mathbb{R}}_{\ge 0} $$ that grows at least linearly and at most exponentially, if it is sufficiently well‐behaved, we can construct a tree T$$ T $$ of uniform volume growth g$$ g $$, or more precisely, C1·g(r/4)≤|BG(v,r)|≤C2·g(4r),for allr≥0andv∈V(T),$$ {C}_1\cdotp g\left(r/4\right)\le \
George Kontogeorgiou, Martin Winter
wiley +1 more source
On Constrained Matchings, Stable Under Random Preferences
ABSTRACT Colloquially, there are two groups, n$$ n $$ men and n$$ n $$ women, each man (woman) ranking women (men) as potential marriage partners. A complete matching is called stable if no unmatched pair prefer each other to their partners in the matching.
Boris Pittel
wiley +1 more source
ABSTRACT A finite group G$$ G $$ is mixable if a product of random elements, each chosen independently from two options, can distribute uniformly on G$$ G $$. We present conditions and obstructions to mixability. We show that 2‐groups, the symmetric groups, the simple alternating groups, several matrix and sporadic simple groups, and most finite ...
Gideon Amir +3 more
wiley +1 more source
Fast and Slow Mixing of the Kawasaki Dynamics on Bounded‐Degree Graphs
ABSTRACT We study the worst‐case mixing time of the global Kawasaki dynamics for the fixed‐magnetization Ising model on the class of graphs of maximum degree Δ$$ \Delta $$. Proving a conjecture of Carlson, Davies, Kolla, and Perkins, we show that below the tree‐uniqueness threshold, the Kawasaki dynamics mix rapidly for all magnetizations. Disproving a
Aiya Kuchukova +3 more
wiley +1 more source
The shift‐homological spectrum and parametrising kernels of rank functions
Abstract For any compactly generated triangulated category, we introduce two topological spaces, the shift spectrum and the shift‐homological spectrum. We use them to parametrise a family of thick subcategories of the compact objects, which we call radical.
Isaac Bird +2 more
wiley +1 more source
Real models for the framed little n$n$‐disks operads
Abstract We study the action of the orthogonal group on the little n$n$‐disks operads. As an application we provide small models (over the reals) for the framed little n$n$‐disks operads. It follows in particular that the framed little n$n$‐disks operads are formal (over the reals) for n$n$ even and coformal for all n$n$.
Anton Khoroshkin, Thomas Willwacher
wiley +1 more source
Embedding large subgraphs into dense graphs
What conditions ensure that a graph G contains some given spanning subgraph H? The most famous examples of results of this kind are probably Dirac's theorem on Hamilton cycles and Tutte's theorem on perfect matchings. Perfect matchings are generalized by
Kühn, Daniela, Osthus, Deryk
core +1 more source
Algebras, Graphs and Ordered Sets - ALGOS 2020 & the Mathematical Contributions of Maurice Pouzet. [PDF]
Couceiro M, Duffus D.
europepmc +1 more source

