Related papers: Exponential phi-mixing implies exponential psi-mix…
We investigate the convergence in distribution of sequential empirical processes of dependent data indexed by a class of functions F. Our technique is suitable for processes that satisfy a multiple mixing condition on a space of functions…
Graphs of solutions to the minimal surface equation over simply connected domains with boundary values 0 can have at most exponential growth.
The q-state Potts model with long-range interactions that decay as 1/r^alpha subjected to an uniform magnetic field on d-dimensional lattices is analized for different values of q in the nonextensive regime (alpha between 0 and d). We also…
The use of combinatorial optimization algorithms has contributed substantially to the major progress that has occurred in recent years in the understanding of the physics of disordered systems, such as the random-field Ising model. While…
We show that mixing for local, reversible dynamics of mean field spin glasses is exponentially slow in the low temperature regime. We introduce a notion of free energy barriers for the overlap, and prove that their existence imply that the…
Although the fully connected Ising model does not have a length scale, we show that its critical exponents can be found using finite size scaling with the scaling variable equal to N, the number of spins. We find that at the critical…
We prove that any Markov chain that performs local, reversible updates on randomly chosen vertices of a bounded-degree graph necessarily has mixing time at least $\Omega(n\log n)$, where $n$ is the number of vertices. Our bound applies to…
In a seminal paper, Weitz showed that for two-state spin systems, such as the Ising and hardcore models from statistical physics, correlation decay on trees implies correlation decay on arbitrary graphs. The key gadget in Weitz's reduction…
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…
We define a discrete-time Markov chain for abstract polymer models and show that under sufficient decay of the polymer weights, this chain mixes rapidly. We apply this Markov chain to polymer models derived from the hard-core and…
We establish limit theorems that describe the asymptotic local and global geometric behaviour of random enriched trees considered up to symmetry. We apply these general results to random unlabelled weighted rooted graphs and uniform random…
In this work we present different results concerning mixing properties of multivariate infinitely divisible (ID) stationary random fields. First, we derive some necessary and sufficient conditions for mixing of stationary ID multivariate…
Transfer-matrix methods on finite-width strips with free boundary conditions are applied to lattice site animals, which provide a model for randomly branched polymers in a good solvent. By assigning a distinct fugacity to sites along the…
For general, almost surely absorbed Markov processes, we obtain necessary and sufficient conditions for exponential convergence to a unique quasi-stationary distribution in the total variation norm. These conditions also ensure the…
We analyse the $\ell^2(\pi)$-convergence rate of irreducible and aperiodic Markov chains with $N$-band transition probability matrix $P$ and with invariant distribution $\pi$. This analysis is heavily based on: first the study of the…
The theory of ``Markov-up'' processes is being developed. This is a new class of stochastic processes with ``partial'' markovian features; it could also be called ``one-sided Markov''. Such a behavior may be found in the real world and in…
Although asymptotic analyses of undirected network models based on degree sequences have started to appear in recent literature, it remains an open problem to study statistical properties of directed network models. In this paper, we…
We prove that, unless P=NP, there is no polynomial-time algorithm to approximate within some multiplicative constant the average size of an independent set in graphs of maximum degree 6. This is a special case of a more general result for…
Exponential random graph models are extremely difficult models to handle from a statistical viewpoint, since their normalising constant, which depends on model parameters, is available only in very trivial cases. We show how inference can…
We consider a wide class of quantum spin systems obtained by adding a transverse field to a classical Hamiltonian. We give explicit high-temperature conditions which guarantee exponential decay of correlations. A stochastic-geometric…