:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Maranzatto, Thomas Jacob, Ulukus, Sennur
Format:	Preprint
Published:	2025
Subjects:	Information Theory Probability
Online Access:	https://arxiv.org/abs/2509.13981
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Age of Gossip With Time-Varying Topologies
by: Srivastava, Arunabh, et al.
Published: (2024)

Age of Gossip with the Push-Pull Protocol
by: Srivastava, Arunabh, et al.
Published: (2024)

Information Freshness in Dynamic Gossip Networks
by: Srivastava, Arunabh, et al.
Published: (2025)

Information Degradation and Misinformation in Gossip Networks
by: Maranzatto, Thomas Jacob, et al.
Published: (2025)

Age of Gossip in Random and Bipartite Networks
by: Maranzatto, Thomas Jacob
Published: (2024)

Age of gossip from connective properties via first passage percolation
by: Maranzatto, Thomas Jacob, et al.
Published: (2024)

Mobility in Age-Based Gossip Networks
by: Srivastava, Arunabh, et al.
Published: (2024)

Age of Gossip With Cellular Drone Mobility
by: Srivastava, Arunabh, et al.
Published: (2026)

Age of Gossip in Ring Networks With Non-Poisson Updates
by: Srivastava, Arunabh, et al.
Published: (2026)

Incentive Attacks in BTC: Short-Term Revenue Changes and Long-Term Efficiencies
by: Doger, Mustafa, et al.
Published: (2025)

Age of Job Completion Minimization with Stable Queues
by: Mitrolaris, Stavros, et al.
Published: (2025)

Temporary Power Adjusting Withholding Attack
by: Doger, Mustafa, et al.
Published: (2026)

An Incentive-Compatible Semi-Parallel Proof-of-Work Protocol
by: Doger, Mustafa, et al.
Published: (2025)

When Should Selfish Miners Double-Spend?
by: Doger, Mustafa, et al.
Published: (2025)

Age of Gossip in Networks with Multiple Views of a Source
by: Khojastepour, Kian J., et al.
Published: (2024)

Private Information Retrieval on Multigraph-Based Replicated Storage
by: Meel, Shreya, et al.
Published: (2025)

Double Spending Analysis of Nakamoto Consensus for Time-Varying Mining Rates with Ruin Theory
by: Doger, Mustafa, et al.
Published: (2024)

New Capacity Bounds for PIR on Graph and Multigraph-Based Replicated Storage
by: Kong, Xiangliang, et al.
Published: (2025)

Optimizing Profitability in Timely Gossip Networks
by: Kaswan, Priyanka, et al.
Published: (2024)

Age of Estimates: When to Submit Jobs to a Markov Machine to Maximize Revenue
by: Liyanaarachchi, Sahan, et al.
Published: (2025)

Semi-Markov Decision Process Framework for Age of Incorrect Information Minimization
by: Cosandal, Ismail, et al.
Published: (2025)

Age of Information with Age-Dependent Server Selection
by: Akar, Nail, et al.
Published: (2025)

Age of Information in a Single-Source Generate-at-Will Dual-Server Status Update System
by: Akar, Nail, et al.
Published: (2024)

Minimizing Functions of Age of Incorrect Information for Remote Estimation
by: Cosandal, Ismail, et al.
Published: (2025)

Equidistant-Sample or Wait-and-Sample to Minimize Age Under Sampling Constraint?
by: Banerjee, Subhankar, et al.
Published: (2025)

Preemptive Scheduling for Age of Job Minimization in Task-Specific Machine Networks
by: Banerjee, Subhankar, et al.
Published: (2026)

How Far Back in Time a Digital Twin Reflects the State of the Physical Object: Age of Staleness
by: Cosandal, Ismail, et al.
Published: (2026)

$r$Age-$k$: Communication-Efficient Federated Learning Using Age Factor
by: Mortaheb, Matin, et al.
Published: (2024)

Timely Tracking of a Wiener Process With Single Bit Quantization
by: Cosandal, Ismail, et al.
Published: (2025)

Utilizing the Perceived Age to Maximize Freshness in Query-Based Update Systems
by: Liyanaarachchi, Sahan, et al.
Published: (2026)

Source Coding for a Wiener Process
by: Liyanaarachchi, Sahan, et al.
Published: (2025)

Minimizing Age of Information with Generate at Will Status Updates and Age-Agnostic Cyclic Scheduling
by: Gamgam, Ege Orkun, et al.
Published: (2023)

Optimum Monitoring and Job Assignment with Multiple Markov Machines
by: Liyanaarachchi, Sahan, et al.
Published: (2025)

Optimal Source Coding of Markov Chains for Real-Time Remote Estimation
by: Cosandal, Ismail, et al.
Published: (2025)

Scalable Cyclic Schedulers for Age of Information Optimization in Large-Scale Status Update Systems
by: Akar, Nail, et al.
Published: (2024)

Age-Based Scheduling for a Memory-Constrained Quantum Switch
by: Mitrolaris, Stavros, et al.
Published: (2026)

CAFe: Cost and Age aware Federated Learning
by: Liyanaarachchi, Sahan, et al.
Published: (2024)

Minimizing the Age of Two Heterogeneous Sources With Packet Drops Via Cyclic Schedulers
by: Liyanaarachchi, Sahan, et al.
Published: (2024)

Query-Based Sampling of Heterogeneous CTMCs: Modeling and Optimization with Binary Freshness
by: Akar, Nail, et al.
Published: (2023)

HetDAPAC: Leveraging Attribute Heterogeneity in Distributed Attribute-Based Private Access Control
by: Meel, Shreya, et al.
Published: (2025)