scientific article; zbMATH DE number 420886
From MaRDI portal
Publication:3135094
Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Probabilistic methods, stochastic differential equations (65C99) Computational methods for sparse matrices (65F50) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Combinatorics in computer science (68R05) Determinants, permanents, traces, other special matrix functions (15A15)
Recommendations
Cited in
(only showing first 100 items - show all)- Generating connected acyclic digraphs uniformly at random
- Logarithmic Sobolev inequalities for finite Markov chains
- Connecting polygonizations via stretches and twangs
- Uniform sampling of digraphs with a fixed degree sequence
- scientific article; zbMATH DE number 176066 (Why is no real title available?)
- Weighted expanders and the anisotropic Alon-Boppana theorem
- Analyzing Glauber dynamics by comparison of Markov chains
- Random bichromatic matchings
- scientific article; zbMATH DE number 7525446 (Why is no real title available?)
- Identification of almost invariant aggregates in reversible nearly uncoupled Markov chains
- Lower bounds for in-network computation of arbitrary functions
- An interruptible algorithm for perfect sampling via Markov chains
- Near-linear time simulation of linear extensions of a height-2 poset with bounded interaction
- Sampling and counting 3-orientations of planar triangulations
- A quasi-polynomial-time algorithm for sampling words from a context-free language
- Relation-algebraic computation of fixed points with applications
- A Randomised Approximation Algorithm for Counting the Number of Forests in Dense Graphs
- A pseudo-polynomial heuristic for path-constrained discrete-time Markovian-target search
- Distributed cooperative Bayesian learning strategies.
- Leader election in well-connected graphs
- Random Generation of Directed Acyclic Graphs
- Expander properties and the cover time of random intersection graphs
- Sublinear-time algorithms for monomer-dimer systems on bounded degree graphs
- Mixing times for uniformly ergodic Markov chains
- The complexity of estimating min-entropy
- The effect of quantum noise on algorithmic perfect quantum state transfer on NISQ processors
- Randomized scheduling algorithm for queueing networks
- scientific article; zbMATH DE number 1885142 (Why is no real title available?)
- Sex: the power of randomization
- Revlex-initial 0/1-polytopes
- Analysis of a nonreversible Markov chain sampler.
- The hitting and cover times of Metropolis walks
- Reverse cycle walking and its applications
- Utilizing network structure to accelerate Markov chain Monte Carlo algorithms
- The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs
- Limits and rates of convergence for the distribution of search cost under the move-to-front rule
- On listing, sampling, and counting the chordal graphs with edge constraints
- scientific article; zbMATH DE number 4172979 (Why is no real title available?)
- Phase transitions in random dyadic tilings and rectangular dissections
- Tight bounds for the cover time of multiple random walks
- On the Markov Chain Simulation Method for Uniform Combinatorial Distributions and Simulated Annealing
- Similarity of personal preferences: Theoretical foundations and empirical analysis
- Simple polytopes without small separators. II: Thurston's bound
- How to Design a Linear Cover Time Random Walk on a Finite Graph
- On coupling and the approximation of the permanent
- On the hardness of sampling independent sets beyond the tree threshold
- Mixing time for the Ising model: a uniform lower bound for all graphs
- Fast convergence of the Glauber dynamics for sampling independent sets
- Fastest mixing Markov chain problem for the union of two cliques
- Rapid mixing and Markov bases
- Gröbner bases and triangulations of the second hypersimplex
- Mixing times for the swapping algorithm on the Blume-Emery-Griffiths model
- Glauber dynamics for the mean-field Ising model: cut-off, critical power law, and metastability
- Pattern hit-and-run for sampling efficiently on polytopes
- Rumor spreading with no dependence on conductance
- Approximating the number of monomer-dimer coverings of a lattice.
- Algorithms to approximately count and sample conforming colorings of graphs
- Exploration of NP-hard enumeration problems by simulated annealing -- the spectrum values of permanents
- Optimal search-relocation trade-off in Markovian-target searching
- Evolving sets, mixing and heat kernel bounds
- On the random generation and counting of matchings in dense graphs
- Expansion of random graphs: new proofs, new results
- scientific article; zbMATH DE number 1789923 (Why is no real title available?)
- Approximate counting, uniform generation and rapidly mixing Markov chains
- Coined quantum walks lift the cospectrality of graphs and trees
- Deterministic random walks for rapidly mixing chains
- Combinatiorial Markov chains
- The computational complexity of estimating MCMC convergence time
- Mixing times of Markov chains for self‐organizing lists and biased permutations
- Sequential importance sampling for multiresolution Kingman-Tajima coalescent counting
- Deterministic random walks on finite graphs
- Phase coexistence and torpid mixing in the 3-coloring model on \({\mathbb Z}^d\)
- On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints
- The swapping algorithm for the Hopfield model with two patterns
- Probabilistic verification and approximation
- Algorithms for Generating Discrete Random Variables with a Given Generating Function or a Given Moment Sequence
- Effect of increasing the energy gap between the two lowest energy states on the mixing time of the Metropolis algorithm
- Markov chain decomposition for convergence rate analysis
- On the swapping algorithm
- Nash inequalities for finite Markov chains
- The algorithmics of folding proteins on lattices.
- Half-graphs, other non-stable degree sequences, and the switch Markov chain
- Uniform positivity improving property, Sobolev inequalities, and spectral gaps
- Importance sampling for families of distributions
- Approximately sampling elements with fixed rank in graded posets
- Eigenvalues, inequalities and ergodic theory
- Disjoint Decomposition of Markov Chains and Sampling Circuits in Cayley Graphs
- Tilings of rectangles with T-tetrominoes
- Algebraic algorithms for sampling from conditional distributions
- Markov-chain monte carlo: Some practical implications of theoretical results
- Rapid mixing for lattice colourings with fewer colours
- Numerical study of the 6-vertex model with domain wall boundary conditions.
- The ‘Burnside Process’ Converges Slowly
- Generating random networks without short cycles
- A mildly exponential approximation algorithm for the permanent
- Sampling weighted perfect matchings on the square-octagon lattice
- Rapid Mixing of \({\boldsymbol{k}}\)-Class Biased Permutations
- Uniform generation of NP-witnesses using an NP-oracle
- Quantum machine learning: a classical perspective
- Perfect sampling using bounding chains.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3135094)
