TY - CHAP

T1 - Percolation in Complex Networks

AU - Cohen, Reuven

AU - Havlin, Shlomo

PY - 2009

Y1 - 2009

N2 - ComponentThe set of nodes reachable from a given node. The nodes of a component are all reachable from each other.DegreeNumber of edges emanating from a node.Giant componentThe component of a graph with size (number of nodes) of order of the number of nodes in the graph.GraphA set of nodes (sites) and edges (links or bonds) connecting them.LoopA path that start and ends at the same node.Minimum spanning treeIn a weighted graph -- the tree subgraph of the graph with the minimum total weight.Optimal pathIn a weighted graph -- the path with minimum total weight connecting two nodes.Percolation theoryThe theory studying the connectivity behavior of networks when a fraction of the nodes or edges are removed. Site (or node) percolation involves occupying a fraction, p, of the nodes of the graph, or alternatively, removing a fraction q = 1 -- p. In bond (or edge) percolation edges are occupied, or removed, with some probability. A combined site-bond percolation, where both processes occur simultaneously, is also considered.Percolation thresholdThe fraction, pc of occupied nodes or edges, under the graph is fragmented into small components, and above which a giant component emerges.Random graphA graph selected from an ensemble (probability space) of graphs.Scale free networkA network whose nodes' degrees are distributed according to a power law.Shortest pathThe path with minimum number of edges connecting two nodes.TreeA connected graph (a graph consisting of a single component) with no loops.Weighted graphA graph where each edge is assigned a (usually non-negative) weight.

AB - ComponentThe set of nodes reachable from a given node. The nodes of a component are all reachable from each other.DegreeNumber of edges emanating from a node.Giant componentThe component of a graph with size (number of nodes) of order of the number of nodes in the graph.GraphA set of nodes (sites) and edges (links or bonds) connecting them.LoopA path that start and ends at the same node.Minimum spanning treeIn a weighted graph -- the tree subgraph of the graph with the minimum total weight.Optimal pathIn a weighted graph -- the path with minimum total weight connecting two nodes.Percolation theoryThe theory studying the connectivity behavior of networks when a fraction of the nodes or edges are removed. Site (or node) percolation involves occupying a fraction, p, of the nodes of the graph, or alternatively, removing a fraction q = 1 -- p. In bond (or edge) percolation edges are occupied, or removed, with some probability. A combined site-bond percolation, where both processes occur simultaneously, is also considered.Percolation thresholdThe fraction, pc of occupied nodes or edges, under the graph is fragmented into small components, and above which a giant component emerges.Random graphA graph selected from an ensemble (probability space) of graphs.Scale free networkA network whose nodes' degrees are distributed according to a power law.Shortest pathThe path with minimum number of edges connecting two nodes.TreeA connected graph (a graph consisting of a single component) with no loops.Weighted graphA graph where each edge is assigned a (usually non-negative) weight.

UR - https://www.mendeley.com/catalogue/0a483d63-5a62-35b1-8ca5-41dea63cbd19/

U2 - 10.1007/978-1-0716-1457-0_383

DO - 10.1007/978-1-0716-1457-0_383

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.chapter???

SN - 978-1-0716-1457-0

T3 - Complex Media and Percolation Theory

SP - 419

EP - 431

BT - Complex Media and Percolation Theory

A2 - Sahimi, Muhammad

A2 - Hunt, Allen G.

PB - Springer US

CY - New York, NY

ER -