Hola,
¿eres nuevo aquí?

Regístrate gratis y conecta tu empresa con financiación pública, partners y proyectos.

Tengo cuenta

Regístrate

Ver video

DYNAMICMARCH

Financiado

Cerrado

Dynamics of Multiple Interacting and Concurrent Markov Chains

Markov chains are fundamental processes and have been studied in nearly every scientific discipline in the past 100 years. In computer science, reversible Markov chains, also known as random walks, form the basis of many efficient... ver más

30/04/2021

THE CHANCELLOR MAS...

1M€

Presupuesto del proyecto: 1M€

Líder del proyecto

THE CHANCELLOR MASTERS AND SCHOLARS OF THE UN... No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Fecha límite participación Sin fecha límite de participación.

Financiación concedida El organismo H2020 notifico la concesión del proyecto el día 2021-04-30

ERC-StG-2015: ERC Starting Grant

I+D

Cerrada hace 9 años

0% 100% 100%

Información adicional privada

No hay información privada compartida para este proyecto. Habla con el coordinador.

1 Participantes

THE CHANCELLOR MASTERS AND S...

1.40M€ | Lider

Conecta tu I+D

¿Tienes un proyecto y buscas un partner? Gracias a nuestro motor inteligente podemos recomendarte los mejores socios y ponerte en contacto con ellos. Te lo explicamos en este video

Proyectos interesantes

NADINE New tools and Algorithms for Directed NEtwork Analysis 2M€ Cerrado

PID2020-114594GB-C21 OPTIMIZATION ON DATA SCIENCE AND NETWORK DESIGN PROBLEMS: LA... 210K€ Cerrado

PROXNET Modelling Complex Networks Through Graph Editing Problems 208K€ Cerrado

PID2020-114594GB-C22 OPTIMIZATION ON DATA SCIENCE AND NETWORK DESIGN PROBLEMS: DA... 29K€ Cerrado

ScaleOpt Scaling Methods for Discrete and Continuous Optimization 1M€ Cerrado

MTM2015-67304-P ESTIMACION DE REDES LATENTES 53K€ Cerrado

Duración del proyecto: 63 meses Fecha Inicio: 2016-01-25
Fecha Fin: 2021-04-30

Líder del proyecto

THE CHANCELLOR MASTERS AND SCHOLARS OF THE UN... No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Presupuesto del proyecto 1M€

Fecha límite de participación Sin fecha límite de participación.

Descripción del proyecto Markov chains are fundamental processes and have been studied in nearly every scientific discipline in the past 100 years. In computer science, reversible Markov chains, also known as random walks, form the basis of many efficient randomised algorithms which have been successfully applied to a variety of complex sampling, learning and optimisation problems. Nowadays an increasing number of algorithms and processes on networks are based on multiple (concurrent and possibly dependent) random walks, including algorithms for packet routing, content search, graph clustering, link prediction and website ranking. This trend will be reinforced by the steady growth of large-scale networks and massive data sets. However, the existing theory of single random walks is not well-suited to cope with the complexity inherent to multiple random walks, and even for independent walks many fundamental questions remain open. The goal of this proposal is to develop a systematic and rigorous study of multiple random walks. First, we will analyse this random process via commonly used metrics such as hitting times, cover times, mixing times as well as new quantities which are unique to multiple random walks. Then we will connect these quantities to structural properties of the underlying graph. Finally, these insights will be applied to the design of new efficient randomised algorithms for large graphs and distributed networks.

Conecta tu I+D

Entra hoy

¿Olvidé mi contraseña?

Financiación

Empresas

CTIs/Universidades

Proyectos

Investigadores