Related papers: Hitting times asymptotics for hard-core interactio…
We perform simulations of random Ising models defined over small-world networks and we check the validity and the level of approximation of a recently proposed effective field theory. Simulations confirm a rich scenario with the presence of…
First- and second-order temperature driven transitions are studied, in a lattice gas driven by an oscillatory field. The short time dynamics study provides upper and lower bounds for the first-order transition points obtained using standard…
We study the Potts model on a rectangular lattice with aperiodic modulations in its interactions along one direction. Numerical results are obtained using the Wolff algorithm and for many lattice sizes, allowing for a finite-size scaling…
The hard-core model has as its configurations the independent sets of some graph instance $G$. The probability distribution on independent sets is controlled by a `fugacity' $\lambda>0$, with higher $\lambda$ leading to denser…
The first of $N$ identical independently distributed (i.i.d.) Brownian trajectories that arrives to a small target, sets the time scale of activation, which in general is much faster than the arrival to the target of only a single…
We apply a new entropic scheme to study the critical behavior of the square-lattice Ising model with nearest- and next-nearest-neighbor antiferromagnetic interactions. Estimates of the present scheme are compared with those of the…
We implement a new and accurate numerical entropic scheme to investigate the first-order transition features of the triangular Ising model with nearest-neighbor ($J_{nn}$) and next-nearest-neighbor ($J_{nnn}$) antiferromagnetic interactions…
Recoverable systems provide coarse models of data storage on the two-dimensional square lattice, where each site reconstructs its value from neighboring sites according to a specified local rule. To study the typical behavior of recoverable…
We investigate the Ising model on finite subgraphs of the hyperbolic lattice under minus boundary conditions and in the presence of a positive external field $h$. Interpreting the boundary as frozen or cold wall conditions, we show that,…
Previous work has shown the effectiveness of random walk hitting times as a measure of dissimilarity in a variety of graph-based learning problems such as collaborative filtering, query suggestion or finding paraphrases. However,…
We analyze maximum entropy random graph ensembles with constrained degrees, drawn from arbitrary degree distributions, and a tuneable number of 3-loops (triangles). We find that such ensembles generally exhibit two transitions, a clustering…
Various graph algorithms have been developed with multiple random walks, the movement of several independent random walkers on a graph. Designing an efficient graph algorithm based on multiple random walks requires investigating multiple…
Consider the interchange process on a connected graph $G=(V,E)$ on $n$ vertices. I.e.\ shuffle a deck of cards by first placing one card at each vertex of $G$ in a fixed order and then at each tick of the clock, picking an edge uniformly at…
We study the Hatano-Nelson model, i.e., a one-dimensional non-Hermitian chain of spinless fermions with nearest-neighbour nonreciprocal hopping, in the presence of repulsive nearest-neighbour interactions. At half filling, we find two…
Complex interactions leading to phase transitions continue to hold a due interest in the scientific community. We charactersize a phase transition in a coupled oscillators model where interactions are not local in nature. At a first order…
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…
We consider the Ising model on the hexagonal lattice evolving according to Metropolis dynamics. We study its metastable behavior in the limit of vanishing temperature when the system is immersed in a small external magnetic field. We…
We prove a refined version of the Aldous and Brown's exponential approximation of stationary hitting times. These are valid for all reversible Markov chains. We then specialise our estimates for vertex-transitive graphs, where we obtain…
There are some particular one-dimensional models, such as the Ising-Heisenberg spin models with a variety of chain structures, which exhibit unexpected behaviors quite similar to the first and second order phase transition, which could be…
The statement that any phase transition is related to the appearance or disappearance of long-range spatial correlations precludes a finite transition temperature in one-dimensional (1D) systems. In this paper we demonstrate that the 1D…