相关论文: On the Exponential Growth of Geometric Shapes

In this work, we investigate novel algorithmic growth processes. In particular, we propose three growth operations, full doubling, RC doubling and doubling, and explore the algorithmic and structural properties of their resulting processes…

We generalize the exactly solvable corner growth models by choosing the rate of the exponential distribution $a_i+b_j$ and the parameter of the geometric distribution $a_i b_j$ at site $(i, j)$, where $(a_i)_{i \ge 1}$ and $(b_j)_{j \ge 1}$…

We study a new algorithmic process of graph growth which starts from a single initial vertex and operates in discrete time-steps, called \emph{slots}. In every slot, the graph grows via two operations (i) vertex generation and (ii) edge…

Recent researches on complex systems highlighted the so-called super-linear growth phenomenon. As the system size $P$ measured as population in cities or active users in online communities increases, the total activities $X$ measured as GDP…

Let $K = \mathbb{Q}(\sqrt{-3})$ or $\mathbb{Q}(\sqrt{-1})$ and let $C_n$ denote the cyclic group of order $n$. We study how the torsion part of an elliptic curve over $K$ grows in a quadratic extension of $K$. In the case $E(K)[2] \approx…

Let $K = \mathbb{Q}(\sqrt{-3})$ or $\mathbb{Q}(\sqrt{-1})$ and let $C_n$ denote the cyclic group of order $n$. We study how the torsion part of an elliptic curve over $K$ grows in a quadratic extension of $K$. In the case $E(K)[2] \approx…

We investigate a network growth model in which the genealogy controls the evolution. In this model, a new node selects a random target node and links either to this target node, or to its parent, or to its grandparent, etc; all nodes from…

For each integer $k \geq 2$, we introduce a sequence of $k$-ary discrete trees constructed recursively by choosing at each step an edge uniformly among the present edges and grafting on "its middle" $k-1$ new edges. When $k=2$, this…

In the \emph{$k$-Diameter-Optimally Augmenting Tree Problem} we are given a tree $T$ of $n$ vertices as input. The tree is embedded in an unknown \emph{metric} space and we have unlimited access to an oracle that, given two distinct…

We study the macroscopic evolution of the growing cluster in the exactly solvable corner growth model with independent exponentially distributed waiting times. The rates of the exponentials are given by an addivitely separable function of…

We revisit the \textsc{$k$-Secluded Tree} problem. Given a vertex-weighted undirected graph $G$, its objective is to find a maximum-weight induced subtree $T$ whose open neighborhood has size at most $k$. We present a fixed-parameter…

We show that for a number of parameterized problems for which only $2^{O(k)} n^{O(1)}$ time algorithms are known on general graphs, subexponential parameterized algorithms with running time $2^{O(k^{1-\frac{1}{1+\delta}} \log^2 k)}…

One interesting question is how a graph develops from some constrained random graph process, which is a fundamental mechanism in the formation and evolution of dynamic networks. The problem here is referred to the random $K_k$-removal…

We present a general approach to study a class of random growth models in $n$-dimensional Euclidean space. These models are designed to capture basic growth features which are expected to manifest at the mesoscopic level for several…

Complex systems have motivated continuing interest from the scientific community, leading to new concepts and methods. Growing systems represent a case of particular interest, as their topological, geometrical, and also dynamical properties…

A growing random graph is constructed by successively sampling without replacement an element from the pool of virtual vertices and edges. At start of the process the pool contains $N$ virtual vertices and no edges. Each time a vertex is…

Geometric evolution represents a fundamental aspect of many physical phenomena. In this paper we consider the geometric evolution of structures that undergo topological changes. Topological changes occur when the shape of an object evolves…

We consider a class of stochastic growth models on the integer lattice which includes various interesting examples such as the number of open paths in oriented percolation and the binary contact path process. Under some mild assumptions, we…

Networks are mathematical structures that are universally used to describe a large variety of complex systems such as the brain or the Internet. Characterizing the geometrical properties of these networks has become increasingly relevant…

Finding the most powerful node in a dynamic random network, the largest set in a partition-valued stochastic process, or the largest family in an evolving population at a given time, can be a very difficult problem. This is particularly the…