English
Related papers

Related papers: Mixing Time on the Kagome Lattice

200 papers

We are interested in quasi-stationarity and quasi-ergodicity when the absorbing boundary is moving. First we show that, in the moving boundary case, the quasi-stationary distribution and the quasi-limiting distribution are not well-defined…

Probability · Mathematics 2019-11-25 William Oçafrain

We study perturbation theory and uniform ergodicity for discrete-time Markov chains on general state spaces in terms of the uniform moments of the first hitting times on some set. The methods we adopt are different from previous ones. For…

Probability · Mathematics 2020-03-17 Yonghua Mao , Yanhong Song

Let $\mathcal{S}_n$ be the permutation group on $n$ elements, and consider a random walk on $\mathcal{S}_n$ whose step distribution is uniform on $k$-cycles. We prove a well-known conjecture that the mixing time of this process is…

Probability · Mathematics 2016-08-14 Nathanaël Berestycki , Oded Schramm , Ofer Zeitouni

In this paper, we propose a new Markov chain which generalizes random-to-random shuffling on permutations to random-to-random shuffling on linear extensions of a finite poset of size $n$. We conjecture that the second largest eigenvalue of…

Probability · Mathematics 2017-03-01 Arvind Ayyer , Anne Schilling , Nicolas M. Thiéry

Here we discuss optimization of mixing in finite linear and circular Rudner-Levitov lattices, i.e., Su-Schrieffer-Heeger lattices with a dissipative sublattice. We show that presence of exceptional points in the systems spectra can lead to…

Quantum Physics · Physics 2023-09-06 I. Peshko , M. Antsukh , D. Novitsky , D. Mogilevtsev

It was recently proposed in https://journals.aps.org/pre/abstract/10.1103/PhysRevE.94.043322 [Herdeiro & Doyon Phys.,Rev.,E (2016)] a numerical method showing a precise sampling of the infinite plane 2d critical Ising model for finite…

Statistical Mechanics · Physics 2017-07-19 Victor Herdeiro

Many applications in networked control require intermittent access of a controller to a system, as in event-triggered systems or information constrained control applications. Motivated by such applications and extending previous work on…

Probability · Mathematics 2015-04-30 Ramiro Zurkowski , Serdar Yüksel , Tamás Linder

The main subject of the study in this paper is the simultaneous renewal time for two time-inhomogeneous Markov chains which start with arbitrary initial distributions. By a simultaneous renewal we mean the first time of joint hitting the…

Probability · Mathematics 2020-01-09 Vitaliy Golomoziy

We study the mixing time of the Rook's Walk Markov chain on a $d$-dimensional chess board of side length $n\geq 3$, where a rook moves by first selecting an axis uniformly at random and then selecting a new position along that axis…

Probability · Mathematics 2026-04-10 Jonatan Kaare-Rasmussen

The collective behavior of interacting magnetic moments can be strongly influenced by the topology of the underlying lattice. In geometrically frustrated spin systems, interesting chiral correlations may develop that are related to the spin…

Strongly Correlated Electrons · Physics 2007-05-23 D. Grohol , K. Matan , J. H. Cho , S. -H. Lee , J. W. Lynn , D. G. Nocera , Y. S. Lee

We study tilings of the plane composed of two repeating tiles of different assigned areas relative to an arbitrary periodic lattice. We classify isoperimetric configurations (i.e., configurations with minimal length of the interfaces) both…

Metric Geometry · Mathematics 2025-08-26 Francesco Nobili , Matteo Novaga , Emanuele Paolini

Given a finite graph G, a vertex of the lamplighter graph consists of a zero-one labeling of the vertices of G, and a marked vertex of G. For transitive graphs G, we show that, up to constants, the relaxation time for simple random walk in…

Probability · Mathematics 2007-05-23 Yuval Peres , David Revelle

We investigate the local times of a continuous-time Markov chain on an arbitrary discrete state space. For fixed finite range of the Markov chain, we derive an explicit formula for the joint density of all local times on the range, at any…

Probability · Mathematics 2007-05-23 D. Brydges , R. van der Hofstad , W. Konig

What can one say on convergence to stationarity of a finite state Markov chain that behaves "locally" like a nearest neighbor random walk on ${\mathbb Z}$ ? The model we consider is a version of nearest neighbor lazy random walk on the…

Probability · Mathematics 2014-10-31 Iddo Ben-Ari , Hugo Panzo , Elizabeth Tripp

We extend our previous study of Markov chains on finite commutative rings (arXiv:1605.05089) to arbitrary finite rings with identity. At each step, we either add or multiply by a randomly chosen element of the ring, where the addition…

Representation Theory · Mathematics 2019-01-15 Arvind Ayyer , Pooja Singla

We address the problem of estimating the mixing time of a Markov chain from a single trajectory of observations. Unlike most previous works which employed Hilbert space methods to estimate spectral gaps, we opt for an approach based on…

Probability · Mathematics 2023-09-13 Geoffrey Wolfer

The site percolation problem is studied on d-dimensional generalisations of the Kagome' lattice. These lattices are isotropic and have the same coordination number q as the hyper-cubic lattices in d dimensions, namely q=2d. The site…

Statistical Mechanics · Physics 2009-10-31 Steven C. van der Marck

We investigate the ground-state phase diagram of the Kondo lattice model with classical localized spins on triangular-to-kagome lattices by using a variational calculation. We identify the parameter regions where a four-sublattice…

Strongly Correlated Electrons · Physics 2015-06-05 Yutaka Akagi , Yukitoshi Motome

Lattices that can be represented in a kagome-like form are shown to satisfy a universal percolation criticality condition, expressed as a relation between P_3, the probability that all three vertices in the triangle connect, and P_0, the…

Disordered Systems and Neural Networks · Physics 2009-11-13 Robert M. Ziff , Hang Gu

Let $G$ be a finite group. The commuting chain on $G$ moves from an element $x$ to $y$ by selecting $y$ uniformly amongst those which commute with $x$. The $t$ step transition probabilities of this chain converge to a distribution uniform…

Probability · Mathematics 2020-10-19 John Rahmani