相关论文: Geometry and Dynamics for Hierarchical Regular Net…
In recent work, Ozgur, Leveque, and Tse (2007) obtained a complete scaling characterization of throughput scaling for random extended wireless networks (i.e., $n$ nodes are placed uniformly at random in a square region of area $n$). They…
This paper presents a distributed algorithm on wireless ad-hoc networks that runs in polylogarithmic number of rounds in the size of the network and constructs a linear size, lightweight, (1+\epsilon)-spanner for any given \epsilon > 0. A…
We study the transport properties of passive inertial particles in a $2-d$ incompressible flows. Here the particle dynamics is represented by the $4-d$ dissipative embedding map of $2-d$ area-preserving standard map which models the…
Network geometry is currently a topic of growing scientific interest as it opens the possibility to explore and interpret the interplay between structure and dynamics of complex networks using geometrical arguments. However the field is…
The degree distributions of complex networks are usually considered to be power law. However, it is not the case for a large number of them. We thus propose a new model able to build random growing networks with (almost) any wanted degree…
Random walks represent an important tool for probing the structural and dynamical properties of networks and modeling transport and diffusion processes on networks. However, when individuals' movement becomes dictated by more complicated…
We propose a combinatorial and graph-theoretic theory of dropout by modeling training as a random walk over a high-dimensional graph of binary subnetworks. Each node represents a masked version of the network, and dropout induces stochastic…
For an arbitrary initial configuration of discrete loads over vertices of a distributed graph, we consider the problem of minimizing the {\em discrepancy} between the maximum and minimum loads among all vertices. For this problem, this…
Let $(G,\rho)$ be a stationary random graph, and use $B^G_{\rho}(r)$ to denote the ball of radius $r$ about $\rho$ in $G$. Suppose that $(G,\rho)$ has annealed polynomial growth, in the sense that $\mathbb{E}[|B^G_{\rho}(r)|] \leq O(r^k)$…
We propose random walks on suitably defined graphs as a framework for finescale modeling of particle motion in an obstructed environment where the particle may have interactions with the obstructions and the mean path length of the particle…
Most networks tend to show complex and multiple relationships between entities. Networks are usually modeled by graphs or hypergraphs; nonetheless a given entity can occur many times in a relationship: this brings the need to deal with…
We carry out comparative studies of random walks on deterministic Apollonian networks (DANs) and random Apollonian networks (RANs). We perform computer simulations for the mean first passage time, the average return time, the mean-square…
The generalized $k$-connectivity of a graph $G$, denoted by $\kappa_k(G)$, is the minimum number of internally edge disjoint $S$-trees for any $S\subseteq V(G)$ with $|S|=k$. The generalized $k$-connectivity is a natural extension of the…
We investigated the scaling and topology of engineered urban drainage networks (UDNs) in two cities, and further examined UDN evolution over decades. UDN scaling was analyzed using two power-law characteristics widely employed for river…
In this work we study a generalization of the standard random walk, an homotopic random walk (HRW), using a deformed translation unitary step that arises from a homotopy of the position-dependent masses associated to the Tsallis and…
In this paper we consider a representative a priori unstable Hamiltonian system with 2+1/2 degrees of freedom, to which we apply the geometric mechanism for diffusion introduced in the paper Delshams et al., Mem. Amer. Math. Soc. 2006, and…
Given a graphon $W$ and a finite simple graph $H$, with vertex set $V(H)$, denote by $X_n(H, W)$ the number of copies of $H$ in a $W$-random graph on $n$ vertices. The asymptotic distribution of $X_n(H, W)$ was recently obtained by…
We derive the most basic dynamical properties of random hyperbolic graphs (the distributions of contact and intercontact durations) in the hot regime (network temperature $T > 1$). We show that for sufficiently large networks the contact…
Over the last few years, network science has proved to be useful in modeling a variety of complex systems, composed of a large number of interconnected units. The intricate pattern of interactions often allows the system to achieve complex…
Graph Neural Networks (GNNs) have become a topic of intense research recently due to their powerful capability in high-dimensional classification and regression tasks for graph-structured data. However, as GNNs typically define the graph…