Related papers: Modeling Shortest Paths in Polymeric Networks usin…
The first-passage time (FPT), i.e., the moment when a stochastic process reaches a given threshold value for the first time, is a fundamental mathematical concept with immediate applications. In particular, it quantifies the statistics of…
Polymerization and formation of crosslinked polymer networks are important processes in manufacturing, materials fabrication, and in the case of hydrated polymer networks, synthesis of biomedical materials, drug delivery, and tissue…
Transport is an important function of networks. Studying transport efficiency sheds light on the dynamic processes occurring within various underlying structures and offers a wide range of applications. To construct networks with different…
An analytic effective medium theory is constructed to study the mean access times for random walks on hybrid disordered structures formed by embedding complex networks into regular lattices, considering transition rates $F$ that are…
A hypergraph is a generalization of a graph that arises naturally when attribute-sharing among entities is considered. Compared to graphs, hypergraphs have the distinct advantage that they contain explicit communities and are more…
Through this research, embedded synthetic fracture networks in rock masses are studied. To analysis the fluid flow complexity in fracture networks with respect to the variation of connectivity patterns, two different approaches are…
We consider the problem of a Parameter Server (PS) that wishes to learn a model that fits data distributed on the nodes of a graph. We focus on Federated Learning (FL) as a canonical application. One of the main challenges of FL is the…
The concept of continuous-time random walks (CTRW) is a generalization of ordinary random walk models, and it is a powerful tool for investigating a broad spectrum of phenomena in natural, engineering, social and economic sciences.…
A vast variety of real-life networks display the ubiquitous presence of scale-free phenomenon and small-world effect, both of which play a significant role in the dynamical processes running on networks. Although various dynamical processes…
The present work extends the randomized shortest-paths framework (RSP), interpolating between shortest-path and random-walk routing in a network, in three directions. First, it shows how to deal with equality constraints on a subset of…
We investigate random walks on complex networks and derive an exact expression for the mean first passage time (MFPT) between two nodes. We introduce for each node the random walk centrality $C$, which is the ratio between its coordination…
We study diffusion with a bias towards a target node in networks. This problem is relevant to efficient routing strategies in emerging communication networks like optical networks. Bias is represented by a probability $p$ of the…
In this work, we consider a modification of the usual Branching Random Walk (BRW), where we give certain independent and identically distributed (i.i.d.) displacements to all the particles at the $n$-th generation, which may be different…
The Virtual Network Embedding Problem (VNEP) considers the efficient allocation of resources distributed in a substrate network to a set of request networks. Many existing works discuss either heuristics or exact algorithms, resulting in a…
This work extends the randomized shortest paths (RSP) model by investigating the net flow RSP and adding capacity constraints on edge flows. The standard RSP is a model of movement, or spread, through a network interpolating between a…
The random walk is one of the most basic dynamic properties of complex networks, which has gradually become a research hotspot in recent years due to its many applications in actual networks. An important characteristic of the random walk…
Continuous 2-dimensional space is often discretized by considering a mesh of weighted cells. In this work we study how well a weighted mesh approximates the space, with respect to shortest paths. We consider a shortest path $…
As large graph datasets become increasingly common across many fields, sampling is often needed to reduce the graphs into manageable sizes. This procedure raises critical questions about representativeness as no sample can capture the…
We design a method to optimize the global mean first-passage time (GMFPT) of multiple random walkers searching in complex networks for a general target, without specifying the property of the target node. According to the Laplace…
In this paper, we present a new approach to the discrete version of the Wormlike Chain Model (WCM) of semiflexible polymers. Our solution to the model is based on a new computational technique called the Generalized Borel Transform (GBT)…