Related papers: Pair Connectedness and Shortest Path Scaling in Cr…
We predict that self-bound clusters of particles exist in the supercritical phase of simple fluids. These clusters, whose internal temperature is lower than the global temperature of the system, define a percolation line that starts at the…
Fitting percolation into the conformal field theory framework requires showing that connection probabilities have a conformally invariant scaling limit. For critical site percolation on the triangular lattice, we prove that the probability…
Internal measures that are used to assess the quality of a clustering usually take into account intra-group and/or inter-group criteria. There are many papers in the literature that propose algorithms with provable approximation guarantees…
We study a percolation model on $\mathbb R^d$ called the random connection model. For $d$ large, we use the lace expansion to prove that the critical two-point connection probability decays like $|x|^{-(d-2)}$ as $|x| \to \infty$, with…
We study entanglement percolation in qubit-based planar quantum network models of arbitrary topology, where neighboring nodes are initially connected by pure states with quenched disorder in their entanglement. To address this, we develop a…
We study percolation on networks, which is used as a model of the resilience of networked systems such as the Internet to attack or failure and as a simple model of the spread of disease over human contact networks. We reformulate…
We prove that the supercritical phase of Voronoi percolation on $\mathbb{R}^d$, $d\geq 3$, is well behaved in the sense that for every $p>p_c(d)$ local uniqueness of macroscopic clusters happens with high probability. As a consequence,…
It is known that the critical probability for the percolation transition is not a sharp threshold, actually it is a region of non-zero width $\Delta p_c$ for systems of finite size. Here we present evidence that for complex networks $\Delta…
We prove that the set of thick points of the log-correlated Gaussian field contains an unbounded path in sufficiently high dimensions. This contrasts with the two-dimensional case, where Aru, Papon, and Powell (2023) showed that the set of…
We study the distributions of traveling length l and minimal traveling time t through two-dimensional percolation porous media characterized by long-range spatial correlations. We model the dynamics of fluid displacement by the convective…
We study the use of power weighted shortest path distance functions for clustering high dimensional Euclidean data, under the assumption that the data is drawn from a collection of disjoint low dimensional manifolds. We argue, theoretically…
We consider the two dimensional $Q-$ random-cluster Potts model on the torus and at the critical point. We study the probability for two points to be connected by a cluster for general values of $Q\in [1,4]$. Using a Conformal Field Theory…
Multilayer networks have been found to be prone to abrupt cascading failures under random and targeted attacks, but most of the targeting algorithms proposed so far have been mainly tested on uncorrelated systems. Here we show that the size…
We consider the problem of grouping items into clusters based on few random pairwise comparisons between the items. We introduce three closely related algorithms for this task: a belief propagation algorithm approximating the Bayes optimal…
In long-range percolation on $\mathbb{Z}^d$, points $x$ and $y$ are connected by an edge with probability $1-\exp(-\beta\|x-y\|^{-d-\alpha})$, where $\alpha>0$ is fixed and $\beta \geq 0$ is a parameter. As $d$ and $\alpha$ vary, the model…
We develop a simple and unified approach to investigate several aspects of the cluster statistics of random expansive (multi-)sets. In particular, we determine the limiting distribution of the size of the smallest and largest clusters, we…
Percolation threshold of a network is the critical value such that when nodes or edges are randomly selected with probability below the value, the network is fragmented but when the probability is above the value, a giant component…
We prove consistency of four different approaches to formalizing the idea of minimum average edge-length in a path linking some infinite subset of points of a Poisson process. The approaches are (i) shortest path from origin through some…
We prove up-to-constants bounds on the two-point function (i.e., point-to-point connection probabilities) for critical long-range percolation on the $d$-dimensional hierarchical lattice. More precisely, we prove that if we connect each pair…
Higher order clustering coefficients $C(x)$ are introduced for random networks. The coefficients express probabilities that the shortest distance between any two nearest neighbours of a certain vertex $i$ equals $x$, when one neglects all…