Related papers: Modeling Shortest Paths in Polymeric Networks usin…
We present analytical results for the distribution of first hitting times of random walkers (RWs) on directed Erd\H{o}s-R\'enyi (ER) networks. Starting from a random initial node, a random walker hops randomly along directed edges between…
We consider the stochastic geometry model where the location of each node is a random point in a given metric space, or the existence of each node is uncertain. We study the problems of computing the expected lengths of several…
As written by statistician George Box "All models are wrong, but some are useful", standard diffusion derivation or Feynman path ensembles use nonphysical infinite velocity/kinetic energy nowhere differentiable trajectories - what seems…
The first-passage time (FPT) is the time it takes a system variable to cross a given boundary for the first time. In the context of Markov networks, the FPT is the time a random walker takes to reach a particular node (target) by hopping…
To reduce the latency of Backpressure (BP) routing in wireless multi-hop networks, we propose to enhance the existing shortest path-biased BP (SP-BP) and sojourn time-based backlog metrics, since they introduce no additional time step-wise…
We study the first passage time for a polymer, that we call the narrow encounter time (NETP), to reach a small target located on the surface of a microdomain. The polymer is modeled as a Freely Joint Chain (beads connected by springs with a…
Modeling of polymer chains has received a lot of attention in mathematics. In fact, probabilistic models that naturally arise in statistical mechanics have been widely studied by mathematicians for the very challenging and novel problems…
To find a shortest path between two nodes $s_0$ and $s_1$ in a given graph, a classical approach is to start a Breadth-First Search (BFS) from $s_0$ and run it until the search discovers $s_1$. Alternatively, one can start two Breadth-First…
We describe a novel approach to statistical learning from particles tracked while moving in a random environment. The problem consists in inferring properties of the environment from recorded snapshots. We consider here the case of a fluid…
As social network analysis (SNA) has drawn much attention in recent years, one bottleneck of SNA is these network data are too massive to handle. Furthermore, some network data are not accessible due to privacy problems. Therefore, we have…
Properties of networks are often characterized in terms of features such as node degree distributions, average path lengths, diameters, or clustering coefficients. Here, we study shortest path length distributions. On the one hand, average…
In this study, a versatile methodology for initiating polymerization from monomers in highly cross-linked materials is investigated. As polymerization progresses, force-field parameters undergo continuous modification due to the formation…
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…
Algorithms for mining very large graphs, such as those representing online social networks, to discover the relative frequency of small subgraphs within them are of high interest to sociologists, computer scientists and marketeers alike.…
The study of dynamical systems defined on complex networks provides a natural framework with which to investigate myriad features of neural dynamics, and has been widely undertaken. Typically, however, networks employed in theoretical…
We propose a new model to account for the main structural characteristics of rock fracture networks (RFNs). The model is based on a generalization of the random neighborhood graphs to consider fractures embedded into rectangular spaces. We…
Random walk-based sampling methods are gaining popularity and importance in characterizing large networks. While powerful, they suffer from the slow mixing problem when the graph is loosely connected, which results in poor estimation…
With the pervasiveness of Stochastic Shortest-Path (SSP) problems in high-risk industries, such as last-mile autonomous delivery and supply chain management, robust planning algorithms are crucial for ensuring successful task completion…
The problems considered in the present paper have their roots in two different cultures. The 'true' (or myopic) self-avoiding walk model (TSAW) was introduced in the physics literature by Amit, Parisi and Peliti. This is a nearest neighbor…
We explore a new variant of Small-World Networks (SWNs), in which an additional parameter ($r$) sets the length scale over which shortcuts are uniformly distributed. When $r=0$ we have an ordered network, whereas $r=1$ corresponds to the…