Noticias en español
Seminars appear in decreasing order in relation to date. To find an activity of your interest just go down on the list. Normally seminars are given in English. If not, they will be marked as Spanish Only.
Growing Networks with Random Walks
Abstract: Network growth is a fundamental theme that has received much attention over the past decades. Various models that embody principles such as preferential attachment and local attachment rules have been proposed and studied. Among various approaches, random walks have been leveraged to capture such principles. In this work we propose and study the No Restart Random Walk (NRRW) model where a walker builds its network while moving around. In particular, after the walker takes s steps (a parameter) on the current network a new node...
Análisis espacio-temporal de la isla de calor urbano en la ciudad de Santiago de Chile, utilizando datos de MODIS (2000 al 2016)
Participación en Linea: http://vcespresso.redclara.net/@352109705c115cdd511fb968f9f4ff86# Use Explorer, Firefox o Safari. Debe tener instalado Flash Player en su navegador.
“Estudio comparativo de procesos de resolución de problemas y de juegos de estrategias en educación primaria”
Resumen: A partir del diseño de cuatro actividades pedagógicas, dos juegos de estrategia y dos problemas no rutinarios, se estudia los procesos de resolución en busca de similitudes y diferencias. El objetivo general es: Comparar los procesos de resolución de problemas y de juegos de estrategia buscando evidencias que permitan establecer relaciones entre ambos procesos. Seguido de los objetivos específicos: a) Identificar los episodios presentes en la resolución de problemas, b) Identificar los episodios presentes en la resolución de juegos...
A martingale approach to convergence to the Kingman’s coalescente
Abstract: We consider the following dynamic. We start with a fix number of labeled, i.i.d. Markov chains over a finite state space, let the time pass, and when two chains meet, they behave as one chain. This dynamic induces a process in the set of partitions of the first natural numbers. We are interested in the asymptotic behavior of this process. On the late eighties J. T. Cox obtained some limit theorems for coalescing random walks on the discrete torus, when the Markov chains we considered before are simple random walks and we start with...
Seminarios Sistemas Dinámicos de Santiago y Seminario Kawin
TIME (Mon 27th May) 4:30 pm – 5:30 pm LOCATION Sala 1, PUC, Facultad de Matemáticas, Av. Vicuña Mackenna 4860, Macul, La Florida SPEAKER Ryo Moore (PUC) TITLE Properties of Birkhoff spectra for the generic continuous functions on a shift space ABSTRACT (Attached please find the abstract of the talk) TIME (Mon 27th May) 3:30 pm – 4:20 pm LOCATION Sala 1, PUC, Facultad de Matemáticas, Av. Vicuña Mackenna 4860, Macul, La Florida SPEAKER Sebastián Donoso (UOH – UCH) TITLE Expansiveness and dimension of...
“Análisis de reactores nucleares empleando teoría de difusión de neutrones”
La presentación se enmarca en el convenio de colaboración entre la Comisión Chilena de Energía Nuclear y el Centro de Modelamiento Matemático de la Facultad de Ciencias Físicas y Matemáticas de la Universidad de Chile. Contenido: i) Breve descripción del reactor RECH-1 de la CCHEN, ii) Interacciones de los neutrones con la materia, iii) Modelos empleados en el análisis de reactores nucleares, iv) Teoría de difusión de neutrones monoenergéticos y aplicaciones al cálculo de un reactor crítico, v) Teoría de difusión a...
Graph decompositions using group actions
Abstract: I will present some recent results on graph decompositions. To this end, we find a very `nice’ subgraph H in a host graph we would like to decompose into copies of H. Then we employ a group action to `rotate’ H. This rotation yields a decomposition of the host graph into copies of H. We construct this `nice’ subgraph using probabilistic tools, a well-known hypergraph matching theorem due to Pippenger and Spencer and an absorption method. This is joint work with Stefan Ehard and Stefan Glock.
Farkas’ lemma: some extensions and applications
Abstract: The classical Farkas’ lemma characterizing the linear inequalities which are consequence of an ordinary linear system was proved in 1902 by this Hungarian Physicist to justify the first order necessary optimality condition for nonlinear programming problems stated by Ostrogradski in 1838. At present, any result characterizing the containment of the solution set of a given system in the sublevel sets of a given function is said to be a Farkas-type lemma. These results provide partial answers to the so-called containment problem,...
Assouad dimension of planar self-affine sets
ABSTRACT: We consider planar self-affine sets X satisfying the strong separation condition and the projection condition. We show that any two points of X, which are generic with respect to a self-affine measure having simple Lyapunov spectrum, share the same collection of tangent sets. We also calculate the Assouad dimension of X. Finally, we prove that if X is dominated, then it is minimal for the conformal Assouad dimension. The talk is based on joint work with Balázs Bárány and Eino Rossi.
Partially localized solutions of some elliptic equations on $R^{N+1}
Abstract: It is well known that, under quite general assumptions, fully localized solutions of a homogeneous semilinear elliptic equation must be radially symmetric. Many authors have exhibited the complexity of solutions which are only partially localized (that is, only decaying in some variables). In this talk I consider solutions which are quasiperiodic in one variable, decaying in all the others. In the first part of the talk I develop a framework for finding such solutions in the nonhomogeneous case; in the second part I show the...
