We formulate and study a model for inhomogeneous long-range percolation on ${\mathbb{Z}}^d$. Each vertex $x\in {\mathbb{Z}}^d$ is assigned a non-negative weight $W_x$, where ${\left(W_x\right)}_{x\in \mathbb{Z}}^d$ are i.i.d. random variables. Conditionally on the weights, and given two parameters $\alpha ,\lambda gt;0$, the edges are independent and the probability that there is an edge between $x$ and $y$ is given by $p_{xy}=1-exp\{-\lambda W_x{W}_y{/|x-y|}^{\alpha }\}$. The parameter $\lambda$ is the percolation parameter, while $\alpha$ describes the long-range nature of the model. We focus on the degree distribution in the resulting graph, on whether there...

We answer a question of van Mill and Wattel by showing that there is a separable locally compact space which admits a continuous weak selection but is not weakly orderable. Furthermore, we show that a separable space which admits a continuous weak selection can be covered by two weakly orderable spaces. Finally, we give a partial answer to a question of Gutev and Nogura by showing that a separable space which admits a continuous weak selection admits a continuous selection for all finite sets.

In this paper, we study the size of the giant component $C_G$ in the random geometric graph $G=G(n,r_n,f)$ of $n$ nodes independently distributed each according to a certain density $f(·)$ in ${[0,1]}^2$ satisfying ${inf}_{x\in {[0,1]}^2}f\left(x\right)gt;$$0$. If $\frac{c_1}{n}\le r_n^2\le c_2\frac{logn}{n}$ for some positive constants $c_1$, $c_2$ and $n{r}_n^2⟶\infty$ as $n\to \infty$, we show that the giant component of $G$ contains at least $n-\mathrm{o}\left(n\right)$ nodes with probability at least $1-{\mathrm{e}}^{-\beta n{r}_n^2}$ for all $n$ and for some positive constant $\beta$....

The aim of this paper is to study the threshold behavior for the satisfiability property of a random $k$-XOR-CNF formula or equivalently for the consistency of a random Boolean linear system with $k$ variables per equation. For $k\ge 3$ we show the existence of a sharp threshold for the satisfiability of a random $k$-XOR-CNF formula, whereas there are smooth thresholds for $k=1$ and $k=2$.

The aim of this paper is to study the threshold behavior for the satisfiability property of a random k-XOR-CNF formula or equivalently for the consistency of a random Boolean linear system with k variables per equation. For k ≥ 3 we show the existence of a sharp threshold for the satisfiability of a random k-XOR-CNF formula, whereas there are smooth thresholds for k=1 and k=2.