You have just completed your registration at OpenAire.
Before you can login to the site, you will need to activate your account.
An e-mail will be sent to you with the proper instructions.
Important!
Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version
of the site upon release.
We give an intuitive geometric explanation for the apparent breakdown of standard finite-size scaling in systems with periodic boundaries above the upper critical dimension. The Ising model and self-avoiding walk are simulated on five-dimensional hypercubic lattices with free and periodic boundary conditions, by using geometric representations and recently introduced Markov-chain Monte Carlo algorithms. We show that previously observed anomalous behaviour for correlation functions, measured o...
We design an irreversible worm algorithm for the zero-field ferromagnetic Ising model by using the lifting technique. We study the dynamic critical behavior of an energy estimator on both the complete graph and toroidal grids, and compare our findings with reversible algorithms such as the Prokof'ev-Svistunov worm algorithm. Our results show that the lifted worm algorithm improves the dynamic exponent of the energy estimator on the complete graph, and leads to a significant constant improveme...
We study random walk among random conductance (RWRC) on complete graphs with N vertices. The conductances are i.i.d. and the sum of conductances emanating from a single vertex asymptotically has an infinitely divisible distribution corresponding to a L\'evy subordinator with infinite mass at 0. We show that, under suitable conditions, the empirical spectral distribution of the random transition matrix associated to the RWRC converges weakly, as N goes to infinity, to a symmetric deterministic...
We study the asymptotic behaviour of once-reinforced biased random walk (ORbRW) on Galton-Watson trees. Here the underlying random walk has a bias towards or away from the root. We prove that in the setting of multiplicative once-reinforcement the ORbRW can be recurrent even when the underlying walk is ballistic. We also prove that, on Galton-Watson trees without leaves, the speed of the ORbRW is monotone decreasing in the reinforcement parameter when the underlying random walk has high speed...
The asynchronous push&pull protocol, a randomized distributed algorithm for spreading a rumour in a graph $G$, works as follows. Independent Poisson clocks of rate 1 are associated with the vertices of $G$. Initially, one vertex of $G$ knows the rumour. Whenever the clock of a vertex $x$ rings, it calls a random neighbour $y$: if $x$ knows the rumour and $y$ does not, then $x$ tells $y$ the rumour (a push operation), and if $x$ does not know the rumour and $y$ knows it, $y$ tells $x$ the rumo...
We prove rapid mixing of the Prokofiev-Svistunov (or worm) algorithm for the zero-field ferromagnetic Ising model, on all finite graphs and at all temperatures. As a corollary, we show how to rigorously construct simple and efficient approximation schemes for the Ising susceptibility and two-point correlation function.
We study a system of interacting reinforced random walks defined on polygons. At each stage, each particle chooses an edge to traverse which is incident to its position. We allow the probability of choosing a given edge to depend on the sum of, the number of times that particle traversed that edge, a quantity which depends on the behaviour of the other particles, and possibly external factors. We study localization properties of this system and our main tool is a new result we establish for a...
We prove rapid mixing of the worm process for the zero-field ferromagnetic Ising model, on all finite connected graphs, and at all temperatures. As a corollary, we obtain a fully-polynomial randomized approximation scheme for the Ising susceptibility, and for a certain restriction of the two-point correlation function
We consider the coupling from the past implementation of the random-cluster heat-bath process, and study its random running time, or coupling time. We focus on hypercubic lattices embedded on tori, in dimensions one to three, with cluster fugacity at least one. We make a number of conjectures regarding the asymptotic behaviour of the coupling time, motivated by rigorous results in one dimension and Monte Carlo simulations in dimensions two and three. Amongst our findings, we observe that, for...
No project research data found
No project statistics found
Scientific Results
Chart is loading... It may take a bit of time. Please be patient and don't reload the page.
PUBLICATIONS BY ACCESS MODE
Chart is loading... It may take a bit of time. Please be patient and don't reload the page.
Publications in Repositories
Chart is loading... It may take a bit of time. Please be patient and don't reload the page.