Related papers: Swendsen-Wang Dynamics for General Graphs in the T…
We study Glauber dynamics for sampling from discrete distributions $\mu$ on the hypercube $\{\pm 1\}^n$. Recently, techniques based on spectral independence have successfully yielded optimal $O(n)$ relaxation times for a host of different…
We consider the problem of uniformly generating a spanning tree, of a connected undirected graph. This process is useful to compute statistics, namely for phylogenetic trees. We describe a Markov chain for producing these trees. For cycle…
We introduce a general class of mean-field-like spin systems with random couplings that comprises both the Ising model on inhomogeneous dense random graphs and the randomly diluted Hopfield model. We are interested in quantitative estimates…
Using a single-site mean-field approximation (MFA) and Monte Carlo simulations, we examine Ising-like models on directed regular random graphs. The models are directed-network implementations of the Ising model, Ising model with absorbing…
On directed Barabasi-Albert networks with two and seven neighbours selected by each added site, the Ising model does not seem to show a spontaneous magnetisation. Instead, the decay time for flipping of the magnetisation follows an…
Tensor network algorithms provide a suitable route for tackling real-time dependent problems in lattice gauge theories, enabling the investigation of out-of-equilibrium dynamics. We analyze a U(1) lattice gauge theory in (1+1) dimensions in…
We consider the Glauber dynamics of a ferromagnetic Ising-Kac model on a three-dimensional periodic lattice of size $(2N + 1)3$, in which the flipping rate of each spin depends on an average field in a large neighborhood of radius…
A feedback vertex set (FVS) of an undirected graph contains vertices from every cycle of this graph. Constructing a FVS of sufficiently small cardinality is very difficult in the worst cases, but for random graphs this problem can be…
We propose SWING: Space Walks for Implicit Network Graphs, a new class of algorithms for computations involving Graph Random Features on graphs given by implicit representations (i-graphs), where edge-weights are defined as bi-variate…
Motivated by the prevalent data science applications of processing large-scale graph data such as social networks and biological networks, this paper investigates lossless compression of data in the form of a labeled graph. Particularly, we…
A spin-$s$ variable-range interacting Ising model may display qualitatively different behaviors depending on the fall-off rate of the interactions, as already seen in equilibrium studies of spin-1/2 systems. We propose a dynamical method…
The random-cluster model is a unifying framework for studying random graphs, spin systems and electrical networks that plays a fundamental role in designing efficient Markov Chain Monte Carlo (MCMC) sampling algorithms for the classical…
We investigate thermodynamic phase transitions of the joint presence of spin glass (SG) and random field (RF) using a random graph model that allows us to deal with the quenched disorder. Therefore, the connectivity becomes a controllable…
We study nondeterministic and probabilistic versions of a discrete dynamical system (due to T. Antal, P. L. Krapivsky, and S. Redner) inspired by Heider's social balance theory. We investigate the convergence time of this dynamics on…
This work introduces a construction of conformal processes that combines the theory of branching processes with chordal Loewner evolution. The main novelty lies in the choice of driving measure for the Loewner evolution: given a finite…
We study the convergence properties of Glauber dynamics for the random field Ising model (RFIM) with ferromagnetic interactions on finite domains of $\mathbb{Z}^d$, $d \ge 2$. Of particular interest is the Griffiths phase where correlations…
Temporal link prediction in dynamic graphs is a fundamental problem in many real-world systems. Existing temporal graph neural networks mainly focus on learning representations of historical interactions. Despite their strong performance,…
We study the stochastic dynamics of Ising spin models with random bonds, interacting on finitely connected Poissonnian random graphs. We use the dynamical replica method to derive closed dynamical equations for the joint spin-field…
We present a general approach to study the flooding time (a measure of how fast information spreads) in dynamic graphs (graphs whose topology changes with time according to a random process). We consider arbitrary converging Markovian…
Non-equilibrium dynamics of classical random Ising spin chains are studied using asymptotically exact real space renormalization group. Specifically the random field Ising model with and without an applied field (and the Ising spin glass…