Related papers: On growing connected beta-skeletons
We study connected graphs with a fixed degree sequence, in the sparse setting where the number of edges grows linearly in the number of vertices. Using the relation to the configuration model, we identify the number of such connected graphs…
Given a connected graph $G=(V,E)$ and a length function $\ell:E\to {\mathbb R}$ we let $d_{v,w}$ denote the shortest distance between vertex $v$ and vertex $w$. A $t$-spanner is a subset $E'\subseteq E$ such that if $d'_{v,w}$ denotes…
Purpose: Our objective is to apply an improved statistical global model of beta^- decay half-life systematics [1] generated by machine-learning techniques to the prediction of beta half-lives relevant to r-process nuclei. The primary aim of…
We study a simple model in which the growth of a network is determined by the location of one or more random walkers. Depending on walker speed, the model generates a spectrum of structures situated between well-known limiting cases. We…
We provide simple schemes to build Bayesian Neural Networks (BNNs), block by block, inspired by a recent idea of computation skeletons. We show how by adjusting the types of blocks that are used within the computation skeleton, we can…
One of the most celebrated findings in complex systems in the last decade is that different indexes y (e.g., patents) scale nonlinearly with the population~x of the cities in which they appear, i.e., $y\sim x^\beta, \beta \neq 1$. More…
Are the embeddings of a graph's degenerate core stable? What happens to the embeddings of nodes in the degenerate core as we systematically remove periphery nodes (by repeated peeling off $k$-cores)? We discover three patterns w.r.t.…
In magnetic confinement fusion devices, the ratio of the plasma pressure to the magnetic field energy, $\beta$, can become sufficiently large that electromagnetic microinstabilities become unstable, driving turbulence that distorts or…
The erosion of a set in Euclidean space by a radius r>0 is the subset of X consisting of points at distance >/-r from the complement of X. A set is resilient to erosion if it is similar to its erosion by some positive radius. We give a…
If the parameter $tan \beta$ of the minimal supersymmetric model is large, then $b$ and $\tau$ Yukawa interactions are important. These can significantly modify the masses and decays of sparticles. We describe new calculations which allow a…
The planted bisection model is a random graph model in which the nodes are divided into two equal-sized communities and then edges are added randomly in a way that depends on the community membership. We establish necessary and sufficient…
Results for $\beta$-functions and anomalous dimensions in general scalar fermion theories are presented to three loops. Various constraints on the individual coefficients for each diagram following from supersymmetry are analysed. The…
We construct a conformally invariant random family of closed curves in the plane by welding of random homeomorphisms of the unit circle. The homeomorphism is constructed using the exponential of $\beta X$ where $X$ is the restriction of the…
The eye grows during childhood to position the retina at the correct distance behind the lens to enable focused vision, a process called emmetropization. Animal studies have demonstrated that this growth process is dependent upon visual…
We introduce a new, simplified model of proteins, which we call protein metastructure. The metastructure of a protein carries information about its secondary structure and $\beta$-strand conformations. Furthermore, protein metastructure…
A spatial scale-free network is introduced and studied whose motivation has been originated in the growing Internet as well as the Airport networks. We argue that in these real-world networks a new node necessarily selects one of its…
For any $\beta > 1$, let $T_\beta: [0,1)\rightarrow [0,1)$ be the $\beta$-transformation defined by $T_\beta x=\beta x \mod 1$. We study the uniform recurrence properties of the orbit of a point under the $\beta$-transformation to the point…
A $k$-block in a graph $G$ is a maximal set of at least $k$ vertices no two of which can be separated in $G$ by fewer than $k$ other vertices. The block number $\beta(G)$ of $G$ is the largest integer $k$ such that $G$ has a $k$-block. We…
We present analytical results for the emerging structure of networks that evolve via a combination of growth (by node addition and random attachment) and contraction (by random node deletion). To this end we consider a network model in…
Consider a stationary Poisson process $\eta$ in a $d$-dimensional hyperbolic space of constant curvature $-\varkappa$ and let the points of $\eta$ together with a fixed origin $o$ be the vertices of a graph. Connect each point $x\in\eta$…