Related papers: The Shape Theorem for Route-lengths in Connected S…
In this paper, we define a class of additive random growth models whose growth is at least and at most linear and prove an asymptotic shape theorem for these models. This proof generalizes already known proofs for the classical contact…
We generalize the asymptotic behavior of the graph distance between two uniformly chosen nodes in the configuration model to a wide class of random graphs. Among others, this class contains the Poissonian random graph, the expected degree…
We investigate a class of growing graphs embedded into the $d$-dimensional torus where new vertices arrive according to a Poisson process in time, are randomly placed in space and connect to existing vertices with a probability depending on…
Consider a homogeneous Poisson point process in a compact convex set in $d$-dimensional Euclidean space which has interior points and contains the origin. The radial spanning tree is constructed by connecting each point of the Poisson point…
An ordered hypergraph is a hypergraph $H$ with a specified linear ordering of the vertices, and the appearance of an ordered hypergraph $G$ in $H$ must respect the specified order on $V(G)$. In on-line Ramsey theory, Builder iteratively…
For a given finite graph $G$ of minimum degree at least $k$, let $G_{p}$ be a random subgraph of $G$ obtained by taking each edge independently with probability $p$. We prove that (i) if $p \ge \omega/k$ for a function $\omega=\omega(k)$…
Spatial networks, in which nodes and edges are embedded in space, play a vital role in the study of complex systems. For example, many social networks attach geo-location information to each user, allowing the study of not only topological…
One of the most intriguing findings in the structure of neural network landscape is the phenomenon of mode connectivity: For two typical global minima, there exists a path connecting them without barrier. This concept of mode connectivity…
We analyze complexity in spatial network ensembles through the lens of graph entropy. Mathematically, we model a spatial network as a soft random geometric graph, i.e., a graph with two sources of randomness, namely nodes located randomly…
Core-periphery structure is a common property of complex networks, which is a composition of tightly connected groups of core vertices and sparsely connected periphery vertices. This structure frequently emerges in traffic systems, biology,…
The space-time length R between a moving source and the observation point is calculated in order to substitute with it the spatial distance D, normally used in the Newton's law of gravitation, as well as in any inverse-square-law.…
Giving a joint generalization of a result of Brazitikos, Chasapis and Hioni and results of Giannopoulos and Milman, we prove that roughly $\left\lceil \frac{d}{(1-\vartheta)^d}\ln\frac{1}{(1-\vartheta)^d} \right\rceil$ points chosen…
Random motions on the line and on the plane with space-varying velocities are considered and analyzed in this paper. On the line we investigate symmetric and asymmetric telegraph processes with space-dependent velocities and we are able to…
We introduce an ensemble of spatial networks built from the junctions of hindered-rotation chains, incorporating directional correlations between bonds, an aspect ignored in the standard network modeling paradigm. The emergent random…
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$…
We present two complementary analytical approaches for calculating the distribution of shortest path lengths in Erdos-R\'enyi networks, based on recursion equations for the shells around a reference node and for the paths originating from…
A popular question in Bernoulli percolation models is if the probability of connection between two vertices in a transitive graph decays monotonically with the distance between these two vertices. For example, on the square lattice is an…
We investigate the optimal design of networks for a general transport system. Our network is built from a regular two-dimensional ($d=2$) square lattice to be improved by adding long-range connections (shortcuts) with probability $P_{ij}…
Let a random geometric graph be defined in the supercritical regime for the existence of a unique infinite connected component in Euclidean space. Consider the first-passage percolation model with independent and identically distributed…
We propose a bond-percolation model intended to describe the consumption, and eventual exhaustion, of resources in transport networks. Edges forming minimum-length paths connecting demanded origin-destination nodes are removed if below a…