English
Related papers

Related papers: Generalized solution for the Herman Protocol Conje…

200 papers

We study Hamiltonicity in random subgraphs of the hypercube $\mathcal{Q}^n$. Our first main theorem is an optimal hitting time result. Consider the random process which includes the edges of $\mathcal{Q}^n$ according to a uniformly chosen…

Combinatorics · Mathematics 2022-08-16 Padraig Condon , Alberto Espuny Díaz , António Girão , Daniela Kühn , Deryk Osthus

Chaotic behavior of quantum systems can be characterized by the adherence of the expectation values of given probes to moments of the Haar distribution. In this work, we analyze the behavior of several probes of chaos using a technique…

Quantum Physics · Physics 2026-04-14 Stefano Cusumano , Gianluca Esposito , Alioscia Hamma

We investigate leader election problem via ranking within self-stabilising population protocols. In this scenario, the agent's state space comprises $n$ rank states and $x$ extra states. The initial configuration of $n$ agents consists of…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-05-06 Leszek Gąsieniec , Tytus Grodzicki , Grzegorz Stachowiak

Let $X$ be the constrained random walk on ${\mathbb Z}_+^2$ taking the steps $(1,0)$, $(-1,1)$ and $(0,-1)$ with probabilities $\lambda < (\mu_1\neq \mu_2)$; in particular, $X$ is assumed stable. Let $\tau_n$ be the first time $X$ hits…

Probability · Mathematics 2018-01-16 Ali Devin Sezer

The population protocol model is a computational model for passive mobile agents. We address the leader election problem, which determines a unique leader on arbitrary communication graphs starting from any configuration. Unfortunately,…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-11-10 Haruki Kanaya , Ryota Eguchi , Taisho Sasada , Michiko Inoue

We study the problem of how to coordinate the actions of independent agents in a distributed system where message arrival times are unbounded, but are determined by an exponential probability distribution. Asynchronous protocols executed in…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-11-10 Ariel Livshits , Yoram Moses

This article relaxes the integrability condition imposed in the literature for the robust $\alpha$-stable central limit theorem under sublinear expectation. Specifically, for $\alpha \in(0,1]$, we prove that the normalized sums of i.i.d.…

Probability · Mathematics 2023-01-20 Lianzi Jiang , Gechun Liang

The relaxation of out-of-time-ordered correlators (OTOCs) has been studied as a mean to characterize the scrambling properties of a quantum system. We show that the presence of local conserved quantities typically results in, at the…

Statistical Mechanics · Physics 2021-09-22 Vinitha Balachandran , Giuliano Benenti , Giulio Casati , Dario Poletti

The eigenstate thermalization hypothesis (ETH), which asserts that every eigenstate of a many-body quantum system is indistinguishable from a thermal ensemble, plays a pivotal role in understanding thermalization of isolated quantum…

Statistical Mechanics · Physics 2025-05-27 Shoki Sugimoto , Ryusuke Hamazaki , Masahito Ueda

We consider a one-dimensional stationary stochastic process $x(\tau)$ of duration $T$. We study the probability density function (PDF) $P(t_{\rm m}|T)$ of the time $t_{\rm m}$ at which $x(\tau)$ reaches its global maximum. By using a path…

Statistical Mechanics · Physics 2021-10-15 Francesco Mori , Satya N. Majumdar , Gregory Schehr

If we prepare an isolated, interacting quantum system in an eigenstate and perturb a local observable at an initial time, its expectation value will relax towards a thermal expectation value, even though the time evolution of the system is…

Quantum Physics · Physics 2024-06-04 Tobias Helbig , Tobias Hofmann , Ronny Thomale , Martin Greiter

For an orientation $H$ with $n$ vertices, let $T(H)$ denote the maximum possible number of labeled copies of $H$ in an $n$-vertex tournament. It is easily seen that $T(H) \ge n!/2^{e(H)}$ as the latter is the expected number of such copies…

Combinatorics · Mathematics 2015-11-25 Raphael Yuster

When a system deviates from equilibrium, it is possible to manipulate and control it to drive it towards equilibrium within a finite time $t_f$, even reducing its natural relaxation time scale $\tau_{relax}$. Although numerous theoretical…

Statistical Mechanics · Physics 2024-02-26 Diego Rengifo , Gabriel Téllez

We analyze a class of distributed quantized consensus algorithms for arbitrary static networks. In the initial setting, each node in the network has an integer value. Nodes exchange their current estimate of the mean value in the network,…

Systems and Control · Computer Science 2016-11-18 Shang Shang , Paul Cuff , Pan Hui , Sanjeev Kulkarni

Assuming that a reflected Ornstein-Uhlenbeck state process is observed at discrete time instants, we propose generalized moment estimators to estimate all drift and diffusion parameters via the celebrated ergodic theorem. With the sampling…

Statistics Theory · Mathematics 2020-09-14 Yaozhong Hu , Yuejuan Xi

The eigenvalues of quantum chaotic systems have been conjectured to follow, in the large energy limit, the statistical distribution of eigenvalues of random ensembles of matrices of size $N\rightarrow\infty$. Here we provide semiclassical…

Chaotic Dynamics · Physics 2011-12-07 P. Leboeuf , A. G. Monastra

We derive optimal-order homogenization rates for random nonlinear elliptic PDEs with monotone nonlinearity in the uniformly elliptic case. More precisely, for a random monotone operator on $\mathbb{R}^d$ with stationary law (i.e. spatially…

Analysis of PDEs · Mathematics 2021-01-01 Julian Fischer , Stefan Neukamm

In this paper, we propose a dynamical systems perspective of the Expectation-Maximization (EM) algorithm. More precisely, we can analyze the EM algorithm as a nonlinear state-space dynamical system. The EM algorithm is widely adopted for…

Optimization and Control · Mathematics 2018-10-05 Orlando Romero , Sarthak Chatterjee , Sérgio Pequito

We analyze a simple random process in which a token is moved in the interval $A=\{0,...,n\$: Fix a probability distribution $\mu$ over $\{1,...,n\$. Initially, the token is placed in a random position in $A$. In round $t$, a random value…

Data Structures and Algorithms · Computer Science 2008-02-21 Martin Dietzfelbinger , Jonathan E. Rowe , Ingo Wegener , Philipp Woelfel

The generic behavior of quantum systems has long been of theoretical and practical interest. Any quantum process is represented by a sequence of quantum channels. We consider general ergodic sequences of stochastic channels with arbitrary…

Quantum Physics · Physics 2022-07-08 Ramis Movassagh , Jeffrey Schenker