相关论文: On weak $\epsilon$-nets and the Radon number
We investigate the threshold probability for connectivity of sparse graphs under weak assumptions. As a corollary this completely solve the problem for Cartesian powers of arbitrary graphs. In detail, let $G$ be a connected graph on $k$…
The aim of this paper is to present some properties of Choquet maximal Radon probability measures on compact, convex subsets of Hausdorff, locally convex, topological real vector spaces. Theorem 3.12 is the main result of the paper. While…
The weakly relational domain of Octagons offers a decent compromise between precision and efficiency for numerical properties. Here, we are concerned with the construction of non-numerical relational domains. We provide a general…
Given a resistive electrical network, we would like to determine whether all the resistances (edges) in the network are working, and if not, identify which edge (or edges) are faulty. To make this determination, we are allowed to measure…
We study how the existence of a negatively pinched K\"ahler metric on a domain in complex Euclidean space restricts the geometry of its boundary. In particular, we show that if a convex domain admits a complete K\"ahler metric, with pinched…
We constructs a new network by superposition of hexahedron , which are scale-free, highly sparse,disassortative ,and maximal planar graphs. The network degree distribution, agglomeration coefficient and degree of correlation are computed…
We consider the class of weakly porous sets in Euclidean spaces. As our main goal, we give a precise characterization in terms of dyadic covering of these sets. Also, we obtain the Carleson embedding inequality for porous sets.
We analyze weak convergence on CAT(0) spaces and the existence and properties of corresponding weak topologies.
A reaction network together with a choice of rate constants uniquely gives rise to a system of differential equations, according to the law of mass-action kinetics. On the other hand, different networks can generate the same dynamical…
We prove density results for neural-network classes on compact sets \(K\subset X\), where \(X\) is a topological vector space whose continuous dual \(X^*\) separates points. Let \(\Psi:\mathbb R\to\mathbb R\) be a continuous squashing…
Using the game approach to fragmentability, we give new and simpler proofs of the following known results: (a) If the Banach space admits an equivalent Kadec norm, then its weak topology is fragmented by a metric which is stronger than the…
We develop a new technique for constructing sparse graphs that allow us to prove near-linear lower bounds on the round complexity of computing distances in the CONGEST model. Specifically, we show an $\widetilde{\Omega}(n)$ lower bound for…
Networks are inherently vulnerable to vertex failures, making the analysis of their structural robustness a fundamental problem in graph theory. In this study, we investigate the closeness and vertex residual closeness of graphs, with a…
We consider four problems. Rogers proved that for any convex body $K$, we can cover ${\mathbb R}^d$ by translates of $K$ of density very roughly $d\ln d$. First, we extend this result by showing that, if we are given a family of positive…
In this paper, we propose criteria for unboundedness of the images of set-valued mappings having closed graphs in Euclidean spaces. We focus on mappings whose domains are non-closed or whose values are connected. These criteria allow us to…
Percolation theory has become a useful tool for the analysis of large-scale wireless networks. We investigate the fundamental problem of characterizing the critical density $\lambda_c^{(d)}$ for $d$-dimensional Poisson random geometric…
The purpose of this paper is to introduce the construction of a stochastic process called "$\delta$-dimensional Bessel house-moving" and its properties. We study the weak convergence of $\delta$-dimensional Bessel bridges conditioned from…
The study of complex networks is a significant development in modern science, and has enriched the social sciences, biology, physics, and computer science. Models and algorithms for such networks are pervasive in our society, and impact…
Recent research has demonstrated the importance of boundary effects on the overall connection probability of wireless networks but has largely focused on convex deployment regions. We consider here a scenario of practical importance to…
We study Poisson--Voronoi percolation and its discrete analogue Bernoulli--Voronoi percolation in spaces with a non-amenable product structure. We develop a new method of proving smallness of the uniqueness threshold $p_u(\lambda)$ at small…