scientific article

Publication date: 22 September 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

simulation Markov chains permanents combinatorial structures conductance rapid mixing

Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Combinatorics in computer science (68R05) 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)

Related Items

Time-optimal construction of overlay networks, Rapid Mixing of ${\boldsymbol{k}}$-Class Biased Permutations, Markov chain decomposition for convergence rate analysis, Analysis of a nonreversible Markov chain sampler., Simple polytopes without small separators. II: Thurston's bound, Perfect sampling using bounding chains., On the swapping algorithm, Algorithms to approximately count and sample conforming colorings of graphs, Glauber dynamics for the mean-field Ising model: cut-off, critical power law, and metastability, Gröbner bases and triangulations of the second hypersimplex, Efficient importance sampling for binary contingency tables, Quantum machine learning: a classical perspective, Generating connected acyclic digraphs uniformly at random, A quasi-polynomial-time algorithm for sampling words from a context-free language, Tilings of rectangles with T-tetrominoes, Walks on generating sets of Abelian groups, Sampling weighted perfect matchings on the square-octagon lattice, A mildly exponential approximation algorithm for the permanent, Phase Transitions in Random Dyadic Tilings and Rectangular Dissections, On the random generation and counting of matchings in dense graphs, Deterministic Random Walks for Rapidly Mixing Chains, A Randomised Approximation Algorithm for Counting the Number of Forests in Dense Graphs, The Markov chain of colourings, Mixing times of Markov chains for self‐organizing lists and biased permutations, Sublinear-time algorithms for monomer-dimer systems on bounded degree graphs, Reverse Cycle Walking and Its Applications, Sequential importance sampling for multiresolution Kingman-Tajima coalescent counting, On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints, Randomized scheduling algorithm for queueing networks, Rumor Spreading with No Dependence on Conductance, Mixing time for the Ising model: a uniform lower bound for all graphs, Pattern hit-and-run for sampling efficiently on polytopes, Fast convergence of the Glauber dynamics for sampling independent sets, Leader election in well-connected graphs, The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs, Connecting polygonizations via stretches and twangs, Effect of increasing the energy gap between the two lowest energy states on the mixing time of the Metropolis algorithm, Graph clustering, Mixing times for uniformly ergodic Markov chains, Eigenvalues, inequalities and ergodic theory, Probabilistic Analysis of Online Bin Coloring Algorithms Via Stochastic Comparison, TAP free energy, spin glasses and variational inference, Utilizing network structure to accelerate Markov chain Monte Carlo algorithms, Expansion of random graphs: new proofs, new results, Limits and rates of convergence for the distribution of search cost under the move-to-front rule, Lower bounds for in-network computation of arbitrary functions, Nash inequalities for finite Markov chains, A pseudo-polynomial heuristic for path-constrained discrete-time Markovian-target search, Probabilistic verification and approximation, The hitting and cover times of Metropolis walks, Random bichromatic matchings, Perfect Simulation for Image Restoration, Tight bounds for the cover time of multiple random walks, Markov-chain monte carlo: Some practical implications of theoretical results, Unnamed Item, On listing, sampling, and counting the chordal graphs with edge constraints, Coined quantum walks lift the cospectrality of graphs and trees, Revlex-initial 0/1-polytopes, Uniform Sampling of Digraphs with a Fixed Degree Sequence, Optimal search-relocation trade-off in Markovian-target searching, The swapping algorithm for the Hopfield model with two patterns, Half-graphs, other non-stable degree sequences, and the switch Markov chain, Sampling and Counting 3-Orientations of Planar Triangulations, Stochastic protein folding simulation in the three-dimensional HP-model, The Markov chain Monte Carlo revolution, Sensitivity analysis of a railway station track layout with respect to a given timetable, Algebraic algorithms for sampling from conditional distributions, Rapid mixing for lattice colourings with fewer colours, Generating Random Networks Without Short Cycles, On the hardness of sampling independent sets beyond the tree threshold, The Computational Complexity of Estimating MCMC Convergence Time, Fastest mixing Markov chain problem for the union of two cliques, Mixing Time of Random Walk on Poisson Geometry Small World, Uniform positivity improving property, Sobolev inequalities, and spectral gaps, Unnamed Item, What do we know about the Metropolis algorithm?, How to Design a Linear Cover Time Random Walk on a Finite Graph, Expander properties and the cover time of random intersection graphs, Rapid Mixing and Markov Bases, Weighted expanders and the anisotropic Alon-Boppana theorem, Exploration of NP-hard enumeration problems by simulated annealing -- the spectrum values of permanents, Importance sampling for families of distributions, Logarithmic Sobolev inequalities for finite Markov chains, Phase coexistence and torpid mixing in the 3-coloring model on ${\mathbb Z}^d$, Sex: the power of randomization, An interruptible algorithm for perfect sampling via Markov chains, Identification of almost invariant aggregates in reversible nearly uncoupled 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., Approximating the number of monomer-dimer coverings of a lattice., Distributed cooperative Bayesian learning strategies., Uniform generation of NP-witnesses using an NP-oracle, The effect of quantum noise on algorithmic perfect quantum state transfer on NISQ processors, Random Generation of Directed Acyclic Graphs, Deterministic random walks on finite graphs, The algorithmics of folding proteins on lattices., Similarity of personal preferences: Theoretical foundations and empirical analysis, Mixing times for the Swapping Algorithm on the Blume-Emery-Griffiths model, The complexity of estimating min-entropy, Relation-algebraic computation of fixed points with applications