Россия
303 отслеживающих 298 контактов

Присоединиться, чтобы просмотреть профиль

Действия

Опыт работы и образование

  • Yandex

См. все сведения об опыте работы участника Alexandr

Просмотрите должность участника, продолжительность его(ее) работы и другие сведения.

или

Нажимая «Продолжить», чтобы присоединиться или выполнить вход, вы принимаете условия Пользовательского соглашения, Политики конфиденциальности и Политики использования файлов cookie LinkedIn.

Лицензии и сертификаты

Публикации

  • Generalized preferential attachment: tunable power-law degree distribution and clustering coefficient

    WAW 2013

    We propose a wide class of preferential attachment models of random graphs, generalizing previous approaches. Graphs described by these models obey the power-law degree distribution, with the exponent that can be controlled in the models. Moreover, clustering coefficient of these graphs can also be controlled. We propose a concrete flexible model from our class and provide an efficient algorithm for generating graphs in this model. All our theoretical results are demonstrated in practice on…

    We propose a wide class of preferential attachment models of random graphs, generalizing previous approaches. Graphs described by these models obey the power-law degree distribution, with the exponent that can be controlled in the models. Moreover, clustering coefficient of these graphs can also be controlled. We propose a concrete flexible model from our class and provide an efficient algorithm for generating graphs in this model. All our theoretical results are demonstrated in practice on examples of graphs obtained using this algorithm. Moreover, observations of generated graphs lead to future questions and hypotheses not yet justified by theory.

    См. публикацию
  • On the number of subgraphs of the Barabási-Albert random graph

    Izvestiya: Mathematics

    Abstract. We study a model of a random graph of the type of the Barabási–Albert preferential
    attachment model. We develop a technique that makes it possible to estimate the
    mathematical expectation for a fairly wide class of random variables in the model under ...

    См. публикацию
  • On the number of subgraphs of a random graph in the Barabasi-Albert model

    Doklady Mathematics

    Over the past decade, many papers have appeared in which the internet was studied and its
    properties were modeled by using random graphs. One of the first and most popular models
    is the preferential attach ment model suggested by Barabasi and Albert in 1999 (see [1, ...

    См. публикацию
  • Isomorphisms of Cayley graphs of a free Abelian group

    Siberian Mathematical Journal

    Abstract: A group G is called a CI-group provided that the existence of some automorphism σ
    ∈ Aut(G) such that σ(A) = B follows from an isomorphism Cay(G, A) ∼= Cay(G, B) between Cayley
    graphs, where A and B are two systems of generators for G. We prove that every finitely ...

    См. публикацию

Проекты

Звания и награды

  • Hackathon 1st prize

    AccorHotels /NUMA Start-up Accelerator hackathon

    Hackathon 1st prize for chat bot base hotel personal assistant.

  • Potanin Scholarship

    charitable foundation of Vladimir Potanin

  • Potanin Scholarship

    charitable foundation of Vladimir Potanin

  • Potanin Scholarship

    charitable foundation of Vladimir Potanin

  • Third Prize

    16th International Mathematics Competition, Budapest, Hungary

    as member of MIPT team

  • Potanin Scholarship

    charitable foundation of Vladimir Potanin

    http://www.stipendia.ru/programs
    http://fondpotanin.ru/english-c73

  • Bronze medal

    National High School Mathematical Olympiad final

Языки

  • English

    Профессиональное владение

См. полный профиль участника Alexandr

  • Найти общих знакомых
  • Попросить представить
  • Связаться с участником Alexandr напрямую
Присоединиться для просмотра полного профиля

Другие похожие профили

Получите новые навыки с помощью этих курсов