Related papers: Mixing Time on the Kagome Lattice
The kagome lattice, with its inherent frustration, hosts a plethora of exotic phenomena, including the emergence of $3\mathbf{q}$ charge density wave order. The high rotational symmetry, required to realize such an unconventional charge…
We introduce quantum versions of the $\chi^2$-divergence, provide a detailed analysis of their properties, and apply them in the investigation of mixing times of quantum Markov processes. An approach similar to the one presented in [1-3]…
We prove that Broder's Markov chain for approximate sampling near-perfect and perfect matchings is not rapidly mixing for Hamiltonian, regular, threshold and planar bipartite graphs, filling a gap in the literature. In the second part we…
We consider Markovian models on graphs with local dynamics. We show that, under suitable conditions, such Markov chains exhibit both rapid convergence to equilibrium and strong concentration of measure in the stationary distribution. We…
We study the mixing time of random graphs in the $d$-dimensional toric unit cube $[0,1]^d$ generated by the geographical threshold graph (GTG) model, a generalization of random geometric graphs (RGG). In a GTG, nodes are distributed in a…
Spontaneous symmetry breaking-the phenomenon where an infinitesimal perturbation can cause the system to break the underlying symmetry-is a cornerstone concept in the understanding of interacting solid-state systems. In a typical series of…
In this paper, we consider two time-inhomogeneous Markov chains $X^{(l)}_t$, $l\in\{1,2\}$, with discrete time on a general state space. We assume the existence of some renewal set $C$ and investigate the time of simultaneous renewal, that…
We give a simple formula for the looping rate of loop-erased random walk on a finite planar graph. The looping rate is closely related to the expected amount of sand in a recurrent sandpile on the graph. The looping rate formula is…
We analyze the absolute spectral gap of Markov chains on graphs obtained from a cycle of $n$ vertices and perturbed only at approximately $n^{1/\rho}$ random locations with an appropriate, possibly sparse, interconnection structure.…
This work focuses on time-inhomogeneous Markov chains with two time scales. Our motivations stem from applications in reliability and dependability, queueing networks, financial engineering and manufacturing systems, where two-time-scale…
Time-homogeneous Markov chains are often used as disease progression models in studies of cost-effectiveness and optimal decision-making. Maximum likelihood estimation of these models can be challenging when data are collected at a time…
In this work, we focus on the stationary analysis of a specific class of continuous time Markov-modulated reflected random walks in the quarter plane with applications in the modelling of two-node Markov-modulated queueing networks with…
This paper will provide several classes of strictly stationary, countable-state, irreducible, aperiodic Markov chains that are reversible and have finite second moments, such that the central limit theorem fails to hold. The main purpose is…
The hitting and mixing times are two fundamental quantities associated with Markov chains. In Peres and Sousi[PS2015] and Oliveira[Oli2012], the authors show that the mixing times and "worst-case" hitting times of reversible Markov chains…
A joint degree matrix (JDM) specifies the number of connections between nodes of given degrees in a graph, for all degree pairs and uniquely determines the degree sequence of the graph. We consider the space of all balanced realizations of…
The kagome lattice is a paragon of geometrical frustration, long-studied for its association with novel ground-states including spin liquids (SLs). Many recently synthesized kagome materials feature rare-earth ions, which may be expected to…
We study the percolation critical surface of the kagome lattice in which each triangle is allowed an arbitrary connectivity. Using the method of critical polynomials, we find points along this critical surface to high precision. This kagome…
Let $(X_t)$ be a discrete time Markov chain on a general state space. It is well-known that if $(X_t)$ is aperiodic and satisfies a drift and minorization condition, then it converges to its stationary distribution $\pi$ at an exponential…
We obtain a perfect sampling characterization of weak ergodicity for backward products of finite stochastic matrices, and equivalently, simultaneous tail triviality of the corresponding nonhomogeneous Markov chains. Applying these ideas to…
We consider irreducible Markov chains on a finite state space. We show that the mixing time of any such chain is equivalent to the maximum, over initial states $x$ and moving large sets $(A_s)_s$, of the hitting time of $(A_s)_s$ starting…