Related papers: Efficient approximation of branching random walk G…
The continuous random energy model (CREM) is a toy model of disordered systems introduced by Bovier and Kurkova in 2004 based on previous work by Derrida and Spohn in the 80s. In a recent paper by Addario-Berry and Maillard, they raised the…
The continuous random energy model (CREM) is a toy model of spin glasses on $\{0,1\}^N$ that, in the limit, exhibits an infinitely hierarchical correlation structure. We give two polynomial-time algorithms to approximately sample from the…
We consider a specific random graph which serves as a disordered medium for a particle performing biased random walk. Take a two-sided infinite horizontal ladder and pick a random spanning tree with a certain edge weight $c$ for the…
We prove an algorithmic hardness result for finding low-energy states in the so-called \emph{continuous random energy model (CREM)}, introduced by Bovier and Kurkova in 2004 as an extension of Derrida's \emph{generalized random energy…
Consider the supercritical branching random walk on the real line in the boundary case and the associated Gibbs measure $\nu_{n,\beta}$ on the $n^\text{th}$ generation, which is also the polymer measure on a disordered tree with inverse…
The Random Walk Pinning Model (RWPM) is a statistical mechanics model in which the trajectory of a continuous time random walk $X=(X_t)_{t\geq 0}$ is rewarded according to the time it spends together with a moving catalyst. More…
We study the random energy model with a hierarchical structure known as the generalized random energy model (GREM). In contrast to the original analysis by the microcanonical ensemble formalism, we investigate the GREM by the canonical…
We introduce an exactly-solvable model of random walk in random environment that we call the Beta RWRE. This is a random walk in $\mathbb{Z}$ which performs nearest neighbour jumps with transition probabilities drawn according to the Beta…
The Gibbs sampler (a.k.a. Glauber dynamics and heat-bath algorithm) is a popular Markov Chain Monte Carlo algorithm which iteratively samples from the conditional distributions of a probability measure $\pi$ of interest. Under the…
We study random walk with adaptive move strategies on a class of directed graphs with variable wiring diagram. The graphs are grown from the evolution rules compatible with the dynamics of the world-wide Web [Tadi\'c, Physica A {\bf 293},…
Markov chain Monte Carlo methods such as Gibbs sampling and simple forms of the Metropolis algorithm typically move about the distribution being sampled via a random walk. For the complex, high-dimensional distributions commonly encountered…
Chen [Ann. Appl. Probab. {\bf 11} (2001), 1242--1262] derived exact convergence rates in a central limit theorem and a local limit theorem for a supercritical branching Wiener process.We extend Chen's results to a branching random walk…
This article investigates the question of disorder relevance for the continuous-time Random Walk Pinning Model (RWPM) and completes the results of our companion paper. The RWPM considers a continuous time random walk $X=(X_t)_{t\geq 0}$,…
Quantum Gibbs state sampling algorithms generally suffer from either scaling exponentially with system size or requiring specific knowledge of spectral properties \textit{a priori}. Also, these algorithms require a large overhead of bath or…
We study a random walk pinning model, where conditioned on a simple random walk Y on Z^d acting as a random medium, the path measure of a second independent simple random walk X up to time t is Gibbs transformed with Hamiltonian -L_t(X,Y),…
This article considers a class of disordered mean-field combinatorial optimization problems. We focus on the Gibbs measure, where the inverse temperature does not vary with the size of the graph and the edge weights are sampled from a…
The exponential random graph model (ERGM) is a central object in the study of clustering properties in social networks as well as canonical ensembles in statistical physics. Despite some breakthrough works in the mathematical understanding…
We study a generalization of the model introduced by Kistler and Schmidt in $2015$, that interpolates between the random energy model (REM) and the branching random walk (BRW). More precisely, we are interested in the asymptotic behaviour…
Random walk centrality is a fundamental metric in graph mining for quantifying node importance and influence, defined as the weighted average of hitting times to a node from all other nodes. Despite its ability to capture rich graph…
Energy-based models (EBMs) are generative models inspired by statistical physics with a wide range of applications in unsupervised learning. Their performance is best measured by the cross-entropy (CE) of the model distribution relative to…