Related papers: Multipoint connectivity in the branching interlace…

We study the effect of positive correlations on the critical threshold of site and bond percolation in a square lattice with d = 2. We propose two algorithms for generating dependent lattices with minimal correlation length and non-negative…

Using the language of regular variation, we give a sufficient condition for a point process to be in the superposition domain of attraction of a strictly stable point process. This sufficient condition is then used to obtain an explicit…

Let $G$ be a connected graph and $L(G)$ the set of all integers $k$ such that $G$ contains a spanning tree with exactly $k$ leaves. We show that for a connected graph $G$, the set $L(G)$ is contiguous. It follows from work of Chen, Ren, and…

The eccentric connectivity index, proposed by Sharma, Goswami and Madan, has been employed successfully for the development of numerous mathematical models for the prediction of biological activities of diverse nature. We now report…

In network flow problems, there is a well-known one-to-one relationship between extreme points of the feasibility region and trees in the associated undirected graph. The same is true for the dual differential problem. In this paper, we…

We study the maximum number of straight-line segments connecting $n$ points in convex position in the plane, so that each segment intersects at most $k$ others. This question can also be framed as the maximum number of edges of an outer…

Adding edges between layers of interconnected networks is an important way to optimize the spreading dynamics. While previous studies mostly focus on the case of adding a single edge, the theoretical optimal strategy for adding multiple…

We present simulation results for the contact process on regular, cubic networks that are composed of a one-dimensional lattice and a set of long edges with unbounded length. Networks with different sets of long edges are considered, that…

We consider spread-out models of self-avoiding walk, bond percolation, lattice trees and bond lattice animals on the d-dimensional hyper cubic lattice having long finite-range connections, above their upper critical dimensions d=4…

The mathematical analysis of random phylogenetic networks via analytic and algorithmic methods has received increasing attention in the past years. In the present work we introduce branching process methods to their study. This approach…

We investigate the two-points correlation function for several boundary-driven interacting particle systems. Our goal is to show that the time evolution of that correlation function is solution to a partial differential equation that can be…

We study the thick points of branching Brownian motion and branching random walk with a critical branching mechanism, focusing on the critical dimension $d = 4$. We determine the exponent governing the probability to hit a small ball with…

Corner percolation is a dependent bond percolation model on Z^2 introduced by B\'alint T\'oth, in which each vertex has exactly two incident edges, perpendicular to each other. G\'abor Pete has proven in 2008 that under the maximal entropy…

We analyse the jigsaw percolation process, which may be seen as a measure of whether two graphs on the same vertex set are `jointly connected'. Bollob\'as, Riordan, Slivken and Smith proved that when the two graphs are independent binomial…

We give conditions under which near-critical stochastic processes on the half-line have infinitely many or finitely many cutpoints, generalizing existing results on nearest-neighbour random walks to adapted processes with bounded increments…

We study the asymptotic behavior for large $N$ of the disconnection time $T_N$ of a simple random walk on the discrete cylinder $(\mathbb{Z}/N\mathbb{Z})^d\times\mathbb{Z}$, when $d\ge2$. We explore its connection with the model of random…

In this paper, we present new incremental algorithms for maintaining data structures that represent all connectivity cuts of size one in directed graphs (digraphs), and the strongly connected components that result by the removal of each of…

We consider the soft Boolean model, a model that interpolates between the Boolean model and long-range percolation, where vertices are given via a stationary Poisson point process. Each vertex carries an independent Pareto-distributed…

We study a biased random walk on the interlacement set of $\mathbb{Z}^d$ for $d\geq 3$. Although the walk is always transient, we can show, in the case $d=3$, that for any value of the bias the walk has a zero limiting speed and actually…

We introduce a new approach to connectivity-dependent properties of diluted systems, which is based on the transfer-matrix formulation of the percolation problem. It simultaneously incorporates the connective properties reflected in…