Related papers: The typical cell in anisotropic tessellations
Segregation of different cell types is a crucial process for the pattern formation in tissues, in particular during embryogenesis. Since the involved cell interactions are complex and difficult to measure individually in experiments,…
Many social and biological networks consist of communities - groups of nodes within which connections are dense, but between which connections are sparser. Recently, there has been considerable interest in designing algorithms for detecting…
The spatial structure of the cell is highly organized at all levels: from small complexes and assemblies, to local nano- and micro-clusters, to global, micrometer scales across and between cells. We suggest that this multiscale spatial cell…
Various important and useful quantities or measures that characterize the topological network structure are usually investigated for a network, then they are averaged over the samples. In this paper, we propose an explicit representation by…
Traditional random graph models of networks generate networks that are locally tree-like, meaning that all local neighborhoods take the form of trees. In this respect such models are highly unrealistic, most real networks having strongly…
In literature, a stochastic model for spreading nodes in a cellular cell is available. Despite its existence, the current method does not offer any versatility in dealing with sectored layers. Of course, this needed adaptability could be…
During development, spatio-temporal patterns ranging from checkerboard to engulfing occur with precise proportions of the respective cell fates. Key developmental regulators are intracellular transcriptional interactions and intercellular…
Owing to its unparalleled tractability, the Poisson point process (PPP) has emerged as a popular model for the analysis of cellular networks. Considering a stationary point process of users, which is independent of the base station (BS)…
Cell complexes are topological spaces constructed from simple blocks called cells. They generalize graphs, simplicial complexes, and polyhedral complexes that form important domains for practical applications. They also provide a…
Three-dimensional random tessellations that are stable under iteration (STIT tessellations) are considered. They arise as a result of subsequent cell division, which implies that their cells are not face-to-face. The edges of the…
In this paper, we introduce an analytical framework to compute the average rate of downlink heterogeneous cellular networks. The framework leverages recent application of stochastic geometry to other-cell interference modeling and analysis.…
Networks are widely used in the biological, physical, and social sciences as a concise mathematical representation of the topology of systems of interacting components. Understanding the structure of these networks is one of the outstanding…
Many real life networks present an average path length logarithmic with the number of nodes and a degree distribution which follows a power law. Often these networks have also a modular and self-similar structure and, in some cases -…
It is becoming increasingly common to see large collections of network data objects -- that is, data sets in which a network is viewed as a fundamental unit of observation. As a result, there is a pressing need to develop network-based…
The topology of many real complex networks has been conjectured to be embedded in hidden metric spaces, where distances between nodes encode their likelihood of being connected. Besides of providing a natural geometrical interpretation of…
A random recursive cell splitting scheme of the $2$-dimensional unit sphere is considered, which is the spherical analogue of the STIT tessellation process from Euclidean stochastic geometry. First-order moments are computed for a large…
Spatially homogeneous random tessellations that are stable under iteration (nesting) in the 3-dimensional Euclidean space are considered, so-called STIT tessellations. They arise as outcome of a spatio-temporal process of subsequent cell…
Directed acyclic graphs are a fundamental class of networks that includes citation networks, food webs, and family trees, among others. Here we define a random graph model for directed acyclic graphs and give solutions for a number of the…
Analytical description of propagation phenomena on random networks has flourished in recent years, yet more complex systems have mainly been studied through numerical means. In this paper, a mean-field description is used to coherently…
We study the urban-scale macroscopic traffic flow in city networks. Star graph is considered as traffic network. Star graphs with controlled traffic flow are transformed to various cell-transmission graphs by using the cell transmission…