Related papers: On growing connected beta-skeletons
We analyze a minimal model of a growing network. At each time step, a new vertex is added; then, with probability delta, two vertices are chosen uniformly at random and joined by an undirected edge. This process is repeated for t time…
Measurements of angular correlations between initial and final particles in $\beta$ decay remain one of the most promising ways of probing the Standard Model and looking for new physics. As experiments reach unprecedented precision well…
Social animals self-organise to create groups to increase protection against predators and productivity. One-to-one interactions are the building blocks of these emergent social structures and may correspond to friendship, grooming,…
For a positive constant $\alpha$ a graph $G$ on $n$ vertices is called an $\alpha$-expander if every vertex set $U$ of size at most $n/2$ has an external neighborhood whose size is at least $\alpha\left|U\right|$. We study cycle lengths in…
The pseudoscalar and pseudovector $\eta N$ coupling constants are calculated from an effective vertex associated with the $a_0(980)\pi N$ triangle diagram. The predicted values are in agreement with the ones concluded from fitting $\eta $…
We study the size of connected components of random nearest-neighbor graphs with vertex set the points of a homogeneous Poisson point process in ${\mathbb{R}}^d$. The connectivity function is shown to decay superexponentially, and we…
An intriguing unanswered question about the evolution of bilateral animals with internal skeletons is how an internal skeleton evolved in the first place. Computational modeling of the development of bilateral symmetric organisms suggests…
We consider the problem of maintaining the Euclidean Delaunay triangulation $\DT$ of a set $P$ of $n$ moving points in the plane, along algebraic trajectories of constant description complexity. Since the best known upper bound on the…
We study the labelled growth rate of an $\omega$-categorical structure $\mathfrak{A}$, i.e., the number of orbits of $Aut(\mathfrak{A})$ on $n$-tuples of distinct elements, and show that the model-theoretic property of monadic stability…
The orbital evolution and stability of planetary systems with interaction from the belts is studied using the standard phase-plane analysis. In addition to the fixed point which corresponds to the Keplerian orbit, there are other fixed…
A discrete Gelfand-Tsetlin pattern is a configuration of particles in Z^2. The particles are arranged in a finite number of consecutive rows, numbered from the bottom. There is one particle on the first row, two particles on the second row,…
Most existing popular methods for learning graph embedding only consider fixed-order global structural features and lack structures hierarchical representation. To address this weakness, we propose a novel graph embedding algorithm named…
A total dominating set of a graph $G=(V,E)$ is a subset $D \subseteq V$ such that every vertex in $V$ is adjacent to some vertex in $D$. Finding a total dominating set of minimum size is NP-hard on planar graphs and W[2]-complete on general…
The complexity of a finite connected graph is its number of spanning trees; for a non-connected graph it is the product of complexities of its connected components. If $G$ is an infinite graph with cofinite free ${\mathbb Z}^d$-symmetry,…
We study large uniform random maps with one face whose genus grows linearly with the number of edges. They can be seen as a model of discrete hyperbolic geometry. In the past, several of these hyperbolic geometric features have been…
We study structural properties of growing networks where both addition and deletion of nodes are possible. Our model network evolves via two independent processes. With rate r, a node is added to the system and this node links to a randomly…
The aim of this work is to study the asymptotic behavior of a structure made of plates of thickness $2\delta$ when $\delta\to 0$. This study is carried on within the frame of linear elasticity by using the unfolding method. It is based on…
It is believed that, much like a cat's cradle, the cytoskeleton can be thought of as a network of strings under tension. We show that both regular and random bond-disordered networks having bonds that buckle upon compression exhibit a…
A set of graphs is said to be independent if there is no homomorphism between distinct graphs from the set. We consider the existence problems related to the independent sets of countable graphs. While the maximal size of an independent set…
We consider the problem of extending the drawing of a subgraph of a given plane graph to a drawing of the entire graph using straight-line and polyline edges. We define the notion of star complexity of a polygon and show that a drawing…