English
Related papers

Related papers: Cutting and Shuffling a Line Segment: Mixing by In…

200 papers

The edge flipping is a non-reversible Markov chain on a given connected graph, which is defined by Chung and Graham in [CG12]. In the same paper, its eigenvalues and stationary distributions for some classes of graphs are identified. We…

Probability · Mathematics 2022-12-15 Yunus Emre Demirci , Ümit Işlak , Alperen Yaşar Özdemir

A model describing the three-dimensional folding of the triangular lattice on the face-centered cubic lattice is generalized allowing the presence of defects corresponding to cuts in the two-dimensional network. The model can be expressed…

Statistical Mechanics · Physics 2012-05-25 Emilio N. M. Cirillo , Alessandro Pelizzola , Giuseppe Gonnella

This paper explores the mixing time of the random transposition walk on permutations with one-sided interval restrictions. In particular, we're interested in the notion of cutoff, a phenomenon which occurs when mixing occurs in a window of…

Probability · Mathematics 2012-02-23 Olena Blumberg

Mixing of materials is fundamental to many natural phenomena and engineering applications. The presence of discontinuous deformations - such as shear banding or wall slip - creates new mechanisms for mixing and transport beyond those…

Chaotic Dynamics · Physics 2016-02-18 Lachlan D. Smith , Murray Rudman , Daniel R. Lester , Guy Metcalfe

We study numerically the depinning transition of driven elastic interfaces in a random-periodic medium with localized periodic-correlation peaks in the direction of motion. The analysis of the moving interface geometry reveals the existence…

Disordered Systems and Neural Networks · Physics 2010-10-20 S. Bustingorry , A. B. Kolton , T. Giamarchi

A flat sheet programmed with a planar pattern of spontaneous shape change will morph into a curved surface. Such metric mechanics is seen in growing biological sheets, and may be engineered in actuating soft matter sheets such as…

Soft Condensed Matter · Physics 2022-07-01 Fan Feng , Daniel Duffy , Mark Warner , John S. Biggins

In this work we investigate symmetry breaking in the presence of a turbulent environment. The transition from a symmetric state to a symmetry-breaking state is demonstrated using two examples: (i) the transition of a two-dimensional flow to…

We study partially linear models when the outcome of interest and some of the covariates are observed in two different datasets that cannot be linked. This type of data combination problem arises very frequently in empirical microeconomics.…

Econometrics · Economics 2023-08-23 Xavier D'Haultfœuille , Christophe Gaillac , Arnaud Maurel

We consider a moving interface that is coupled to an elliptic equation in a heterogeneous medium. The problem is motivated by the study of displacive solid-solid phase transformations. We show that a nearly flat interface is given by the…

Analysis of PDEs · Mathematics 2012-06-13 Patrick W. Dondl , Kaushik Bhattacharya

The fragmentation processes of exchangeable partitions have already been studied by several authors. In this paper, we examine rather fragmentation of exchangeable compositions, that means partitions of $\mathbb{N}$ where the order of the…

Probability · Mathematics 2007-05-23 Anne-Laure Basdevant

We performed a numerical study of the efficiency of mixing by alternating horizontal and vertical shear ``wedge'' flows on the two-dimensional torus. Our results suggest that except in cases where each individual flow is applied for only a…

Analysis of PDEs · Mathematics 2021-11-02 Li-Tien Cheng , Frederick Rajasekaran , Kin Yau James Wong , Andrej Zlatos

Bounding chains are a technique that offers three benefits to Markov chain practitioners: a theoretical bound on the mixing time of the chain under restricted conditions, experimental bounds on the mixing time of the chain that are provably…

Probability · Mathematics 2007-05-23 Mark Huber

How many shuffles are needed to mix up a deck of cards? This question may be answered in the language of a random walk on the symmetric group, $S_{52}$. This generalises neatly to the study of random walks on finite groups, themselves a…

Probability · Mathematics 2015-04-22 J. P. McCarthy

In four-dimensional symplectic maps complex instability of periodic orbits is possible, which cannot occur in the two-dimensional case. We investigate the transition from stable to complex unstable dynamics of a fixed point under parameter…

Chaotic Dynamics · Physics 2021-04-21 Jonas Stöber , Arnd Bäcker

The problem of efficiently sampling from a set of (undirected, or directed) graphs with a given degree sequence has many applications. One approach to this problem uses a simple Markov chain, which we call the switch chain, to perform the…

Discrete Mathematics · Computer Science 2017-09-13 Catherine Greenhill , Matteo Sfragara

In [Mas82] and [Vee78] it was proved independently that almost every interval exchange transformation is uniquely ergodic. The Birkhoff ergodic theorem implies that these maps mainly have uniformly distributed orbits. This raises the…

Number Theory · Mathematics 2018-02-14 Christian Weiß

Exchangeability -- in which the distribution of an infinite sequence is invariant to reorderings of its elements -- implies the existence of a simple conditional independence structure that may be leveraged in the design of statistical…

Statistics Theory · Mathematics 2022-07-25 Trevor Campbell , Saifuddin Syed , Chiao-Yu Yang , Michael I. Jordan , Tamara Broderick

We consider a finite field model of the X-ray transform that integrates functions along lines in dimension 3, within the context of finite fields. The admissibility problem asks for minimal sets of lines for which the restricted transform…

Combinatorics · Mathematics 2019-07-02 Eric L. Grinberg , Mehmet Orhon

We investigate the kinetics of nonlinear collision-induced fragmentation. We obtain the fragment mass distribution analytically by utilizing its travelling wave behavior. The system undergoes a shattering transition in which a finite…

Statistical Mechanics · Physics 2007-05-23 P. L. Krapivsky , E. Ben-Naim

We study the perfect matching reconfiguration problem: Given two perfect matchings of a graph, is there a sequence of flip operations that transforms one into the other? Here, a flip operation exchanges the edges in an alternating cycle of…

Data Structures and Algorithms · Computer Science 2019-04-15 Marthe Bonamy , Nicolas Bousquet , Marc Heinrich , Takehiro Ito , Yusuke Kobayashi , Arnaud Mary , Moritz Mühlenthaler , Kunihiro Wasa