Nothing Special   »   [go: up one dir, main page]

Lovász, 1993 - Google Patents

Random walks on graphs

Lovász, 1993

View PDF
Document ID
15407483873507634663
Author
Lovász L
Publication year
Publication venue
Combinatorics, Paul erdos is eighty

External Links

Snippet

Various aspects of the theory of random walks on graphs are surveyed. In particular, estimates on the important parameters of access time, commute time, cover time and mixing time are discussed. Connections with the eigenvalues of graphs and with electrical …
Continue reading at cs.yale.edu (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5009—Computer-aided design using simulation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/11—Complex mathematical operations for solving equations, e.g. nonlinear equations, general mathematical optimization problems
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • G06F17/30958—Graphs; Linked lists
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/60—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers
    • G06F7/72—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers using residue arithmetic
    • G06F7/724—Finite field arithmetic
    • G06F7/726—Inversion; Reciprocal calculation; Division of elements of a finite field
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/58—Random or pseudo-random number generators

Similar Documents

Publication Publication Date Title
Lovász Random walks on graphs
Entov et al. Calabi quasimorphism and quantum homology
Narayanan et al. A Simulation of the Schwinger model in the overlap formalism
Mossel et al. Local algorithms for block models with side information
Lelarge A new approach to the orientation of random hypergraphs
Adamović Classification of irreducible modules of certain subalgebras of free boson vertex algebra
Alon et al. Algorithmic aspects of acyclic edge colorings
Pippenger et al. Topological characteristics of random triangulated surfaces
Dalirrooyfard et al. New techniques for proving fine-grained average-case hardness
Doerr et al. Black-box complexities of combinatorial problems
Abért et al. Dimension and randomness in groups acting on rooted trees
Bogdanov et al. The complexity of distinguishing Markov random fields
Curien et al. The harmonic measure of balls in random trees
Diaconis et al. Double coset Markov chains
Eppstein et al. Rapid mixing for the hardcore Glauber dynamics and other Markov chains in bounded-treewidth graphs
Chari et al. Improved algorithms via approximations of probability distributions
Accardi et al. Decompositions of the free product of graphs
Guralnick et al. On the spread of finite simple groups
Fyodorov Spectral properties of random reactance networks and random matrix pencils
Allamigeon et al. The tropical shadow-vertex algorithm solves mean payoff games in polynomial time on average
Fredes et al. Models of random subtrees of a graph
Roblot Computing 𝑝-adic 𝐿-functions of totally real number fields
Kawai String duality and enumeration of curves by Jacobi forms
Bolten et al. A bootstrap algebraic multilevel method for Markov chains
Shmoys et al. Computational complexity