Related papers: Chemical distance for the half-orthant model
Consider a random walk on $\mathbb{Z}^d$ in a translation-invariant and ergodic random environment and starting from the origin. In this short note, assuming that a quenched invariance principle for the opportunely-rescaled walks holds, we…
Let C_n be the origin-containing cluster in subcritical percolation on the lattice (1/n) Z^d, viewed as a random variable in the space Omega of compact, connected, origin-containing subsets of R^d, endowed with the Hausdorff metric delta.…
Consider critical site percolation on $\mathbb{Z}^d$ with $d \geq 2$. We prove a lower bound of order $n^{- d^2}$ for point-to-point connection probabilities, where $n$ is the distance between the points. Most of the work in our proof…
We are interested in a fragmentation process. We observe fragments frozen when their sizes are less than {\epsilon} ({\epsilon} > 0). It is known ([BM05]) that the empirical measure of these fragments converges in law, under some…
We consider the Erdos-Renyi random graph G(n,p) inside the critical window, that is when p=1/n+ lambda*n^{-4/3}, for some fixed lambda in R. Then, as a metric space with the graph distance rescaled by n^{-1/3}, the sequence of connected…
We establish the existence of the phase transition in site percolation on pseudo-random $d$-regular graphs. Let $G=(V,E)$ be an $(n,d,\lambda)$-graph, that is, a $d$-regular graph on $n$ vertices in which all eigenvalues of the adjacency…
In site percolation, vertices (sites) of a graph are open with probability p, and there is critical p, for which open vertices form an open path the long way across a graph, so a vertex at the origin is a part of an infinite connected open…
High-order structures have been recognised as suitable models for systems going beyond the binary relationships for which graph models are appropriate. Despite their importance and surge in research on these structures, their random cases…
Differential geometry is powerful tool to analyze the vapor-liquid critical point on the surface of the thermodynamic equation of state. The existence of usual condition of the critical point $\left( \partial p/\partial V\right) _{T}=0$…
Given $\omega\ge 1$, let $Z^2_{(\omega)}$ be the graph with vertex set $Z^2$ in which two vertices are joined if they agree in one coordinate and differ by at most $\omega$ in the other. (Thus $Z^2_{(1)}$ is precisely $Z^2$.) Let…
The dissertation is related to combinatorial geometry with a strong probabilistic flavor. The main results can be split into three parts. The results of the first part guarantee that each "unit distance graph" in the plane has an induced…
A random hopping on a fractal network with dimension slightly above one, $d = 1 + \epsilon$, is considered as a model of transport for conducting polymers with nonmetallic conductivity. Within the real space renormalization group method of…
In a recent work of the authors and Kim, we derived a complete description of the largest component of the Erd\H{o}s-R\'enyi random graph $G(n,p)$ as it emerges from the critical window, i.e. for $p = (1+\epsilon)/n$ where $\epsilon^3 n…
Within a quasi-particle model for the equation of state of strongly interacting matter for two quark flavors we include phenomenologically features of the QCD critical point and discuss its impact on the equation of state. In particular, we…
The main objective of this article is to establish a central limit theorem for additive three-variable functionals of bifurcating Markov chains. We thus extend the central limit theorem under point-wise ergodic conditions studied in…
Consider a bipartite random geometric graph on the union of two independent homogeneous Poisson point processes in $d$-space, with distance parameter $r$ and intensities $\lambda,\mu$. For any $\lambda>0$ we consider the percolation…
We study the distribution of diameters d of Erd\"os-R\'enyi random graphs with average connectivity c. The diameter d is the maximum among all shortest distances between pairs of nodes in a graph and an important quantity for all dynamic…
Let a random geometric graph be defined in the supercritical regime for the existence of a unique infinite connected component in Euclidean space. Consider the first-passage percolation model with independent and identically distributed…
Consider subcritical Bernoulli bond percolation with fixed parameter p<p_c. We define a dependent site percolation model by the following procedure: for each bond cluster, we colour all vertices in the cluster black with probability r and…
We explore the quasiparticle model at finite chemical potential related to Ru-Keng Su's distinguished contributions to the topic. Besides, we discuss recent developments in the model, and in particular, one argues that the effective mass of…