scientific article; zbMATH DE number 420886
From MaRDI portal
Publication:3135094
Determinants, permanents, traces, other special matrix functions (15A15) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) 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) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Computational methods for sparse matrices (65F50) Combinatorics in computer science (68R05)
Recommendations
Cited in
(only showing first 100 items - show all)- Optimal search-relocation trade-off in Markovian-target searching
- Stochastic protein folding simulation in the three-dimensional HP-model
- On the hardness of sampling independent sets beyond the tree threshold
- Expander properties and the cover time of random intersection graphs
- On coupling and the approximation of the permanent
- Approximate counting, uniform generation and rapidly mixing Markov chains
- On the random generation and counting of matchings in dense graphs
- Uniform positivity improving property, Sobolev inequalities, and spectral gaps
- What do we know about the Metropolis algorithm?
- Exploration of NP-hard enumeration problems by simulated annealing -- the spectrum values of permanents
- An interruptible algorithm for perfect sampling via Markov chains
- A quasi-polynomial-time algorithm for sampling words from a context-free language
- Eigenvalues, inequalities and ergodic theory
- Importance sampling for families of distributions
- Identification of almost invariant aggregates in reversible nearly uncoupled Markov chains
- Approximating the number of monomer-dimer coverings of a lattice.
- Simple polytopes without small separators. II: Thurston's bound
- Sampling weighted perfect matchings on the square-octagon lattice
- Utilizing network structure to accelerate Markov chain Monte Carlo algorithms
- Sensitivity analysis of a railway station track layout with respect to a given timetable
- Algebraic algorithms for sampling from conditional distributions
- Weighted expanders and the anisotropic Alon-Boppana theorem
- Distributed cooperative Bayesian learning strategies.
- Uniform generation of NP-witnesses using an NP-oracle
- The algorithmics of folding proteins on lattices.
- Markov chain decomposition for convergence rate analysis
- Analysis of a nonreversible Markov chain sampler.
- Perfect sampling using bounding chains.
- Gröbner bases and triangulations of the second hypersimplex
- Walks on generating sets of Abelian groups
- A mildly exponential approximation algorithm for the permanent
- Mixing time for the Ising model: a uniform lower bound for all graphs
- Connecting polygonizations via stretches and twangs
- Mixing times for uniformly ergodic Markov chains
- Lower bounds for in-network computation of arbitrary functions
- Half-graphs, other non-stable degree sequences, and the switch Markov chain
- The effect of quantum noise on algorithmic perfect quantum state transfer on NISQ processors
- Sequential importance sampling for multiresolution Kingman-Tajima coalescent counting
- TAP free energy, spin glasses and variational inference
- Coined quantum walks lift the cospectrality of graphs and trees
- Sex: the power of randomization
- Efficient importance sampling for binary contingency tables
- Generating connected acyclic digraphs uniformly at random
- Randomized scheduling algorithm for queueing networks
- Combinatiorial Markov chains
- Probabilistic verification and approximation
- Random bichromatic matchings
- Revlex-initial 0/1-polytopes
- Logarithmic Sobolev inequalities for finite Markov chains
- Evolving sets, mixing and heat kernel bounds
- Numerical study of the 6-vertex model with domain wall boundary conditions.
- On swapping and simulated tempering algorithms.
- The complexity of estimating min-entropy
- Leader election in well-connected graphs
- Analyzing Glauber dynamics by comparison of Markov chains
- Sampling and counting 3-orientations of planar triangulations
- Rapid mixing and Markov bases
- Mixing times for the swapping algorithm on the Blume-Emery-Griffiths model
- Reverse cycle walking and its applications
- Rumor spreading with no dependence on conductance
- Algorithms to approximately count and sample conforming colorings of graphs
- Uniform sampling of digraphs with a fixed degree sequence
- The computational complexity of estimating MCMC convergence time
- Fastest mixing Markov chain problem for the union of two cliques
- Near-linear time simulation of linear extensions of a height-2 poset with bounded interaction
- scientific article; zbMATH DE number 4172979 (Why is no real title available?)
- Algorithms for Generating Discrete Random Variables with a Given Generating Function or a Given Moment Sequence
- Mixing Time of Random Walk on Poisson Geometry Small World
- On the Markov Chain Simulation Method for Uniform Combinatorial Distributions and Simulated Annealing
- Random Generation of Directed Acyclic Graphs
- On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints
- The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs
- Probabilistic Analysis of Online Bin Coloring Algorithms Via Stochastic Comparison
- The Markov chain Monte Carlo revolution
- How to Design a Linear Cover Time Random Walk on a Finite Graph
- scientific article; zbMATH DE number 18982 (Why is no real title available?)
- Sublinear-time algorithms for monomer-dimer systems on bounded degree graphs
- scientific article; zbMATH DE number 176066 (Why is no real title available?)
- scientific article; zbMATH DE number 475376 (Why is no real title available?)
- A Randomised Approximation Algorithm for Counting the Number of Forests in Dense Graphs
- The ‘Burnside Process’ Converges Slowly
- Pattern hit-and-run for sampling efficiently on polytopes
- Markov-chain monte carlo: Some practical implications of theoretical results
- scientific article; zbMATH DE number 1775402 (Why is no real title available?)
- scientific article; zbMATH DE number 1789923 (Why is no real title available?)
- Quantum machine learning: a classical perspective
- Effect of increasing the energy gap between the two lowest energy states on the mixing time of the Metropolis algorithm
- Approximately sampling elements with fixed rank in graded posets
- Phase transitions in random dyadic tilings and rectangular dissections
- Graph clustering
- Deterministic random walks for rapidly mixing chains
- Fast convergence of the Glauber dynamics for sampling independent sets
- On the swapping algorithm
- scientific article; zbMATH DE number 1885142 (Why is no real title available?)
- Expansion of random graphs: new proofs, new results
- Rapid mixing for lattice colourings with fewer colours
- Generating random networks without short cycles
- Quantum walk sampling by growing seed sets
- The Markov chain of colourings
- Deterministic random walks on finite graphs
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)
