Related papers: Poisson Approximation and Connectivity in a Scale-…
We study weak convergence of a sequence of point processes to a scale-invariant simple point process. For a deterministic sequence $(z_n)_{n\in\mathbb{N}}$ of positive real numbers increasing to infinity as $n \to \infty$ and a sequence…
Consider a measure $\mu_\lambda = \sum_x \xi_x \delta_x$ where the sum is over points $x$ of a Poisson point process of intensity $\lambda$ on a bounded region in $d$-space, and $\xi_x$ is a functional determined by the Poisson points near…
we study the statistical properties of inhomogenous Poisson networks. we perform a detailed analysis of the statistical properties of Poisson networks and show that the topological properties of random cellular structures, can be derived…
Empirical networks are often globally sparse, with a small average number of connections per node, when compared to the total size of the network. However, this sparsity tends not to be homogeneous, and networks can also be locally dense,…
Ionic microgels are soft colloidal particles, composed of crosslinked polymer networks, that ionize and swell when dispersed in a good solvent. Swelling of these permeable, compressible particles involves a balance of electrostatic,…
We study the problem of deterministic approximate counting of matchings and independent sets in graphs of bounded connective constant. More generally, we consider the problem of evaluating the partition functions of the monomer-dimer model…
We consider the point process of signal strengths from transmitters in a wireless network observed from a fixed position under models with general signal path loss and random propagation effects. We show via coupling arguments that under…
We consider connectivity properties of certain i.i.d. random environments on $\Z^d$, where at each location some steps may not be available. Site percolation and oriented percolation can be viewed as special cases of the models we consider.…
We study a new type of random minimum spanning trees. It is built on the complete graph where each vertex is given a weight, which is a positive real number. Then, each edge is given a capacity which is a random variable that only depends…
In previous papers, threshold probabilities for the properties of a random distance graph to contain strictly balanced graphs were found. We extend this result to arbitrary graphs and prove that the number of copies of a strictly balanced…
We introduce a new class of Poisson-exponential-Tweedie (PET) mixture in the framework of generalized linear models for ultra-overdispersed count data. The mean-variance relationship is of the form $m+m^{2}+\phi m^{p}$, where $\phi$ and $p$…
Scale-free percolation is a stochastic model for complex networks. In this spatial random graph model, vertices $x,y\in\mathbb{Z}^d$ are linked by an edge with probability depending on i.i.d.\ vertex weights and the Euclidean distance…
We consider an inhomogeneous Poisson process $X$ on $[0,T]$. The intensity function of $X$ is supposed to be strictly positive and smooth on $[0,T]$ except at the point $\theta$, in which it has either a 0-type singularity (tends to 0 like…
We introduce an evolving network model in which a new node attaches to a randomly selected target node and also to each of its neighbors with probability $p$. The resulting network is sparse for $p<\frac{1}{2}$ and dense (average degree…
The fault tolerance of random graphs with unbounded degrees with respect to connectivity is investigated, which relates to the reliability of wireless sensor networks with unreliable relay nodes. The model evaluates the network breakdown…
We consider a specific random graph which serves as a disordered medium for a particle performing biased random walk. Take a two-sided infinite horizontal ladder and pick a random spanning tree with a certain edge weight $c$ for the…
We demonstrate that a key elastic parameter of a suspended crystalline membrane---the Poisson ratio (PR) $\nu$---is a non-trivial function of the applied stress $\sigma$ and of the system size $L$, i.e., $\nu=\nu_L(\sigma)$. We consider a…
Correlation analysis is a fundamental step in uncovering meaningful insights from complex datasets. In this paper, we study the problem of detecting correlations between two random graphs following the Gaussian Wigner model with unlabeled…
We consider a sparse Erd\H{o}s--R\'{e}nyi graph $\mathcal{G}(n,\lambda/n)$ where each edge is independently assigned a random signed weight. For two uniformly chosen vertices, we study the joint distribution of the total weights and…
The hard core model in statistical physics is a probability distribution on independent sets in a graph in which the weight of any independent set I is proportional to lambda^(|I|), where lambda > 0 is the vertex activity. We show that…