English
Related papers

Related papers: The Coppersmith-Tetali-Winkler Identity for Mechan…

200 papers

In this paper we survey the theory of random walks on buildings and associated groups of Lie type and Kac-Moody groups. We begin with an introduction to the theory of Coxeter systems and buildings, taking a largely combinatorial…

Probability · Mathematics 2018-03-30 J. Parkinson

A discrete-time quantum walk on a graph is the repeated application of a unitary evolution operator to a Hilbert space corresponding to the graph. Hitting times for discrete quantum walks on graphs give an average time before the walk…

Quantum Physics · Physics 2007-11-13 Hari Krovi

Jacobi structures are known to generalize Poisson structures, encompassing symplectic, cosymplectic, and Lie-Poisson manifolds. Notably, other intriguing geometric structures -- such as contact and locally conformal symplectic manifolds --…

Differential Geometry · Mathematics 2025-03-17 Pingyuan Wei , Qiao Huang , Jinqiao Duan

The appearance of topological effects in systems exhibiting a non-trivial topological band structure strongly relies on the coherent wave nature of the equations of motion. Here, we reveal topological dynamics in a classical stochastic…

Quantum Physics · Physics 2018-03-08 G. Engelhardt , M. Benito , G. Platero , G. Schaller , T. Brandes

We develop a new approach to random walks on de Bruijn graphs over the alphabet $A$ through right congruences on $A^k$, defined using the natural right action of $A^+$. A major role is played by special right congruences, which correspond…

Group Theory · Mathematics 2016-07-08 John Rhodes , Anne Schilling , Pedro V. Silva

Let $H$ be a random $k$-uniform $n$-vertex hypergraph where every $k$-tuple belongs to $H$ independently with probability $p$. We show that for some $\varepsilon_k > 0$, if $p \geq n^{-\varepsilon_k}$, then asymptotically almost surely $H$…

Combinatorics · Mathematics 2017-11-07 Michael Simkin

We exhibit a close connection between hitting times of the simple random walk on a graph, the Wiener index, and related graph invariants. In the case of trees we obtain a simple identity relating hitting times to the Wiener index. It is…

Combinatorics · Mathematics 2015-12-15 Agelos Georgakopoulos , Stephan Wagner

For a symmetric random walk in $Z^2$ with $2+\delta$ moments, we represent $|\mathcal{R}(n)|$, the cardinality of the range, in terms of an expansion involving the renormalized intersection local times of a Brownian motion. We show that for…

Probability · Mathematics 2007-05-23 Richard F. Bass , Jay Rosen

We consider integer-valued random walks with independent but not identically distributed increments, and extend to this context several classical estimates, including a local limit theorem, precise small-ball estimates (both conditional on…

Probability · Mathematics 2025-11-13 Sébastien Ott , Yvan Velenik

In this paper we extend the geometric formalism of the Hamilton-Jacobi theory for time dependent Mechanics to the case of classical field theories in the k-cosymplectic framework.

Mathematical Physics · Physics 2013-07-22 M. de León , S. Vilariño

Quantum random walks, - coined, lattice ones, - exhibit ballistic behavior with fascinating asymptotic patterns of the amplitudes. We show that averaging over the coins (using the Haar measure), these patterns blend into a spline. Also, we…

Mathematical Physics · Physics 2021-08-11 Yuliy Baryshnikov

Recently, in [Class. Quantum Grav. 33 (2016) 045005], the authors proposed a new approach extending the framework of statistical mechanics to reparametrization-invariant systems with no additional gauges. In this work, the approach is…

General Relativity and Quantum Cosmology · Physics 2022-10-04 Goffredo Chirco , Thibaut Josset

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

Multifractal properties of the distribution of topological invariants for a model of trajectories randomly entangled with a nonsymmetric lattice of obstacles are investigated. Using the equivalence of the model to random walks on a locally…

Statistical Mechanics · Physics 2009-10-31 R. Voituriez , S. Nechaev

The rarely used Hamilton-Jacobi equation has been utilized as an elegant way to find the trajectories of mechanical systems and to derive symplectic maps. Further, the exact solution in kick approximation of Hamilton's equations of motion…

Accelerator Physics · Physics 2026-01-21 Stephan I. Tzenov

We consider a recurrent random walk of i.i.d. increments on the one-dimensional integer lattice and obtain a formula relating the hitting distribution of a half-line with the potential function, $a(x)$, of the random walk. Applying it, we…

Probability · Mathematics 2020-12-24 Kohei Uchiyama

In this paper, we are concerned with mean hitting time $\langle\mathcal{H}\rangle$ for random walks on recursive growth tree networks that are built based on an arbitrary tree as the seed via implementing various primitive graphic…

Combinatorics · Mathematics 2021-12-10 Fei Ma , Ping Wang

Consider a random three-coordinate lattice of spherical topology having 2v vertices and being densely covered by a single closed, self-avoiding walk, i.e. being equipped with a Hamiltonian cycle. We determine the number of such objects as a…

Statistical Mechanics · Physics 2009-10-31 B. Eynard , E. Guitter , C. Kristjansen

In this paper, we construct Hamilton-Jacobi equations for a great variety of mechanical systems (nonholonomic systems subjected to linear or affine constraints, dissipative systems subjected to external forces, time-dependent mechanical…

Mathematical Physics · Physics 2015-05-14 P. Balseiro , J. C. Marrero , D. Martin de Diego , E. Padron

Large unweighted directed graphs are commonly used to capture relations between entities. A fundamental problem in the analysis of such networks is to properly define the similarity or dissimilarity between any two vertices. Despite the…

Machine Learning · Statistics 2015-11-03 Tatsunori B. Hashimoto , Yi Sun , Tommi S. Jaakkola