Giovanni Conforti

• In this work we study reciprocal classes of Markov walks on graphs. Given a continuous time reference Markov chain on a graph, its reciprocal class is the set of all probability measures which can be represented as a mixture of the bridges of the reference walks. We characterize reciprocal classes with two different approaches. With the first approach we found it as the set of solutions to duality formulae on path space, where the differential operators have the interpretation of the addition of infinitesimal random loops to the paths of the canonical process. With the second approach we look at short time asymptotics of bridges. Both approaches allow an explicit computation of reciprocal characteristics, which are divided into two families, the loop characteristics and the arc characteristics. They are those specific functionals of the generator of the reference chain which determine its reciprocal class. We look at the specific examples such as Cayley graphs, the hypercube and planar graphs. Finally we establish the firstIn this work we study reciprocal classes of Markov walks on graphs. Given a continuous time reference Markov chain on a graph, its reciprocal class is the set of all probability measures which can be represented as a mixture of the bridges of the reference walks. We characterize reciprocal classes with two different approaches. With the first approach we found it as the set of solutions to duality formulae on path space, where the differential operators have the interpretation of the addition of infinitesimal random loops to the paths of the canonical process. With the second approach we look at short time asymptotics of bridges. Both approaches allow an explicit computation of reciprocal characteristics, which are divided into two families, the loop characteristics and the arc characteristics. They are those specific functionals of the generator of the reference chain which determine its reciprocal class. We look at the specific examples such as Cayley graphs, the hypercube and planar graphs. Finally we establish the first concentration of measure results for the bridges of a continuous time Markov chain based on the reciprocal characteristics.…