Anna Muranova

Has grant

assistant professor

University of Warmia and Mazury in Olsztyn
Country flagPoland

Research Interests

ApplyKite TwinLearns as you apply

Make your next move.

Prepare your application

Review drafts before you send them.

Explore related searches

About

Dr. Anna Muranova is an assistant professor at the University of Warmia and Mazury in Olsztyn, Poland. Her research focuses on the capacity of infinite graphs, complex weighted networks, and the effective impedance in both finite and infinite networks. She has published several articles in these areas, contributing valuable insights into non-Archimedean ordered fields and their applications in network theory.

Recent Grants

Grant: Open

CA24122 - mSPACE: multiscale Stochastics, Patterns, and Analysis of Combinatorial Environments

Open Date: 2025-09-01

Close Date: 2029-09-01

Grant: Close

Dirichlet problem for infinite graphs over ordered fields

Open Date: 2022-11-01

Close Date: 2023-11-01

Articles (10)

We investigate the spectrum of the normalized Laplacian $\mathcal L$ for finite graphs over non-Archimedean ordered fields. We prove a Cheeger's inequality for the first non-zero eigenvalue. Further, we show that, on the contrary to the real case, for the transition operator $\mathcal P=I-\mathcal L$ and for any non-bipartite non-complete graph over a non-Archimedean field there is always a subspace of functions for which an analogue of random walk, i.e. $\mathcal P^m f$, does not converge. Moreover, we show that the strong Cheeger estimate $\alpha_1\preceq \sqrt{1-h^2}$ for the second largest eigenvalue of $\mathcal P$ is crucial for the investigation of convergence of $\P^m f$ to the equilibrium over non-Archimedean ordered fields. We provide examples of convergence and non-convergence for graphs over the Levi-Civita field.

Year:

2026

Year:

2025

Year:

2025

Year:

2025

We introduce notions of recurrence and transience for graphs over a non‐Archimedean ordered field. To achieve this, we establish a connection between these graphs and random walks on directed graphs over the reals. In particular, we give a characterization of the real directed graphs which can arise in such a way. As a main result, we give characterization for recurrence and transience in terms of a quantity related to the capacity.

Year:

2025

Year:

2022

Year:

2022

Year:

2022

Year:

2021

Year:

2020

Collaborators (1)

Florian Fischer

University of Hagen

GERMANY
View details