English
Related papers

Related papers: Sampling from the random cluster model on random r…

200 papers

Markov chains in random environments (MCREs) have recently attracted renewed interest, as these processes naturally arise in many applications, such as econometrics and machine learning. Although specific asymptotic results, such as the law…

Probability · Mathematics 2025-09-22 Attila Lovas , Lionel Truquet

We consider the ferromagnetic $q$-state Potts model with zero external field in a finite volume and assume that the stochastic evolution of this system is described by a Glauber-type dynamics parametrized by the inverse temperature $\beta$.…

Probability · Mathematics 2018-12-21 Francesca R. Nardi , Alessandro Zocca

Thermodynamics of clusterized matter is studied in the framework of statistical models with non-interacting cluster degrees of freedom. At variance with the analytical Fisher model, exact Metropolis simulation results indicate that the…

Nuclear Theory · Physics 2009-09-01 Ad. R. Raduta , F. Gulminelli

We study dynamical aspects of the $q$-state Potts model on an $n\times n$ box at its critical $\beta_c(q)$. Heat-bath Glauber dynamics and cluster dynamics such as Swendsen--Wang (that circumvent low-temperature bottlenecks) are all…

Probability · Mathematics 2017-09-01 Reza Gheissari , Eyal Lubetzky

How a system initially at infinite temperature responds when suddenly placed at finite temperatures is a way to check the existence of phase transitions. It has been shown in [R. da Silva, IJMPC 2023] that phase transitions are imprinted in…

We have revisited the non-conserved (or model A) critical dynamics of the two-dimensional Ising model through numerical simulations of its lattice and continuum formulations --Glauber dynamics and the timedependent Ginzburg-Landau (TDGL)…

Statistical Mechanics · Physics 2025-12-02 Héctor Vaquero del Pino , Rodolfo Cuerno

We consider the stochastic Ising model on sparse Erdos-Renyi graphs $G(n,d/n)$ with $d>1$ at the critical temperature $\beta_c=\tanh^{-1}(d^{-1})$ and prove that with high probability, the mixing time is at most polynomial in $n$. Our…

Probability · Mathematics 2025-10-09 Kyprianos-Iason Prodromidis , Allan Sly

In this paper we consider the clustering coefficient and clustering function in a random graph model proposed by Krioukov et al.~in 2010. In this model, nodes are chosen randomly inside a disk in the hyperbolic plane and two nodes are…

Probability · Mathematics 2020-12-18 Nikolaos Fountoulakis , Pim van der Hoorn , Tobias Müller , Markus Schepers

Markov chains are one of the well-known tools for modeling and analyzing stochastic systems. At the same time, they are used for constructing random walks that can achieve a given stationary distribution. This paper is concerned with…

Information Theory · Computer Science 2025-01-07 Saber Jafarizadeh

The statistics of strongly interacting, ultracold Rydberg gases are governed by the interplay of two factors: geometrical restrictions induced by blockade effects, and quantum mechanical effects. To shed light on their relative roles in the…

Quantum Gases · Physics 2021-03-10 Daan Rutten , Jaron Sanders

The Ising ferromagnetic model on a square lattice is revisited using the Galam Unifying Frame (GUF), set to investigate the dynamics of two-state variable systems within the frame of opinion dynamics. When combined with Metropolis dynamics,…

Statistical Mechanics · Physics 2013-04-24 Serge Galam , André C. R. Martins

We study numerically the ordering process of two very simple dynamical models for a two-state variable on several topologies with increasing levels of heterogeneity in the degree distribution. We find that the zero-temperature Glauber…

Statistical Mechanics · Physics 2009-11-11 Claudio Castellano , Vittorio Loreto , Alain Barrat , Federico Cecconi , Domenico Parisi

We discuss hydrostatic models of galaxy clusters in which heat diffusion balances radiative cooling. We consider two different sources of diffusion, thermal conduction and turbulent mixing, parameterized by dimensionless coefficients, f and…

Astrophysics · Physics 2007-05-23 Ramesh Narayan , Woong-Tae Kim

We offer a solution to a long-standing problem in the physics of networks, the creation of a plausible, solvable model of a network that displays clustering or transitivity -- the propensity for two neighbors of a network node also to be…

Statistical Mechanics · Physics 2009-08-13 M. E. J. Newman

On the basis of microscopic statistical mechanics of simple liquids the orientational interaction between clusters consisting of a particle and its nearest neighbors is estimated. It is shown that there are ranges of density and temperature…

Disordered Systems and Neural Networks · Physics 2009-11-10 N. M. Chtchelkatchev , V. N. Ryzhov , T. I. Schelkacheva , E. E. Tareyeva

Through a Metropolis-like algorithm with single step computational cost of order one, we build a Markov chain that relaxes to the canonical Fermi statistics for k non-interacting particles among m energy levels. Uniformly over the…

Probability · Mathematics 2015-05-14 Alexandre Gaudilliere , Julien Reygner

We study the evolution of a social network with friendly/enmity connections into a balanced state by introducing a dynamical model with an intrinsic randomness, similar to Glauber dynamics in statistical mechanics. We include the…

Physics and Society · Physics 2019-08-14 Rana Shojaei , Pouya Manshour , Afshin Montakhab

The global average treatment effect (GATE) is a primary quantity of interest in the study of causal inference under network interference. With a correctly specified exposure model of the interference, the Horvitz-Thompson (HT) and H\'ajek…

Methodology · Statistics 2020-09-07 Johan Ugander , Hao Yin

This paper introduces the Attracting Random Walks model, which describes the dynamics of a system of particles on a graph with $n$ vertices. At each step, a single particle moves to an adjacent vertex (or stays at the current one) with…

Probability · Mathematics 2020-06-01 Julia Gaudio , Yury Polyanskiy

For an integer $b \ge 1$, a $b$-matching (resp. $b$-edge cover) of a graph $G=(V,E)$ is a subset $S\subseteq E$ of edges such that every vertex is incident with at most (resp. at least) $b$ edges from $S$. We prove that for any $b \ge 1$…

Data Structures and Algorithms · Computer Science 2023-08-02 Zongchen Chen , Yuzhou Gu
‹ Prev 1 8 9 10 Next ›