Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Conductance_(graph)> ?p ?o. }
Showing items 1 to 32 of
32
with 100 items per page.
- Conductance_(graph) abstract "In graph theory the conductance of a graph G=(V,E) measures how "well-knit" the graph is: it controls how fast a random walk on G converges to a uniform distribution. The conductance of a graph is often called the Cheeger constant of a graph as the analog of its counterpart in spectral geometry.[citation needed] Since electrical networks are intimately related to random walkswith a long history in the usage of the term "conductance", this alternative name helps avoid possible confusion.The conductance of a cut in a graph is defined as:where the are the entries of the adjacency matrix for G, so thatis the total number (or weight) of the edges incident with S.The conductance of the whole graph is the minimum conductance over all the possible cuts: Equivalently, conductance of a graph is defined as follows: For a d-regular graph, the conductance is equal to the isoperimetric number divided by d.".
- Conductance_(graph) wikiPageExternalLink jacm-spectral.pdf.
- Conductance_(graph) wikiPageID "14496121".
- Conductance_(graph) wikiPageRevisionID "535565715".
- Conductance_(graph) hasPhotoCollection Conductance_(graph).
- Conductance_(graph) subject Category:Algebraic_graph_theory.
- Conductance_(graph) subject Category:Graph_invariants.
- Conductance_(graph) subject Category:Matrices.
- Conductance_(graph) subject Category:Probability_theory.
- Conductance_(graph) type Abstraction100002137.
- Conductance_(graph) type Arrangement107938773.
- Conductance_(graph) type Array107939382.
- Conductance_(graph) type Cognition100023271.
- Conductance_(graph) type Concept105835747.
- Conductance_(graph) type Content105809192.
- Conductance_(graph) type Feature105849789.
- Conductance_(graph) type GraphInvariants.
- Conductance_(graph) type Group100031264.
- Conductance_(graph) type Idea105833840.
- Conductance_(graph) type Invariant105850432.
- Conductance_(graph) type Matrices.
- Conductance_(graph) type Matrix108267640.
- Conductance_(graph) type Property105849040.
- Conductance_(graph) type PsychologicalFeature100023100.
- Conductance_(graph) comment "In graph theory the conductance of a graph G=(V,E) measures how "well-knit" the graph is: it controls how fast a random walk on G converges to a uniform distribution.".
- Conductance_(graph) label "Conductance (graph)".
- Conductance_(graph) sameAs m.03d5923.
- Conductance_(graph) sameAs Q5159376.
- Conductance_(graph) sameAs Q5159376.
- Conductance_(graph) sameAs Conductance_(graph).
- Conductance_(graph) wasDerivedFrom Conductance_(graph)?oldid=535565715.
- Conductance_(graph) isPrimaryTopicOf Conductance_(graph).