Unimodularity in randomly generated graphs

Unimodularity in randomly generated graphs / Florian Sobieczky, editor.

This volume contains the proceedings of the AMS Special Session on Unimodularity in Randomly Generated Graphs, held from October 8-9, 2016, in Denver, Colorado. Unimodularity, a term initially used in locally compact topological groups, is one of the main examples in which the generalization from gr...

Full description

Saved in:
Bibliographic Details
Other Authors: Sobieczky, Florian (Editor)
Format: eBook
Language:English
Published: Providence, Rhode Island : American Mathematical Society, 2018.
Series:Contemporary mathematics (American Mathematical Society) ; v. 719.
Subjects:
Random graphs.
Graph theory.
MATHEMATICS > Applied.
MATHEMATICS > Probability & Statistics > General.
Graph theory
Random graphs
Probability theory and stochastic processes > Special processes > Interacting random processes; statistical mechanics type models; percolation theory.
Probability theory and stochastic processes > Special processes > Processes in random environments.
Probability theory and stochastic processes > Markov processes > Transition functions, generators and resolvents.
Probability theory and stochastic processes > Combinatorial probability > Combinatorial probability.
Probability theory and stochastic processes > Stochastic processes > Point processes.
Dynamical systems and ergodic theory > Ergodic theory > Measure-preserving transformations.
Dynamical systems and ergodic theory > Ergodic theory > Entropy and other invariants, isomorphism, classification.
Online Access:Click for online access
Description
Summary:This volume contains the proceedings of the AMS Special Session on Unimodularity in Randomly Generated Graphs, held from October 8-9, 2016, in Denver, Colorado. Unimodularity, a term initially used in locally compact topological groups, is one of the main examples in which the generalization from groups to graphs is successful. The "randomly generated graphs", which include percolation graphs, random Erdős-Rényi graphs, and graphings of equivalence relations, are much easier to describe if they result as random objects in the context of unimodularity, with respect to either a vertex-transien.
Item Description:"AMS Special Session on Unimodularity in Randomly Generated Graphs, October 8-9, 2016, Denver, Colorado."
Physical Description:1 online resource (x, 211 pages)
Bibliography:Includes bibliographical references.
ISBN:1470450178
9781470450175
Source of Description, Etc. Note:Print record version.

Similar Items