相关论文: A formula for crossing probabilities of critical s…
Given a graph $G$, we consider a model for a random cover of $G$ by taking two parallel copies of $G$ and crossing every pair of parallel edges randomly with probability $q$ independently of each other. The resulting graph $G_q$, is a…
We report some novel properties of a square lattice filled with white sites, randomly occupied by black sites (with probability $p$). We consider connections up to second nearest neighbours, according to the following rule. Edge-sharing…
We propose an approach to compute the boundary crossing probabilities for a class of diffusion processes which can be expressed as piecewise monotone (not necessarily one-to-one) functionals of a standard Brownian motion. This class…
We obtain long series expansions for the bulk, surface and corner free energies for several two-dimensional statistical models, by combining Enting's finite lattice method (FLM) with exact transfer matrix enumerations. The models encompass…
We consider several aspects of the scaling limit of percolation on random planar triangulations, both finite and infinite. The equivalents for random maps of Cardy's formula for the limit under scaling of various crossing probabilities are…
The talk presented at ICMP 97 focused on the scaling limits of critical percolation models, and some other systems whose salient features can be described by collections of random lines. In the scaling limit we keep track of features seen…
Phase transition in the two-dimensional $q$-state Potts model with random ferromagnetic couplings in the large-q limit is conjectured to be described by the isotropic version of the infinite randomness fixed point of the random…
We give estimates of the critical parameter for random loop models that are related to quantum spin systems. A special case of the model that we consider is the interchange- or random-stirring process. We consider here the model defined on…
The lectures review the state of affairs in modern branch of mathematical physics called probabilistic topology. In particular we consider the following problems: (i) We estimate the probability of a trivial knot formation on the lattice…
It is proposed that the $O(n)$ spin and geometrical percolation models can help to study the QCD phase diagram due to the universality properties of the phase transition. In this paper, correlations and fluctuations of various sizes of…
We obtain Gaussian upper and lower bounds on the transition density q_t(x,y) of the continuous time simple random walk on a supercritical percolation cluster C_{\infty} in the Euclidean lattice. The bounds, analogous to Aronsen's bounds for…
The present work introduces an efficient Monte Carlo algorithm for continuum percolation composed of randomly-oriented rectangles. By conducting extensive simulations, we report high precision percolation thresholds for a variety of…
We propose a novel combinatorial algorithm for efficient generation of Hamiltonian walks and cycles on a cubic lattice, modeling the conformations of lattice toy proteins. Through extensive tests on small lattices (allowing complete…
Consider a uniform expanders family G_n with a uniform bound on the degrees. It is shown that for any p and c>0, a random subgraph of G_n obtained by retaining each edge, randomly and independently, with probability p, will have at most one…
This paper is studying the critical regime of the planar random-cluster model on $\mathbb Z^2$ with cluster-weight $q\in[1,4)$. More precisely, we prove crossing estimates in quads which are uniform in their boundary conditions and depend…
We compare level-set percolation for Gaussian free fields (GFFs) defined on a rectangular subset of $\delta \mathbb{Z}^2$ to level-set percolation for GFFs defined on the corresponding metric graph as the mesh size $\delta$ goes to 0. In…
This article is devoted to the study of a finite system of long clusters of subcritical 2-dimensional FK-percolation with q $\geq$ 1, conditioned on mutual avoidance. We show that the diffusive scaling limit of such a system is given by a…
In this paper, we compute the next-nearest-neighboring site percolation (Connections exist not only between nearest-neighboring sites, but also between next-nearest-neighboring sites.) probabilities Pc on the two-dimensional Sierpinski…
In this work, we study the percolation transition and large deviation properties of generalized canonical network ensembles. This new type of random networks might have a very rich complex structure, including high heterogeneous degree…
Percolation models with multiple percolating clusters have attracted much attention in recent years. Here we use Monte Carlo simulations to study bond percolation on $L_{1}\times L_{2}$ planar random lattices, duals of random lattices, and…