C4

Commuting concerns people’s spatial behaviour resulting from the geographic separation of home and workplace and is connected with their willingness to seek economic opportunities outside their place of residence (Rouwendal J., Nijkamp P., 2004). Such opportunities are usually found in the urban areas, so this phenomenon is often a subject of urban studies or research focusing on city centres (Drejerska N., Chrzanowska M., 2014). In literature, commuting patterns are used to determine the boundaries of local and regional labour markets. Furthermore, labour market is one of the most important features for the delimitation of functional regions, as commuting involves not only working outside one’s place of residence but also, among other things, using various services offered there, from shopping to health or cultural services. Taking this into account, it can be stated that commuting is an important characteristic of relations between territories, and these relations form complex networks.

People decide to commute to work for various reasons. Most commuters travel from a small town, village or rural area to a city or town where they have a wider range of employment opportunities. However, people differ in their attitudes toward commuting. While some people find it troublesome, others enjoy their daily travel. There are also people who regard commuting as the necessary condition for supporting themselves and their families. Therefore, commuting is an important factor that should be taken into account in the research on the quality of life and quality of work.

The main goals of this presentation is to identify and analyse relations between communities (municipalities) from the perspective of labour market, especially commuting in the vicinity of Warsaw, Data on the number of commuters come from the Central Statistical Office of Poland and cover the year 2011.

 Bibliography

Drejerska N., Chrzanowska M., 2014: Commuting in the Warsaw suburban area from a spatial perspective – an example of empirical research, Acta Universitatis Lodziensis. Folia Oeconomica 2014, Vol. 6, no 309, pp. 87-96.

Rouwendal J., Nijkamp P., 2004: Living in Two Worlds: A Review of Home-to-Work Decisions, Growth and Change, Volume 35, Issue 3, p. 287.

In recent years, much attention has been given to single-cell RNA sequencing techniques as they allow researchers to examine the functions and relationships of single cells inside a tissue. In this study, we combine single-cell RNA sequencing data with protein–protein interaction networks (PPINs) to detect active modules in cells of different transcriptional states. We achieve this by clustering single-cell RNA sequencing data, constructing node-weighted PPINs, and identifying the maximum-weight connected subgraphs with an exact Steiner-Tree approach. As a case study, we investigate RNA sequencing data from human liver spheroids but the techniques described here are applicable to other organisms and tissues. The benefits of our novel method are two-fold: First, it allows us to identify important proteins (e.g., receptors) which are not detected from a differential gene-expression analysis as they only interact with proteins that are transcribed in higher levels. Second, we find that different transcriptional states have different subnetworks of the PPIN significantly overexpressed. These subnetworks often reflect known biological pathways (e.g., lipid metabolism and stress response) and we obtain a nuanced picture of cellular function as we can associate them with a subset of all analysed cells.

The advent of social media and the resulting ability to instantaneously communicate ideas and messages to connections worldwide is one of the great consequences arising from the telecommunications revolution over the last century. Individuals do not, however, communicate only upon a single platform; instead there exists a plethora of options available to users, many of whom are active on a number of such media. While each platform offers some unique selling point to attract users, e.g., keeping up to date with friends through messaging and statuses (Facebook), photo sharing (Instagram), seeing information from friends, celebrities and numerous other outlets (Twitter) or keeping track of the career paths of friends and past colleagues (Linkedin), the platforms are all based upon the fundamental mechanisms of connecting with other users and transmitting information to them as a result of this link.

In this talk a model for the spreading of online information or “memes" on multiplex networks is introduced and analyzed using branching-process methods. The model generalizes that of [Gleeson et al., Phys. Rev. X., 2016] in two ways. First, even for a monoplex (single-layer) network, the model is defined for any specific network defined by its adjacency matrix, instead of being restricted to an ensemble of random networks. Second, a multiplex version of the model is introduced to capture the behavior of users who post information from one social media platform to another. In both cases the branching process analysis demonstrates that the dynamical system is, in the limit of low innovation, poised near a critical point, which is known to lead to heavy-tailed distributions of meme popularity similar to those observed in empirical data.

[1] J. P. Gleeson et al. “Effects of network structure, competition and memory time on social spreading phenomena”. Physical Review X 6.2 (2016), p. 021019.

[2] J. D. O’Brien et al. "Spreading of memes on multiplex networks." New Journal of Physics 21.2 (2019): 025001.

Arakelov geometry studies schemes X over ℤ, together with the Hermitian complex geometry of X(ℂ).
Most notably, it has been used to give a proof of Mordell's conjecture (Faltings's Theorem) by Paul Vojta; curves of genus greater than 1 have at most finitely many rational points.
In this talk, we'll introduce some of the ideas behind Arakelov theory, and show how many results in Araklev theory are analogous—with additional structure—to classic results such as intersection theory and Riemann Roch.

Complexity Science aims to understand what is that makes some systems to be "more than the sum of their parts". A natural first step to address this issue is to study networks of pairwise interactions, which have been done with great success in many disciplines -- to the extend that many people today identify Complexity Science with network analysis. In contrast, multivariate complexity provides a vast and mostly unexplored territory. As a matter of fact, the "modes of interdependency" that can exist between three or more variables are often nontrivial, poorly understood and, yet, are paramount for our understanding of complex systems in general, and emergence in particular. 
In this talk we present an information-theoretic framework to analyse high-order correlations, i.e. statistical dependencies that exist between groups of variables that cannot be reduced to pairwise interactions. Following the spirit of information theory, our approach is data-driven and model-agnostic, being applicable to discrete, continuous, and categorical data. We review the evolution of related ideas in the context of theoretical neuroscience, and discuss the most prominent extensions of information-theoretic metrics to multivariate settings. Then, we introduce the O-information, a novel metric that quantify various structural (i.e. synchronous) high-order effects. Finally, we provide a critical discussion on the framework of Integrated Information Theory (IIT), which suggests an approach to extend the analysis to dynamical settings. To illustrate the presented methods, we show how the analysis of high-order correlations can reveal critical structures in various scenarios, including cellular automata, Baroque music scores, and various EEG datasets.

References:
[1] F. Rosas, P.A. Mediano, M. Gastpar and H.J. Jensen, ``Quantifying High-order Interdependencies via Multivariate Extensions of the Mutual Information'', submitted to PRE, under review.
https://arxiv.org/abs/1902.11239
[2] F. Rosas, P.A. Mediano, M. Ugarte and H.J. Jensen, ``An information-theoretic approach to self-organisation: Emergence of complex interdependencies in coupled dynamical systems'', in Entropy, vol. 20 no. 10: 793, pp.1-25, Sept. 2018.
https://www.mdpi.com/1099-4300/20/10/793

 

Social surveys are widely used in today's society as a method for obtaining opinions and other information from large groups of people. The questions in social surveys are usually presented in either multiple-choice or free-response formats. Despite their advantages, free-response questions are employed less commonly in large-scale surveys, because in such situations, considerable effort is needed to categorise and summarise the resulting large dataset. This is the so-called coding problem. Here we propose a survey framework in which, respondents not only write down their own opinions, but also input information characterising the similarity between their individual responses and those of other respondents. This is done in much the same way as ``likes" are input in social network services. The information input in this simple procedure constitutes relational data among opinions, which we call the opinion graph. The diversity of typical opinions can be identified as a modular structure of such a graph, and the coding problem is solved through graph clustering in a statistically principled manner. We demonstrate our approach using a poll on the 2016 US presidential election and a survey given to graduates of a particular university.

The comparison of graphs is a vitally important, yet difficult task which arises across a number of diverse research areas including biological and social networks. There have been a number of approaches to define graph distance however often these are not metrics (rendering standard data-mining techniques infeasible), or are computationally infeasible for large graphs. In this work, we define a new metric based on the spectrum of the non-backtracking graph operator and show that it can not only be used to compare graphs generated through different mechanisms but can reliably compare graphs of varying size. We observe that the family of Watts-Strogatz graphs lie on a manifold in the non-backtracking spectral embedding and show how this metric can be used in a standard classification problem of empirical graphs.

The world of quantum invariants began in 1983 with the discovery of the Jones polynomial. Later on, Reshetikhin and Turaev developed an algebraic machinery that provides knot invariants. This algebraic construction leads to a sequence of quantum generalisations of this invariant, called coloured Jones polynomials. The original Jones polynomial can be defined by so called skein relations. However, unlike other classical invariants for knots like the Alexander polynomial, its relation to the topology of the complement is still a mysterious and deep question. On the topological side, R. Lawrence defined a sequence of braid group representations on the homology of coverings of configuration spaces. Then, based on her work, Bigelow gave a topological model for the Jones polynomial, as a graded intersection pairing between certain homology classes. We aim to create a bridge between these theories, which interplays between representation theory and low dimensional topology. We describe the Bigelow-Lawrence model, emphasising the construction of the homology classes. Then, we show that the sequence of coloured Jones polynomials can be seen through the same formalism, as topological intersection pairings of homology classes in coverings of the configuration space in the punctured disc.

I will explain how Lurie‘s approach to L-theory via Poincaré categories can be extended to yield cobordism categories of Poincaré objects à la Ranicki. These categories can be delooped by an iterated Q-construction and the resulting spectrum is a derived version of Grothendieck-Witt-theory.  Its homotopy type can be described in terms of K- and L-theory as conjectured by Hesselholt-Madsen. Furthermore, it has a clean universal property analogous to that of K-theory, localisation sequences in much greater generality than classical Grothendieck-Witt theory, gives a cycle description of Weiss-Williams‘ LA-theory and allows for maps from the geometric cobordism category, refining and unifying various known invariants.

All original material is joint work with B.Calmès, E.Dotto, Y.Harpaz, M.Land, K.Moi, D.Nardin, T.Nikolaus and W.Steimle.