Pages that link to "Item:Q4652267"

The following pages link to Fastest Mixing Markov Chain on a Graph (Q4652267):

Displaying 50 items.

• Comparison inequalities and fastest-mixing Markov chains (Q373832) (← links)
• Distributed set-valued estimation in sensor networks with limited communication data rate (Q397747) (← links)
• Accelerating distributed average consensus by exploring the information of second-order neighbors (Q415068) (← links)
• Spectral and graph-theoretic bounds on steady-state-probability estimation performance for an ergodic Markov chain (Q430187) (← links)
• Hearing the clusters of a graph: A distributed algorithm (Q445023) (← links)
• Fast algorithm for singly linearly constrained quadratic programs with box-like constraints (Q513719) (← links)
• Fastest expected time to mixing for a Markov chain on a directed graph (Q603129) (← links)
• A sum-over-paths extension of edit distances accounting for all sequence alignments (Q632613) (← links)
• Markov chain mixing time on cycles (Q719772) (← links)
• Distributed networked set-membership filtering with ellipsoidal state estimations (Q781889) (← links)
• Optimal strategies in the average consensus problem (Q847130) (← links)
• Inequalities for the spectra of symmetric doubly stochastic matrices (Q865426) (← links)
• Optimal scaling of a gradient method for distributed resource allocation (Q868539) (← links)
• Symmetry in semidefinite programs (Q958029) (← links)
• Mean square average-consensus under measurement noises and fixed topologies: necessary and sufficient conditions (Q963793) (← links)
• Is ADMM always faster than average consensus? (Q1641079) (← links)
• A general selective averaging method for piecewise constant signal and image processing (Q1669991) (← links)
• Safe Metropolis-Hastings algorithm and its application to swarm control (Q1697161) (← links)
• Maximum Kolmogorov-Sinai entropy versus minimum mixing time in Markov chains (Q1706304) (← links)
• Improved mixing rates of directed cycles by added connection (Q1741874) (← links)
• Randomized leader election (Q1954216) (← links)
• Characterizing limits and opportunities in speeding up Markov chain mixing (Q2029783) (← links)
• On stochastic mirror descent with interacting particles: convergence properties and variance reduction (Q2077867) (← links)
• Eigen-stratified models (Q2138309) (← links)
• The geometric properties of a class of nonsymmetric cones (Q2221076) (← links)
• Maximizing algebraic connectivity for certain families of graphs (Q2261533) (← links)
• Cohesive networks using delayed self reinforcement (Q2288701) (← links)
• Fastest mixing reversible Markov chain on friendship graph: trade-off between transition probabilities among friends and convergence rate (Q2327394) (← links)
• A graph theoretical approach to input design for identification of nonlinear dynamical models (Q2342536) (← links)
• Variational analysis of the Ky Fan \(k\)-norm (Q2359140) (← links)
• Spectrally optimized pointset configurations (Q2402876) (← links)
• Communication constraints in the average consensus problem (Q2440647) (← links)
• A graph-theoretic approach on optimizing informed-node selection in multi-agent tracking control (Q2448429) (← links)
• Finding the projection onto the intersection of a closed half-space and a variable box (Q2450616) (← links)
• Optimizing the asymptotic convergence rate of the Diaconis-Holmes-Neal sampler (Q2455515) (← links)
• Fast linear iterations for distributed averaging (Q2503645) (← links)
• Decentralized and privacy-preserving low-rank matrix completion (Q2516374) (← links)
• Graph diameter, eigenvalues, and minimum-time consensus (Q2628456) (← links)
• Markov chain approach to probabilistic guidance for swarms of autonomous agents (Q2813952) (← links)
• Lifting Markov chains to speed up mixing (Q2819554) (← links)
• On the convergence of decentralized gradient descent (Q2821798) (← links)
• Rapid mixing and Markov bases (Q2835838) (← links)
• Average consensus with weighting matrix design for quantized communication on directed switching graphs (Q2847024) (← links)
• The impact of multi-group multi-layer network structure on the performance of distributed consensus building strategies (Q2857123) (← links)
• Matrix Relaxations in Combinatorial Optimization (Q2897308) (← links)
• Fastest mixing Markov chain problem for the union of two cliques (Q3090727) (← links)
• Emergence of Balance from a Model of Social Dynamics (Q3130416) (← links)
• Revisiting EXTRA for Smooth Distributed Optimization (Q3300767) (← links)
• A MARKOV-PROCESS INSPIRED <font>CA</font> MODEL OF HIGHWAY TRAFFIC (Q3614045) (← links)
• A framework for decentralised feedback connectivity control with application to sensor networks (Q3644834) (← links)