English
Related papers

Related papers: Internal DLA on cylinder graphs: fluctuations and …

200 papers

We prove that the the mixing time of the Glauber dynamics for sampling independent sets on $n$-vertex $k$-uniform hypergraphs is $O(n\log n)$ when the maximum degree $\Delta$ satisfies $\Delta \leq c 2^{k/2}$, improving on the previous…

Probability · Mathematics 2019-12-25 Jonathan Hermon , Allan Sly , Yumeng Zhang

The avalanche mixing of granular solids in a slowly rotated 2D upright drum is studied. We demonstrate that the account of the difference $\delta$ between the angle of marginal stability and the angle of repose of the granular material…

Statistical Mechanics · Physics 2009-10-31 S. N. Dorogovtsev , J. F. F. Mendes

We show that the total variation mixing time of the simple random walk on the giant component of supercritical Erdos-Renyi graphs is log^2 n. This statement was only recently proved, independently, by Fountoulakis and Reed. Our proof…

Probability · Mathematics 2016-08-02 Itai Benjamini , Gady Kozma , Nicholas Wormald

It is becoming more and more clear that complex networks present remarkable large fluctuations. These fluctuations may manifest differently according to the given model. In this paper we re-consider hidden variable models which turn out to…

Disordered Systems and Neural Networks · Physics 2014-02-19 Massimo Ostilli

The evolution of many stochastic systems is accurately described by random walks on graphs. We here explore the close connection between local steady-state fluctuations of random walks and the global structure of the underlying graph.…

Statistical Mechanics · Physics 2022-10-25 M. Bruderer

We study the random walk on a finite dihedral group $G$ driven by the uniform measure on $k$ independently and uniformly chosen elements. We show that the walk exhibits cutoff with high probability throughout nearly the entire regime $1 \ll…

Probability · Mathematics 2025-10-24 Xiangying Huang , Renyu Rao

We study the mixing time of the averaging process on a large random $d$-regular graph, $d\ge 3$, and prove an $L^2$-cutoff with an explicit cutoff time. Somewhat surprisingly, we uncover a phase transition at the finite, fixed degree…

Probability · Mathematics 2026-03-03 Pietro Caputo , Matteo Quattropani , Federico Sau

In this work we introduce a mixture of GPs to address the data association problem, i.e. to label a group of observations according to the sources that generated them. Unlike several previously proposed GP mixtures, the novel mixture has…

Machine Learning · Statistics 2011-08-18 Miguel Lázaro-Gredilla , Steven Van Vaerenbergh , Neil Lawrence

Here we study the problem of sampling random proper colorings of a bounded degree graph. Let $k$ be the number of colors and let $d$ be the maximum degree. In 1999, Vigoda showed that the Glauber dynamics is rapidly mixing for any $k >…

Data Structures and Algorithms · Computer Science 2018-06-08 Sitan Chen , Ankur Moitra

We consider a synchronous process of particles moving on the vertices of a graph $G$, introduced by Cooper, McDowell, Radzik, Rivera and Shiraga (2018). Initially, $M$ particles are placed on a vertex of $G$. In subsequent time steps, all…

Probability · Mathematics 2024-04-25 Umberto De Ambroggio , Tamás Makai , Konstantinos Panagiotou , Annika Steibel

We study the asymptotic behavior for large $N$ of the disconnection time $T_N$ of a simple random walk on the discrete cylinder $(\mathbb{Z}/N\mathbb{Z})^d\times\mathbb{Z}$, when $d\ge2$. We explore its connection with the model of random…

Probability · Mathematics 2009-09-25 Alain-Sol Sznitman

In a coalescing random walk, a set of particles make independent random walks on a graph. Whenever one or more particles meet at a vertex, they unite to form a single particle, which then continues the random walk through the graph.…

Data Structures and Algorithms · Computer Science 2016-12-28 Colin Cooper , Robert Elsasser , Hirotaka Ono , Tomasz Radzik

The mixing time of a graph is an important metric, which is not only useful in analyzing connectivity and expansion properties of the network, but also serves as a key parameter in designing efficient algorithms. We present an efficient…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-10-19 Anisur Rahaman Molla , Gopal Pandurangan

We establish rapid mixing of the random-cluster Glauber dynamics on random $\Delta$-regular graphs for all $q\ge 1$ and $p<p_u(q,\Delta)$, where the threshold $p_u(q,\Delta)$ corresponds to a uniqueness/non-uniqueness phase transition for…

Probability · Mathematics 2021-05-05 Antonio Blanca , Reza Gheissari

Several models based on the diffusion-limited aggregation (DLA) model were proposed and their scaling properties explored by computational and theoretical approaches. In this paper, we consider a new extension of the on-lattice DLA model in…

Statistical Mechanics · Physics 2009-11-10 S. C. Ferreira

We investigate fluctuations in the average speed or current of a self-interacting diffusion (SID) on a ring, mimicking the non-Markovian behaviour of an agent influenced by its own path. We derive the SID's phase diagram, showing a…

Statistical Mechanics · Physics 2024-12-16 Francesco Coghi

We determine the asymptotics of the independence number of the random $d$-regular graph for all $d \ge d_0$. It is highly concentrated, with constant-order fluctuations around $n\alpha_* - c_*\log n$ for explicit constants $\alpha_*(d)$ and…

Probability · Mathematics 2013-10-18 Jian Ding , Allan Sly , Nike Sun

We study the local dynamical fluctuations in glass-forming models of particles embedded in $d$-dimensional space, in the mean-field limit of $d\to\infty$. Our analytical calculation reveals that single-particle observables, such as squared…

Disordered Systems and Neural Networks · Physics 2022-04-27 Giulio Biroli , Patrick Charbonneau , Giampaolo Folena , Yi Hu , Francesco Zamponi

The Diffusion-Limited Cluster-Cluster Aggregation (DLCA) model is modified by including cluster deformations using the {\it bond fluctuation} algorithm. From 3$d$ computer simulations, it is shown that, below a given threshold value $c_g$…

Condensed Matter · Physics 2009-10-28 R. Jullien , A. Hasmy

We prove an optimal $\Omega(n^{-1})$ lower bound on the spectral gap of Glauber dynamics for anti-ferromagnetic two-spin systems with $n$ vertices in the tree uniqueness regime. This spectral gap holds for all, including unbounded, maximum…

Data Structures and Algorithms · Computer Science 2021-11-22 Xiaoyu Chen , Weiming Feng , Yitong Yin , Xinyuan Zhang
‹ Prev 1 3 4 5 6 7 10 Next ›