Asymptotic Analysis of a Random Walk on a Hypercube with Many Dimensions

No abstract is available for this paper.

• Publication year

  1990

• Venue

  Random Struct. Algorithms

• Publication date

  1990-03-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1002/RSA.3240010105
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Some sample path properties of a random walk on the cube

  1989cited by this paper
• Mixing rates for a random walk on the cube

  1987cited by this paper
• Time to reach stationarity in the Bernoulli-Laplace diffusion model

  1987cited by this paper
• SHUFFLING CARDS AND STOPPING-TIMES

  1986cited by this paper
• Minimization Algorithms and Random Walk on the $d$-Cube

  1983cited by this paper
• Formulas and Theorems for the Special Functions of Mathematical Physics

  1967cited by this paper
• Handbook of Mathematical Functions.

  1966cited by this paper
• Stationary Phase with Neighboring Critical Points

  1959cited by this paper
• An Introduction to Probability Theory and Its Applications

  1959cited by this paper
• On the Approach to Statistical Equilibrium

  1949cited by this paper
• Random Walk and the Theory of Brownian Motion

  1947cited by this paper

• Brownian motion on reflection quantum groups. Construction and cutoff

  2026cites this paper
• Zero-temperature dynamics of Ising systems on hypercubes.

  2025cites this paper
• Cut-off phenomenon and asymptotic mixing for multivariate general linear processes

  2025cites this paper
• Every cutoff profile is possible

  2025cites this paper
• Cover time of random subgraphs of the hypercube

  2025cites this paper
• A curiously slowly mixing Markov chain

  2025cites this paper
• Late-time saturation of black hole complexity

  2025cites this paper
• Dynamics of pseudoentanglement

  2024influential citation
• Brownian Motion on the Unitary Quantum Group: Construction and Cutoff

  2024influential citation
• Limit Profile for the Transpose Top-2 with Random Shuffle

  2024influential citation
• Game Dynamics and Equilibrium Computation in the Population Protocol Model

  2023cites this paper
• Cutoff Ergodicity Bounds in Wasserstein Distance for a Viscous Energy Shell Model with Lévy Noise

  2023cites this paper
• Graph curvature via resistance distance

  2023cites this paper
• Disentangling Abstraction from Statistical Pattern Matching in Human and Machine Learning

  2022cites this paper
• Limit profiles for projections of random walks on groups

  2022cites this paper
• Waiting Times for Ties in Random Competitions

  2021cites this paper
• Self‐avoiding walk on the hypercube

  2021cites this paper
• Fast mixing of a randomized shift-register Markov chain

  2021cites this paper
• Quantum Walk on the Generalized Birkhoff Polytope Graph

  2021cites this paper
• Quantum mechanics for probabilists

  2021cites this paper
• The cutoff phenomenon for the stochastic heat and wave equation subject to small Lévy noise

  2021cites this paper
• The cutoff phenomenon in total variation for nonlinear Langevin systems with small layered stable noise

  2020cites this paper
• Regular Expression Length via Arithmetic Formula Complexity

  2020cites this paper
• Cutoff Thermalization for Ornstein–Uhlenbeck Systems with Small Lévy Noise in the Wasserstein Distance

  2020cites this paper
• Three steps mixing for general random walks on the hypercube at criticality

  2020cites this paper
• Random Walks on Clifford Algebras as Directed Hypercubes

  2020influential citation
• Mixing times and cutoffs in open quadratic fermionic systems

  2020cites this paper
• Limit profiles for reversible Markov chains

  2020cites this paper
• A Class of Random Walks on the Hypercube

  2020cites this paper
• A phase transition for repeated averages

  2020cites this paper
• Limit Profiles for Markov Chains

  2020cites this paper
• Sandpiles on the Square Lattice

  2019cites this paper
• Geometric bounds for the eigenvalues

  2018cites this paper
• Gray Codes Generation Algorithm and Theoretical Evaluation of Random Walks in N-Cubes

  2018cites this paper
• 2 5 D ec 2 01 7 The Query Complexity of Correlated Equilibria ∗ †

  2018cites this paper
• Stopping Times of Random Walks on a Hypercube

  2017cites this paper
• Sandpiles on the Square Lattice

  2017cites this paper
• Cutoff estimates for the linearized Becker???D??ring equations

  2017cites this paper
• Rationality and Randomness

  2017cites this paper
• Rationality and Randomness ( extended abstract )

  2017cites this paper
• PERSI DIACONIS

  2017cites this paper
• SPARSE RANDOM GRAPHS Structure & Dynamics

  2017cites this paper
• A Perron–Frobenius Type of Theorem for Quantum Operations

  2017cites this paper
• Cutoff estimates for the Becker-Döring equations

  2016cites this paper
• A Schur-Weyl Duality Approach toWalking on Cubes

  2016cites this paper
• Concentration and compression over infinite alphabets, mixing times of random walks on random graphs

  2016cites this paper
• Query Complexity of Approximate Nash Equilibria

  2016cites this paper
• Mathematical foundations of antibody affinity maturation

  2016cites this paper
• Stochastic modelling in molecular biology : a probabilistic analysis of protein polymerisation and telomere shortening

  2016cites this paper
• Random walk-based algorithms on networks

  2015cites this paper
• MIXING OF FINITE GEOMETRIC RANDOM WALKS AND THE CUTOFF PHENOMENON

  2015cites this paper
• Spectral statistics of Bernoulli matrix ensembles—a random walk approach (I)

  2015influential citation
• Mixing and cut-off in cycle walks

  2015cites this paper
• A non-local random walk on the hypercube

  2015cites this paper
• Analysis of large unreliable stochastic networks

  2015cites this paper
• The Cutoff profile for the Simple-Exclusion process on the circle

  2015cites this paper
• Random walks on binary strings applied to the somatic hypermutation of B-cells.

  2015cites this paper
• Random walk on sparse random digraphs

  2015cites this paper
• Universality of cutoff for the ising model

  2014cites this paper
• Space-time information percolation for the stochastic Ising model

  2014cites this paper
• Cutoff phenomenon for random walks on Kneser graphs

  2014cites this paper
• Information percolation and cutoff for the stochastic Ising model

  2014cites this paper
• Cutoff for the Noisy Voter Model

  2014cites this paper
• A Schur-Weyl Duality Approach toWalking on Cubes

  2014cites this paper
• Information percolation for the Ising model: cutoff in three dimensions up to criticality

  2014cites this paper
• PR ] 2 O ct 2 01 3 Bounds for left and right window cutoffs Dedicated to the memory of Béatrice Lachaud

  2013cites this paper
• The Query Complexity of Correlated Equilibria

  2013cites this paper
• Looking through the cutoff window

  2013cites this paper
• Parallel rotor walks on finite graphs and applications in discrete load balancing

  2013cites this paper
• Bayesian structural phylogenetics

  2013cites this paper
• Bounds for left and right window cutos

  2013cites this paper
• Query complexity of approximate nash equilibria

  2013cites this paper
• The cutoff phenomenon for random birth and death chains

  2012cites this paper
• Beyond Good Partition Shapes: An Analysis of Diffusive Graph Partitioning

  2012cites this paper
• Spectral Graph Theory to appear in Handbook of Linear Algebra , second edition , CCR

  2012cites this paper
• Distribution of the sum-of-digits function of random integers: A survey

  2012cites this paper
• Cutoff for General Spin Systems with Arbitrary Boundary Conditions

  2012cites this paper
• Entropy-Driven Cutoff Phenomena

  2012cites this paper
• Entropy-Driven Cutoff Phenomena

  2011cites this paper
• The Mathematics of Mixing Things Up

  2011cites this paper
• Randomized diffusion for indivisible loads

  2011cites this paper
• Exact Solution for a Class of Random Walk on the Hypercube

  2011cites this paper
• On the Transient Behavior of Ehrenfest and Engset Processes

  2011cites this paper
• A probabilistic proof of cutoff in the Metropolis algorithm for the Erdős-Rényi random graph

  2011influential citation
• Quasirandom load balancing

  2010cites this paper
• Dynamic random walks in Clifford algebras

  2010cites this paper
• Tight bounds for the cover time of multiple random walks

  2009cites this paper
• Optimal Coadapted Coupling for a Random Walk on the Hyper-Complete Graph

  2009cites this paper
• Abrupt Convergence and Escape Behavior for Birth and Death Chains

  2009cites this paper
• Cutoff time based on generalized divergence measure

  2009cites this paper
• The expected number of inversions after n adjacent transpositions

  2009cites this paper
• Uniformity of the uncovered set of random walk and cutoff for lamplighter chains

  2009cites this paper
• Finite Gelfand pairs: examples and applications

  2009cites this paper
• Coupling-cutoffs for random walks on the hypercube

  2008influential citation
• OPTIMAL CO-ADAPTED COUPLING FOR THE SYMMETRIC

  2008cites this paper
• Optimal Co-Adapted Coupling for the Symmetric Random Walk on the Hypercube

  2008influential citation
• Sampling stable marriages: why spouse-swapping won't work

  2008cites this paper
• Universality in two-dimensional enhancement percolation

  2008cites this paper
• Limit theorems for radial random walks on homogeneous spaces with growing dimensions

  2008cites this paper
• Numerical Evidence for Cutoffs in Chaotic Microfluidic Mixing

  2008cites this paper