Results 41 to 50 of about 1,701 (164)
Expanderizing Higher‐Order Random Walks
Random Structures &Algorithms, Volume 67, Issue 4, December 2025.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
(Random) Trees of Intermediate Volume Growth
Random Structures &Algorithms, Volume 67, Issue 4, December 2025.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
Random Structures &Algorithms, Volume 67, Issue 4, December 2025.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
Random Structures &Algorithms, Volume 67, Issue 4, December 2025.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
Random Structures &Algorithms, Volume 67, Issue 4, December 2025.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
Combinatorial optimization approach for the efficient reuse of RC components
Structural Concrete, Volume 26, Issue 6, Page 7180-7203, December 2025.Abstract The reuse of reinforced concrete (RC) components from deconstructed buildings offers a promising approach to reduce the environmental impact of new constructions. However, it represents a complex combinatorial optimization problem to efficiently place the available modules, which vary in geometry and load‐bearing capacity, into new structures ...
Jannis Rose +4 more
wiley +1 more source
Markov's conjecture on integral necklaces
Bulletin of the London Mathematical Society, Volume 57, Issue 12, Page 4122-4131, December 2025.Abstract We use the geometric reformulation of Markov's uniqueness conjecture in terms of the simple length spectrum of the modular torus to rewrite the conjecture in combinatorial terms by explicitly describing this set of lengths.
David Fisac
wiley +1 more source
Curves of best approximation on wonderful varieties
Bulletin of the London Mathematical Society, Volume 57, Issue 12, Page 3941-3948, December 2025.Abstract We give an unconditional proof of the Coba conjecture for wonderful compactifications of adjoint type for semisimple Lie groups of type An$A_n$. We also give a proof of a slightly weaker conjecture for wonderful compactifications of adjoint type for arbitrary Lie groups.
Christopher Manon +2 more
wiley +1 more source
Polarization and Gorenstein liaison
Journal of the London Mathematical Society, Volume 112, Issue 6, December 2025.Abstract A major open question in the theory of Gorenstein liaison is whether or not every arithmetically Cohen–Macaulay subscheme of Pn$\mathbb {P}^n$ can be G‐linked to a complete intersection. Migliore and Nagel showed that if such a scheme is generically Gorenstein (e.g., reduced), then, after re‐embedding so that it is viewed as a subscheme of Pn ...
Sara Faridi +3 more
wiley +1 more source
The shift‐homological spectrum and parametrising kernels of rank functions
Journal of the London Mathematical Society, Volume 112, Issue 6, December 2025.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