Fibrations of graphs

نویسندگان

  • Paolo Boldi
  • Sebastiano Vigna
چکیده

A fibration of graphs is a morphism that is a local isomorphism of in-neighbourhoods, much in the same way a covering projection is a local isomorphism of neighbourhoods. This paper develops systematically the theory of graph fibrations, emphasizing in particular those results that recently found application in the theory of distributed systems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamics on Networks of Manifolds

We propose a precise definition of a continuous time dynamical system made up of interacting open subsystems. The interconnections of subsystems are coded by directed graphs. We prove that the appropriate maps of graphs called graph fibrations give rise to maps of dynamical systems. Consequently surjective graph fibrations give rise to invariant subsystems and injective graph fibrations give ri...

متن کامل

Modular dynamical systems on networks

We propose a new framework for the study of continuous time dynamical systems on networks. We view such dynamical systems as collections of interacting control systems. We show that a class of maps between graphs called graph fibrations give rise to maps between dynamical systems on networks. This allows us to produce conjugacy between dynamical systems out of combinatorial data. In particular ...

متن کامل

Graph fibrations, graph isomorphism, and PageRank

PageRank is a ranking method that assigns scores to web pages using the limit distribution of a random walk on the web graph. A fibration of graphs is a morphism that is a local isomorphism of inneighbourhoods, much in the same way a covering projection is a local isomorphism of neighbourhoods. We show that a deep connection relates fibrations and Markov chains with restart, a particular kind o...

متن کامل

Fibrations of Simplicial Sets

There are infinitely many variants of the notion of Kan fibration that, together with suitable choices of cofibrations and the usual notion of weak equivalence of simplicial sets, satisfy Quillen’s axioms for a homotopy model category. The combinatorics underlying these fibrations is purely finitary and seems interesting both for its own sake and for its interaction with homotopy types. To show...

متن کامل

Using fibrations for situation identification

Pervasive and autonomic systems rely on notions of context and situation to control their adaptation to changing user and system circumstances. Ensuring that a system exhibits the correct adaptation to on-going circumstances remains problematic, however, especially in the presence of dynamic user and device populations, changing requirements and complex interacting adaptations. We discuss the u...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Discrete Mathematics

دوره 243  شماره 

صفحات  -

تاریخ انتشار 2002