English
Related papers

Related papers: Hitting time of large subsets of the hypercube

200 papers

We consider simple random walk on a realization of an Erd\H{o}s-R\'enyi graph that is asymptotically almost surely (a.a.s.) connected. We show a Central Limit Theorem (CLT) for the average starting hitting time, i.e. the expected time it…

Probability · Mathematics 2020-03-31 Matthias Löwe , Sara Terveer

We study analytically the effect of temperature cyclings in mean-field spin-glasses. In accordance with real experiments, we obtain a strong reinitialization of the dynamics on decreasing the temperature combined with memory effects when…

Condensed Matter · Physics 2009-10-31 Leticia F. Cugliandolo , Jorge Kurchan

A very simple event frequency approximation algorithm that is sensitive to event timeliness is suggested. The algorithm iteratively updates categorical click-distribution, producing (path of) a random walk on a standard $n$-dimensional…

Numerical Analysis · Mathematics 2019-05-29 Alexander Kushkuley

We prove new results on lazy random walks on finite graphs. To start, we obtain new estimates on return probabilities $P^t(x,x)$ and the maximum expected hitting time $t_{\rm hit}$, both in terms of the relaxation time. We also prove a…

Probability · Mathematics 2018-07-19 Roberto I. Oliveira , Yuval Peres

We introduce a new toy model for the study of glasses: the hard-matrix model (HMM). This may be viewed as a single particle moving on $\mathrm{SO}(N)$, where there is a potential proportional to the 1-norm of the matrix. The ground states…

Statistical Mechanics · Physics 2021-08-03 J. Dong , V. Elser , G. Gyawali , K. Y. Jee , J. Kent-Dobias , A. Mandaiya , M. Renz , Y. Su

Aging in spin glasses (and in some other systems) reveals astonishing effects of `rejuvenation and memory' upon temperature changes. In this paper, we propose microscopic mechanisms (at the scale of spin-spin interactions) which can be at…

Disordered Systems and Neural Networks · Physics 2009-11-07 S. Miyashita , E. Vincent

The exact formula for the average hitting time (HT, as an abbreviation) of simple random walks from one vertex to any other vertex on the square $C^2_N$ of an $N$-vertex cycle graph $C_N$ was given by N. Chair [\textit{Journal of…

We consider the general branching random walk under minimal assumptions, which in particular guarantee that the empirical particle distribution admits an almost sure central limit theorem. For such a process, we study the large time decay…

Probability · Mathematics 2017-12-07 Oren Louidor , Eliad Tsairi

Random walk in random environment (RWRE) is a fundamental model of statistical mechanics, describing the movement of a particle in a highly disordered and inhomogeneous medium as a random walk with random jump probabilities. It has been…

Probability · Mathematics 2013-09-11 Alexander Drewitz , Alejandro F. Ramírez

The dynamics of the spins in the Ising model are analyzed using a virtual walk scenario. The system is quenched from a very high temperature to a lower one using the Glauber scheme in one and two dimensions. A walk is associated with each…

Statistical Mechanics · Physics 2026-03-11 Amit Pradhan , Parongama Sen , Sagnik Seth

It has been proved by Kempe that discrete quantum walks on the hypercube (HC) hit exponentially faster than the classical analog. The same was also observed numerically by Krovi and Brun for a slightly different property, namely, the…

Quantum Physics · Physics 2014-08-20 Adi Makmal , Manran Zhu , Daniel Manzano , Markus Tiersch , Hans J. Briegel

Glassy behavior is one of the main open problems in condensed matter physics. In this thesis, we approach the problem by studying spin-glasses and colloids, using several complementary strategies. From the point of view of model building,…

Disordered Systems and Neural Networks · Physics 2013-09-10 B. Seoane

Isothermal simulational data for the 3D Edwards-Anderson spin glass are collected at several temperatures below $T_{\rm c}$ and, in analogy with a recent model of dense colloidal suspensions,interpreted in terms of clusters of contiguous…

Statistical Mechanics · Physics 2018-08-15 Paolo Sibani , Stefan Boettcher

We prove that the empirical density of states of quantum spin glasses on arbitrary graphs converges to a normal distribution as long as the maximal degree is negligible compared with the total number of edges. This extends the recent…

Mathematical Physics · Physics 2016-10-25 László Erdős , Dominik Schröder

We construct a renewal structure for random walks on surface groups. The renewal times are defined as times when the random walks enters a particular type of a cone and never leaves it again. As a consequence, the trajectory of the random…

Probability · Mathematics 2016-09-16 Peter Haissinsky , Pierre Mathieu , Sebastian Mueller

We study the random walk on dynamical percolation of $\mathbb{Z}^d$ (resp., the two-dimensional triangular lattice $\mathcal{T}$), where each edge (resp., each site) can be either open or closed, refreshing its status at rate $\mu\in…

Probability · Mathematics 2024-11-01 Chenlin Gu , Jianping Jiang , Yuval Peres , Zhan Shi , Hao Wu , Fan Yang

Consider the dynamic environment governed by a Poissonian field of independent particles evolving as simple random walks on $\mathbb{Z}^d$. The random walk on random walks model refers to a particular stochastic process on $\mathbb{Z}^d$…

Probability · Mathematics 2024-11-22 Stein Andreas Bethuelsen , Florian Völlering

We consider the persistent exclusion process in which a set of persistent random walkers interact via hard-core exclusion on a hypercubic lattice in $d$ dimensions. We work within the ballistic regime whereby particles continue to hop in…

Statistical Mechanics · Physics 2020-11-23 Matthew J. Metson , Martin R. Evans , Richard A. Blythe

A characteristic feature of the non--equilibrium dynamics of real spin glasses at low temperatures are strong aging effects. These phenomena can be manipulated by changing the external parameters in various ways: a thermo-cycling experiment…

Condensed Matter · Physics 2009-10-22 Heiko Rieger

Random walks (or Markov chains) are models extensively used in theoretical computer science. Several tools, including analysis of quantities such as hitting and mixing times, are helpful for devising randomized algorithms. A notable example…

Quantum Physics · Physics 2023-07-12 Lorenzo Laneve , Francesco Tacchino , Ivano Tavernelli