• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site

Minimal Measure of Balancedness of the Complete Signed Graphs

Student: Kizilov Roman

Supervisor: Dmitry Shvarts

Faculty: Faculty of Computer Science

Educational Programme: Applied Mathematics and Information Science (Bachelor)

Year of Graduation: 2016

Research has two main purposes. First purpose - checking hypotheses about minimal measure of the complete signed graphs. By means of probabilistic method was constructed probabilistic function. Research of this function confirmed that if graph has odd number of vertices, than minimal measure will be achieved at graph with all negative edges. Applied purpose was to compare distribution of measure of balancedness of the complete signed graphs with «empirical distribution» - measure of balancedness for Russian State Duma at different times. It turned out, that these distributions are distinct. Algorithm for finding minimal measure was constructed and complexity of this algorithm found.

Student Theses at HSE must be completed in accordance with the University Rules and regulations specified by each educational programme.

Summaries of all theses must be published and made freely available on the HSE website.

The full text of a thesis can be published in open access on the HSE website only if the authoring student (copyright holder) agrees, or, if the thesis was written by a team of students, if all the co-authors (copyright holders) agree. After a thesis is published on the HSE website, it obtains the status of an online publication.

Student theses are objects of copyright and their use is subject to limitations in accordance with the Russian Federation’s law on intellectual property.

In the event that a thesis is quoted or otherwise used, reference to the author’s name and the source of quotation is required.

Search all student theses