Related papers: Lectures on Isomorphism Theorems
Renewal theorems are developed for point processes with interarrival times $W_n=\xi(X_{n+1}X_n\cdots)$, where $(X_n)_{n\in\mathbb Z}$ is a stochastic process with finite state space $\Sigma$ and $\xi\colon\Sigma_A\to\mathbb R$ is a H\"older…
Markov random fields area popular model for high-dimensional probability distributions. Over the years, many mathematical, statistical and algorithmic problems on them have been studied. Until recently, the only known algorithms for…
This article addresses a modification of local time for stochastic processes, to be referred to as `natural local time'. It is prompted by theoretical developments arising in mathematical treatments of recent experiments and observations of…
This text grew out of my lecture notes for a 4-hours minicourse delivered on October 17 \& 19, 2016 during the research school "Applications of Ergodic Theory in Number Theory" -- an activity related to the Jean-Molet Chair project of…
Lecture notes in Russian. Topics: the Haar measure (abstract theorems and explicit descriptions for different groups), measures on infinite-dimensional spaces with large natural groups of symmetries (Gaussian measures, Poisson measures,…
Those notes rest on the Samuel Eilenberg Lectures I gave at Columbia University, NY, in the fall 2022. I thank all the mathematicians who participated in their elaboration, directly or indirectly. They are meant to be published as a…
Increased attention has been paid over the last four years to dynamic network embedding. Existing dynamic embedding methods, however, consider the problem as limited to the evolution of a topology over a sequence of global, discrete states.…
Reciprocal processes are acausal generalizations of Markov processes introduced by Bernstein in 1932. In the literature, a significant amount of attention has been focused on developing dynamical models for reciprocal processes. Recently,…
The connections between (convex) optimization and (logconcave) sampling have been considerably enriched in the past decade with many conceptual and mathematical analogies. For instance, the Langevin algorithm can be viewed as a sampling…
Loop measures and their associated loop soups are generally viewed as arising from finite state Markov chains. We generalize several results to loop measures arising from potentially complex edge weights. We discuss two applications:…
We introduce a class of quantum non-Markovian processes -- dubbed process trees -- that exhibit polynomially decaying temporal correlations and memory distributed across time scales. This class of processes is described by a tensor network…
These are lecture notes from my talks at the "Current Developments in Mathematics" conference (Harvard, 2006). They cover a variety of topics involving symplectic cohomology. In particular, a discussion of (algorithmic) classification…
We consider a general honest homogeneous continuous-time Markov process with restarts. The process is forced to restart from a given distribution at time moments generated by an independent Poisson process. The motivation to study such…
We consider the loop soup at intensity ${1\over 2}$ conditioned on having local time $0$ on a set of vertices with positive occupation field in their vicinities. We give a relation between this loop soup and the usual loop soup conditioned…
This review is an extended version of the Seoul ICM 2014 proceedings.It is a short overview of the "topological recursion", a relation appearing in the asymptotic expansion of many integrable systems and in enumerative problems. We recall…
These are the notes of the three lectures I delivered at the mini-workshop "Knot Theory and Number Theory around the A-Polynomial" at the Instituto Superior Tecnico (IST) in Lisbon in January 2014. The goal of the lectures was to…
This text grew out of some lecture notes prepared by the author in the occasion of a series of three lectures during the workshop "Young mathematicians in dynamical systems" organized by Francoise Dal'bo, Louis Funar, Boris Hasselblatt and…
These are lecture notes from a course given at the CRM in Montreal in 1992. They survey the author's attempts to find and understand canonical probabilistic entities in a local field (e.g. p-adic) setting. We propose answers to the related…
This book collects the lectures about graph theory and its applications which were given to students of mathematical departments of Moscow State University and Peking University. Graph theory is a very wide field with a lot of applications…
These lecture notes provide an introduction to automorphism groups of graphs. Some special families of graphs are then discussed, especially the families of Cayley graphs generated by transposition sets.