On the public citation graph

A One-Parameter Family of Distributed Consensus Algorithms with Boundary: From Shortest Paths to Mean Hitting Times

0 signed · 68 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/(sici)1099-0747(199809)14:3<241::aid-asm354>3.0.co;2-3openalex-snapshot
Hitting time in a finite non-homogeneous Markov chain with applications
inferredcites →https://doi.org/10.1007/3-540-61769-8openalex-snapshot
Distributed Algorithms
inferredcites →https://doi.org/10.1007/bfb0022433openalex-snapshot
Distributed Algorithms
inferredcites →https://doi.org/10.1017/cbo9780511804441openalex-snapshot
Convex Optimization
inferredcites →https://doi.org/10.1080/01621459.1974.10480137openalex-snapshot
Reaching a Consensus
inferredcites →https://doi.org/10.1109/acc.2005.1470209openalex-snapshot
Analysis and design tools for distributed motion coordination
inferredcites →https://doi.org/10.1109/cdc.2004.1429543openalex-snapshot
On geographic routing without location information
inferredcites →https://doi.org/10.1109/cdc.2005.1582620openalex-snapshot
Convergence in Multiagent Coordination, Consensus, and Flocking
inferredcites →https://doi.org/10.1109/cdc.2005.1583298openalex-snapshot
Distributed Consensus in Networks of Dynamic Agents
inferredcites →https://doi.org/10.1109/ipsn.2005.1440896openalex-snapshot
A scheme for robust distributed sensor fusion based on average consensus
inferredcites →https://doi.org/10.1109/tac.2003.812781openalex-snapshot
Coordination of groups of mobile autonomous agents using nearest neighbor rules
inferredcites →https://doi.org/10.1109/tac.2004.834113openalex-snapshot
Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
inferredcites →https://doi.org/10.1109/tac.2004.841888openalex-snapshot
Stability of multiagent systems with time-dependent communication links
inferredcites →https://doi.org/10.1112/blms/24.2.205openalex-snapshot
PROBABILITY: THEORY AND EXAMPLES
inferredcites →https://doi.org/10.1137/050645452openalex-snapshot
Minimizing Effective Resistance of a Graph
inferredcites →https://doi.org/10.12681/eadd/3778openalex-snapshot
PROBLEMS IN DECENTRALIZED DECISION MAKING AND COMPUTATION
inferredcites →https://doi.org/10.3182/20050703-6-cz-1902.02086openalex-snapshot
ANALYSIS OF COORDINATION IN MULTI-AGENT SYSTEMS THROUGH PARTIAL DIFFERENCE EQUATIONS. PART I: THE LAPLACIAN CONTROL
inferredcites →https://doi.org/10.5555/1147685.1147698openalex-snapshot
A scheme for robust distributed sensor fusion based on average consensus
inferredcites →https://doi.org/10.5948/upo9781614440222openalex-snapshot
Random Walks and Electric Networks

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.5107497openalex-extracted
Nonlinear Fixed Points and Stationarity: Economic Applications
inferred← citeshttps://doi.org/10.1016/j.amc.2015.10.090openalex-snapshot
Distributed adaptive control of linear multi-agent systems with event-triggered communications
inferred← citeshttps://doi.org/10.1016/j.automatica.2014.10.051openalex-snapshot
Distributed algebraic connectivity estimation for undirected graphs with upper and lower bounds
inferred← citeshttps://doi.org/10.1016/j.automatica.2017.01.009openalex-snapshot
Analysis and applications of spectral properties of grounded Laplacian matrices for directed networks
inferred← citeshttps://doi.org/10.1016/j.ejcon.2020.05.010openalex-snapshot
Consensus in networks of uncertain euler-lagrange agents using adaptive gravity compensation
inferred← citeshttps://doi.org/10.1016/j.inffus.2020.09.001openalex-snapshot
Distributed combination of belief functions
inferred← citeshttps://doi.org/10.1016/j.jfranklin.2015.12.008openalex-snapshot
Distributed control for large-scale systems with adaptive event-triggering
inferred← citeshttps://doi.org/10.1016/j.knosys.2024.112105openalex-snapshot
Sparse randomized policies for Markov decision processes based on Tsallis divergence regularization
inferred← citeshttps://doi.org/10.1016/j.neucom.2007.11.040openalex-snapshot
Tuning continual exploration in reinforcement learning: An optimality property of the Boltzmann strategy
inferred← citeshttps://doi.org/10.1016/j.neunet.2017.03.010openalex-snapshot
A bag-of-paths framework for network data analysis
inferred← citeshttps://doi.org/10.1016/j.patcog.2010.11.020openalex-snapshot
A sum-over-paths extension of edit distances accounting for all sequence alignments
inferred← citeshttps://doi.org/10.1016/j.sigpro.2012.12.002openalex-snapshot
Distributed computation of the Fiedler vector with application to topology inference in ad hoc networks
inferred← citeshttps://doi.org/10.1109/acc.2012.6315110openalex-snapshot
Distributed algebraic connectivity estimation for adaptive event-triggered consensus
inferred← citeshttps://doi.org/10.1109/acssc.2013.6810313openalex-snapshot
Max-consensus using the soft maximum
inferred← citeshttps://doi.org/10.1109/cdc40024.2019.9028897openalex-snapshot
Distributed Algorithm for Solving the Bottleneck Assignment Problem
inferred← citeshttps://doi.org/10.1109/cdc45484.2021.9683232openalex-snapshot
Distributed tracking of graph parameters in anonymous networks with time-varying topology
inferred← citeshttps://doi.org/10.1109/cdc51059.2022.9992539openalex-snapshot
Diffusion of Information on Networked Lattices by Gossip
inferred← citeshttps://doi.org/10.1109/icassp.2013.6638871openalex-snapshot
Distributed particle filtering in the presence of mutually correlated sensor noises
inferred← citeshttps://doi.org/10.1109/icat.2009.5348437openalex-snapshot
Max-consensus in a max-plus algebraic setting: The case of fixed communication topologies
inferred← citeshttps://doi.org/10.1109/icca51439.2020.9264376openalex-snapshot
Log-sum-exp Optimization based on Continuous Piecewise Linearization Techniques
inferred← citeshttps://doi.org/10.1109/iros.2016.7759245openalex-snapshot
Log-space harmonic function path planning
inferred← citeshttps://doi.org/10.1109/jsen.2016.2612642openalex-snapshot
Max Consensus in Sensor Networks: Non-Linear Bounded Transmission and Additive Noise
inferred← citeshttps://doi.org/10.1109/jsen.2018.2840048openalex-snapshot
Distributed Network Center and Size Estimation
inferred← citeshttps://doi.org/10.1109/lcsys.2020.2973594openalex-snapshot
Min-Consensus for Heterogeneous Higher-Order Integrators Under Switching Digraph
inferred← citeshttps://doi.org/10.1109/lcsys.2025.3582204openalex-snapshot
Discrete Distributed Estimation of Algebraic Connectivity and Fiedler Vector
inferred← citeshttps://doi.org/10.1109/msp.2012.2232713openalex-snapshot
Seeing the Bigger Picture: How Nodes Can Learn Their Place Within a Complex Ad Hoc Network Topology
inferred← citeshttps://doi.org/10.1109/sami.2019.8782748openalex-snapshot
Vulnerability of Average Consensus Algorithm: Impact of Stochastic Communication Breakdowns on Generalized Metropolis-Hastings Weight Design
inferred← citeshttps://doi.org/10.1109/spawc.2019.8815597openalex-snapshot
A Scalable Max-Consensus Protocol For Noisy Ultra-Dense Networks
inferred← citeshttps://doi.org/10.1109/tac.2021.3135452openalex-snapshot
Dynamic Min and Max Consensus and Size Estimation of Anonymous Multiagent Networks
inferred← citeshttps://doi.org/10.1109/tac.2023.3279336openalex-snapshot
A Distributed Augmenting Path Approach for the Bottleneck Assignment Problem
inferred← citeshttps://doi.org/10.1109/tcns.2026.3667758openalex-snapshot
Distributed Priority-Based Load Shedding Over Time-Varying Communication Networks
inferred← citeshttps://doi.org/10.1109/tpami.2009.78openalex-snapshot
The Sum-over-Paths Covariance Kernel: A Novel Covariance Measure between Nodes of a Directed Graph
inferred← citeshttps://doi.org/10.1109/tpwrs.2014.2360369openalex-snapshot
A Fully Decentralized Approach for Solving the Economic Dispatch Problem
inferred← citeshttps://doi.org/10.1109/tro.2020.3014521openalex-snapshot
Intermittent Connectivity Maintenance With Heterogeneous Robots
inferred← citeshttps://doi.org/10.1109/tsipn.2018.2866322openalex-snapshot
Improved Bounds for Max Consensus in Wireless Networks
inferred← citeshttps://doi.org/10.1109/tsipn.2019.2945639openalex-snapshot
Analysis and Design of Robust Max Consensus for Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/tsp.2025.3531292openalex-snapshot
Distributed Center-Based Clustering: A Unified Framework
inferred← citeshttps://doi.org/10.1145/1401890.1401984openalex-snapshot
A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances
inferred← citeshttps://doi.org/10.1162/neco.2009.11-07-643openalex-snapshot
Randomized Shortest-Path Problems: Two Related Models
inferred← citeshttps://doi.org/10.13164/re.2017.0479openalex-snapshot
Distributed Aggregate Function Estimation by Biphasically Configured Metropolis-Hasting Weight Model
inferred← citeshttps://doi.org/10.1515/9781400831470openalex-snapshot
Distributed Control of Robotic Networks
inferred← citeshttps://doi.org/10.23919/ae.2019.8867038openalex-snapshot
On Comparative Study of Deterministic Linear Consensus-based Algorithms for Distributed Summing
inferred← citeshttps://doi.org/10.23919/chicc.2018.8483298openalex-snapshot
Maximum Capability of Feedback Control for Network Systems
inferred← citeshttps://doi.org/10.23919/ecc.2018.8550443openalex-snapshot
When to stop iterating in digraphs of unknown size? An application to finite-time average consensus
inferred← citeshttps://doi.org/10.3182/20100830-3-de-4013.00030openalex-snapshot
Max-Consensus in a Max-Plus Algebraic Setting: The Case of Switching Communication Topologies
inferred← citeshttps://doi.org/10.3182/20140824-6-za-1003.00761openalex-snapshot
Distributed parameter estimation for adaptive event-triggered control
inferred← citeshttps://doi.org/10.48550/arxiv.1511.00573openalex-snapshot
From random walks to distances on unweighted graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1701.03186openalex-snapshot
Feedback Capacity over Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1807.04551openalex-snapshot
A Constrained Randomized Shortest-Paths Framework for Optimal Exploration
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.