Network Evolution With Mesoscopic Delays

ABSTRACT Owing to the influence of real‐world networks both in science and society, numerous mathematical models have been developed to understand the structure and evolution of these systems, particularly in a temporal context. Recent advancements in fields like distributed cyber‐security and social networks have spurred the creation of probabilistic models of evolution, where individuals make decisions based on only partial information about the network's current state. This paper seeks to explore models incorporating network delay , where new participants receive information from a time‐lagged snapshot of the system. In the context of mesoscopic network delays, we develop probabilistic tools built on stochastic approximation to understand asymptotics of both local functionals, such as local neighborhoods and degree distributions, as well as global properties, such as the evolution of the degree of the network's initial founder. A companion paper (Banerjee et al. 2024) explores the regime of macroscopic delays in the evolution of the network.

Authors

Institutions

Publication Details

Journal
Random Structures and Algorithms
Published
2025-09-01
DOI
https://doi.org/10.1002/rsa.70029
Citations
1
Primary Topic
Complex Network Analysis Techniques
Type
article
Field-Weighted Citation Impact
1.32

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Network Evolution With Mesoscopic Delays

Partha S. Dey, Shankar Bhamidi, Sayan Banerjee, Akshay Sakanaveeti
1 citations
Random Structures and Algorithms
Complex Network Analysis Techniques
1.32
article

Network Evolution With Mesoscopic Delays

Partha S. Dey, Shankar Bhamidi, Sayan Banerjee, Akshay Sakanaveeti
article en
1 citations

Abstract

ABSTRACT Owing to the influence of real‐world networks both in science and society, numerous mathematical models have been developed to understand the structure and evolution of these systems, particularly in a temporal context. Recent advancements in fields like distributed cyber‐security and social networks have spurred the creation of probabilistic models of evolution, where individuals make decisions based on only partial information about the network's current state. This paper seeks to explore models incorporating network delay , where new participants receive information from a time‐lagged snapshot of the system. In the context of mesoscopic network delays, we develop probabilistic tools built on stochastic approximation to understand asymptotics of both local functionals, such as local neighborhoods and degree distributions, as well as global properties, such as the evolution of the degree of the network's initial founder. A companion paper (Banerjee et al. 2024) explores the regime of macroscopic delays in the evolution of the network.

Random Structures and AlgorithmsVol. 67(2)
University of North Carolina at Chapel Hill (US), University of Illinois Urbana-Champaign (US)
National Science Foundation, Division of Mathematical Sciences
Openalex Percentile: Top 16%
Complex Network Analysis Techniques
1.32
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.