Marko Samec (1), Antonio Santiago (2), Juan Pablo Cardenas (2), Rosa Maria Benito (2), Ana Maria Tarquis (3), Sacha Jon Mooney (4), Dean Korošak (1,5)

Slides:

Advertisements

Similar presentations

EGEE-III INFSO-RI Enabling Grids for E-sciencE EGEE and gLite are registered trademarks Modeling Grid Job Time Properties Lovro.

Advertisements

Network biology Wang Jie Shanghai Institutes of Biological Sciences.

Traffic-driven model of the World-Wide-Web Graph A. Barrat, LPT, Orsay, France M. Barthélemy, CEA, France A. Vespignani, LPT, Orsay, France.

Leaders and clusters in social space Janusz Hołyst Faculty of Physics and Center of Excellence for Complex Systems Research (CSR), Warsaw University of.

Description of the enzymatic browning in avocado slice using GLCM image texture Stefany Cárdenas, Roberto Quevedo*, Emir Valencia and José Miguel Bastías.

VL Netzwerke, WS 2007/08 Edda Klipp 1 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Networks in Metabolism.

Introduction to Networks and Business Intelligence Prof. Dr. Daning Hu Department of Informatics University of Zurich Sep, 2012.

Information Networks Generative processes for Power Laws and Scale-Free networks Lecture 4.

Weighted networks: analysis, modeling A. Barrat, LPT, Université Paris-Sud, France M. Barthélemy (CEA, France) R. Pastor-Satorras (Barcelona, Spain) A.

Complex Networks Third Lecture TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA TexPoint fonts used in EMF. Read the.

Power law random graphs. Loose definition: distribution is power-law if Over some range of values for some exponent Examples  Degree distributions of.

Scale Free Networks Robin Coope April Abert-László Barabási, Linked (Perseus, Cambridge, 2002). Réka Albert and AL Barabási,Statistical Mechanics.

Introduction to Nonextensive Statistical Mechanics A. Rodríguez August 26th, 2009 Dpto. Matemática Aplicada y Estadística. UPM Grupo Interdisciplinar de.

From Complex Networks to Human Travel Patterns Albert-László Barabási Center for Complex Networks Research Northeastern University Department of Medicine.

Degree correlations in complex networks Lazaros K. Gallos Chaoming Song Hernan A. Makse Levich Institute, City College of New York.

Alon Arad Alon Arad Hurst Exponent of Complex Networks.

Sedgewick & Wayne (2004); Chazelle (2005) Sedgewick & Wayne (2004); Chazelle (2005)

AITIA International Inc. and Lorand Eotvos University, Budapest ROBUST NETWORKS FROM LOCAL OPTIMIZATION A Bottom-Up Model to Generate Networks with Skewed.

Promotion of cooperation on networks? The best response case Carlos P. Roca (1,2) José A. Cuesta (1) Anxo Sánchez (1,3,4) The.

P. Rodríguez, R. Dosil, X. M. Pardo, V. Leborán Grupo de Visión Artificial Departamento de Electrónica e Computación Universidade de Santiago de Compostela.

How is this going to make us 100K Applications of Graph Theory.

Error and Attack Tolerance of Complex Networks Albert, Jeong, Barabási (presented by Walfredo)

Feature extraction Feature extraction involves finding features of the segmented image. Usually performed on a binary image produced from.

Conference title 1 A Few Bad Apples Are Enough. An Agent-Based Peer Review Game. Juan Bautista Cabotà, Francisco Grimaldo (U. València) Lorena Cadavid.

Measurement and Evolution of Online Social Networks Review of paper by Ophir Gaathon Analysis of Social Information Networks COMS , Spring 2011,

Large-scale organization of metabolic networks Jeong et al. CS 466 Saurabh Sinha.

Optimization Based Modeling of Social Network Yong-Yeol Ahn, Hawoong Jeong.

Computer and Automation Research Institute Hungarian Academy of Sciences Generation of Robust Networks with Optimization under Budget Constraints (plus.

Traceroute-like exploration of unknown networks: a statistical analysis A. Barrat, LPT, Université Paris-Sud, France I. Alvarez-Hamelin (LPT, France) L.

Soon-Hyung Yook, Sungmin Lee, Yup Kim Kyung Hee University NSPCS 08 Unified centrality measure of complex networks.

Optimal serverless networks attacks, complexity and some approximate algorithms Carlos Aguirre Maeso Escuela Politécnica Superior Universidad Autónoma.

Robustness of complex networks English workshop on LEAP May 8, 2012 Kyushu Univ. Yuki YOSHIDA Dept. AEEA. Kyushu Univ.

“The Geography of the Internet Infrastructure: A simulation approach based on the Barabasi-Albert model” Sandra Vinciguerra and Keon Frenken URU – Utrecht.

Clustering of protein networks: Graph theory and terminology Scale-free architecture Modularity Robustness Reading: Barabasi and Oltvai 2004, Milo et al.

V 1 – Introduction Mon, Oct 15, 2012 Bioinformatics 3 — Volkhard Helms.

Weighted networks: analysis, modeling A. Barrat, LPT, Université Paris-Sud, France M. Barthélemy (CEA, France) R. Pastor-Satorras (Barcelona, Spain) A.

Complex Networks First Lecture TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA TexPoint fonts used in EMF. Read the.

Using Graph Theory to Study Neural Networks (Watrous, Tandon, Conner, Pieters & Ekstrom, 2012)

October Large networks: a new language for science László Lovász Eötvös Loránd University, Budapest

Mathematics of Networks (Cont)

Soon-Hyung Yook, Sungmin Lee, Yup Kim Kyung Hee University NSPCS 08 Unified centrality measure of complex networks: a dynamical approach to a topological.

Algorithms for Biological Networks Prof. Tijana Milenković Computer Science and Engineering University of Notre Dame Fall 2010.

Networks Igor Segota Statistical physics presentation.

Physics of Flow in Random Media Publications/Collaborators: 1) “Postbreakthrough behavior in flow through porous media” E. López, S. V. Buldyrev, N. V.

International Summer School on Turbulence Diffusion 2006 Multifractal Analysis in B&W Soil Images Ana M. Tarquis Dpto. de Matemática.

The probability of a particle escaping a given cell so that it can it can move either to the cell’s right or left can be calculated as: Where  is defined.

Yongqin Gao, Greg Madey Computer Science & Engineering Department University of Notre Dame © Copyright 2002~2003 by Serendip Gao, all rights reserved.

Workshop on Optimization in Complex Networks, CNLS, LANL (19-22 June 2006) Application of replica method to scale-free networks: Spectral density and spin-glass.

Class 9: Barabasi-Albert Model-Part I

Lecture 10: Network models CS 765: Complex Networks Slides are modified from Networks: Theory and Application by Lada Adamic.

KPS 2007 (April 19, 2007) On spectral density of scale-free networks Doochul Kim (Department of Physics and Astronomy, Seoul National University) Collaborators:

Genome Biology and Biotechnology The next frontier: Systems biology Prof. M. Zabeau Department of Plant Systems Biology Flanders Interuniversity Institute.

Social Networking: Large scale Networks

1 Comparing Humans and AI Agents Javier Insa-Cabrera 1, David L. Dowe 2, Sergio España-Cubillo 1, M.Victoria Hernández-Lloreda 3, José Hernández Orallo.

Class 2: Graph Theory IST402.

An Improved Acquaintance Immunization Strategy for Complex Network.

Evolutionary Graph DispersionSlide 1 of 44 Background: Graph Theory Graph: G = (V,E) –V: set of vertices|V| = n –E: set of edges|E| = m Vertex –a point.

Hyperbolic Geometry of Complex Network Data Konstantin Zuev University of Nevada, Reno.

Response network emerging from simple perturbation Seung-Woo Son Complex System and Statistical Physics Lab., Dept. Physics, KAIST, Daejeon , Korea.

Algorithms and Computational Biology Lab, Department of Computer Science and & Information Engineering, National Taiwan University, Taiwan Network Biology.

Scale-free and Hierarchical Structures in Complex Networks L. Barabasi, Z. Dezso, E. Ravasz, S.H. Yook and Z. Oltvai Presented by Arzucan Özgür.

Cmpe 588- Modeling of Internet Emergence of Scale-Free Network with Chaotic Units Pulin Gong, Cees van Leeuwen by Oya Ünlü Instructor: Haluk Bingöl.

The intimate relationship between networks' structure and dynamics

Random Walk for Similarity Testing in Complex Networks

Topics In Social Computing (67810)

Department of Computer Science University of York

Shan Lu, Jieqi Kang, Weibo Gong, Don Towsley UMASS Amherst

Network Models Michael Goodrich Some slides adapted from:

Fig. 3 Faculty placement distributions.

Graph Theory and Ecology

Presentation transcript:

Marko Samec (1), Antonio Santiago (2), Juan Pablo Cardenas (2), Rosa Maria Benito (2), Ana Maria Tarquis (3), Sacha Jon Mooney (4), Dean Korošak (1,5) (1) Faculty of Civil Engineering, University of Maribor, Maribor, Slovenia (2) Grupo de Sistemas Complejos, Departamento de Física, Universidad Politécnica de Madrid, Madrid, Spain (3) Departamento de Matemática Aplicada, Universidad Politécnica de Madrid, Madrid, Spain (4) Environmental Sciences Section,University of Nottingham, Nottingham, UK (5) Institute of Physiology, Faculty of Medicine, University of Maribor, Maribor, Slovenia

SEE INTODESCRIBEQUANTIFY porous matter

SEE INTODESCRIBEQUANTIFY 3D X-ray CT porous matter

SEE INTODESCRIBEQUANTIFY complex network theory porous matter

SEE INTODESCRIBEQUANTIFY complexity h single parameter porous matter

how can one see into the porous structure of material ?

 part of x-rays absorbed  higher density of the matter, more X-rays are absorbed  the ones that manage to pass, create image pore space measuring cell solid space

 tomography image  crop and scale  contrast  threshold algorithm  binary image

sample average pore size [mm 2 ] perimeter [mm] porosity [%] circularity cement 0 h0, , ,700,69937 cement 2 h0, , ,700,72173 cement 24 h0, , ,110,70707 clay 0 h0, , ,830,68927 clay 2 h0, , ,000,68024 clay 24 h0, , ,010,66495 SC 0 days0, , ,560,66450 SC 14 days0, , ,890,68797 SC 28 days0, , ,780,67895

how can one describe the porous structure of material ?

 Seven Bridges of Königsberg, Euler (1735)  sociogram, Moreno (1993)  p53 gene network, Volgestein et al. (2000)  medicine, biology, computer science, particle physics, economics, sociology, ecology, epidemology, neuroscience,...

 node or vertex  link or edge  direction  weight  node degree  degree distribution

 Erdos-Renyi network (random linking)  scale-free networks (preferential linking) degree distribution

Cumulative size distributions, determined from X-CT images of different porosity φ. All samples show scale-free behaviour of size distribution (solid line) with the exponent α=1,8-2.

 threshold network model (SN)  preferential attachement model (EN) the network heterogeneity can be adjusted by changing the parameters b and m

can one quantify different porous structure of material ?

correlation matrices to further explore the effect of the network parameter m on node correlations we calculated the complexity h of the pore network based on node-node link correlations

by combining X-ray CT and complex network models we can quantify complexity of porous structure with single parameter

Marko Samec (1), Antonio Santiago (2), Juan Pablo Cardenas (2), Rosa Maria Benito (2), Ana Maria Tarquis (3), Sacha Jon Mooney (4), Dean Korošak (1,5) (1) Faculty of Civil Engineering, University of Maribor, Maribor, Slovenia (2) Grupo de Sistemas Complejos, Departamento de Física, Universidad Politécnica de Madrid, Madrid, Spain (3) Departamento de Matemática Aplicada, Universidad Politécnica de Madrid, Madrid, Spain (4) Environmental Sciences Section,University of Nottingham, Nottingham, UK (5) Institute of Physiology, Faculty of Medicine, University of Maribor, Maribor, Slovenia